✦ LIBER ✦

Single error correctable bit parallel multipliers over GF(2m)

✍ Scribed by Mathew, J.; Jabir, A.M.; Rahaman, H.; Pradhan, D.K.

Book ID: 117809846
Publisher: The Institution of Engineering and Technology
Year: 2009
Tongue: English
Weight: 389 KB
Volume: 3
Category: Article
ISSN: 1751-8601
DOI: 10.1049/iet-cdt.2008.0015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Low-complexity bit-parallel systolic mul

Low-complexity bit-parallel systolic multipliers over GF(2m)

✍ Chiou-Yng Lee 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Efficient bit-parallel multipliers over

Efficient bit-parallel multipliers over finite fields GF(2m)

✍ Chiou-Yng Lee; Pramod Kumar Meher 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 506 KB

Hardware implementation of multiplication in finite field GF(2 m ) based on sparse polynomials is found to be advantageous in terms of space-complexity as well as the time-complexity. In this paper, we present a new permutation method to construct the irreducible like-trinomials of the form (x + 1)

On-Line Error Detection for Bit-Serial M

On-Line Error Detection for Bit-Serial Multipliers in GF(2m)

✍ Sebastian Fenn; Michael Gossel; Mohammed Benaissa; David Taylor 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 287 KB

Derivation of Reduced Test Vectors for B

Derivation of Reduced Test Vectors for Bit-Parallel Multipliers over GF(2^m)

✍ Rahaman, H.; Mathew, J.; Pradhan, D.K.; Jabir, A.M. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 661 KB

Low complexity bit-parallel systolic mul

Low complexity bit-parallel systolic multiplier over GF(2m) using irreducible trinomials

✍ Chiou-Yng Lee 📂 Article 📅 2003 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 238 KB

Low-Complexity Bit-Parallel Multiplier o

Low-Complexity Bit-Parallel Multiplier over GF(2m) Using Dual Basis Representation

✍ Chiou-Yng Lee; Jenn-Shyong Horng; I-Chang Jou 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 319 KB