๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Bit-serial multiplication in GF(2m) using irreducible all-one polynomials

โœ Scribed by Fenn, S.T.J.; Parker, M.G.; Benaissa, M.; Taylor, D.


Book ID
114448313
Publisher
The Institution of Electrical Engineers
Year
1997
Tongue
English
Weight
297 KB
Volume
144
Category
Article
ISSN
1350-2387

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


More efficient systolic arrays for multi
โœ Soonhak Kwon; Chang Hoon Kim; Chun Pyo Hong ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 416 KB

a b s t r a c t Systolic arrays for multiplication in GFรฐ2 m รž of Yeh et al. with LSB (least significant bit) first algorithm have the unfavorable properties such as increased area complexity and bidirectional data flows compared with the arrays of Wang and Lin with MSB (most significant bit) first