✦ LIBER ✦

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

✍ Scribed by Chiou-Yng Lee

Book ID: 108298631
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 254 KB
Volume: 41
Category: Article
ISSN: 0167-9260
DOI: 10.1016/j.vlsi.2007.05.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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)

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

Unified Parallel Systolic Multiplier Ove

Unified Parallel Systolic Multiplier Over({it GF}(2^{m}))

✍ Chiou-Yng Lee; Yung-Hui Chen; Che-Wun Chiou; Jim-Min Lin 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 518 KB

Low complexity bit-parallel systolic arc

Low complexity bit-parallel systolic architecture for computing C+AB2 over a class of GF(2m)

✍ Yeun-Renn Ting; Erl-Huei Lu; Jau-Yien Lee 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 288 KB

A dual basis bit-serial systolic multipl

A dual basis bit-serial systolic multiplier for GF(2m)

✍ S.T.J. Fenn; D. Taylor; M. Benaissa 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 539 KB

Bit-Parallel Arithmetic Implementations

Bit-Parallel Arithmetic Implementations over Finite Fields GF(2m) with Reconfigurable Hardware

✍ José Luis Imaña 📂 Article 📅 2002 🏛 Springer Netherlands 🌐 English ⚖ 139 KB