DocumentCode :
839309
Title :
Low-complexity finite field multiplier using irreducible trinomials
Author :
Chiou, C.W. ; Lin, L.C. ; Chou, F.H. ; Shu, S.F.
Author_Institution :
Dept. of Electron. Eng., Ching Yun Univ., Chung-li, Taiwan
Volume :
39
Issue :
24
fYear :
2003
Firstpage :
1709
Lastpage :
1711
Abstract :
A low-complexity array multiplier for GF(2m) fields with an irreducible trinomial Xm+Xn+1 is presented. The space complexity of the proposed multiplier is reduced from order O(m2) to O(m) compared with the Lee´s array multiplier. The time complexity of the proposed multiplier is about half that of Lee´s array multiplier.
Keywords :
Galois fields; digital arithmetic; logic arrays; logic design; polynomials; Galois fields; Lee array multiplier; array multiplier; irreducible trinomials; low-complexity finite field multiplier; multiplier space complexity;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:20031050
Filename :
1251531
Link To Document :
بازگشت