The paper presents a systolic serial dual basis multiplier for the Galois field GF(2m) which is based on the Berlekamp-like multiplication algorithm. It needs only one control signal and is easy to simplify for the field which is generated by the irreducible polynomial xm + x + 1. The multiplier's architecture is highly regular, modular and easily expandable, hence it is suitable for implementation using VLSI technologies.
References
-
-
1)
-
B. Hochet ,
P. Quinton ,
R. Yves
.
Systolic Gaussian elimination over GF(p) with partialpivoting.
IEEE Trans. Comput.
,
9 ,
1321 -
1324
-
2)
-
Diab, M.: `Systolic architectures for multiplication over finite field GF(2', 8th international conference AAECC-8, August 1990, Tokyo, Japan, p. 329–340.
-
3)
-
P. Quinton ,
Y. Robert
.
(1989)
Algorithmes et architectures systoliques.
-
4)
-
S.T.J. Fenn ,
M. Benaissa ,
D. Taylor
.
GF(2m) multiplication and division over the dual basis.
IEEE Trans. Comput.
,
3 ,
319 -
327
-
5)
-
R.J. Webb
.
(1988)
Digital technology with MOS integrated circuits.
-
6)
-
R.J. McEliece
.
(1987)
Finite fields for computer scientists and engineers.
-
7)
-
R. Lidl ,
H. Niederreiter
.
(1986)
An introduction to finite fields and their applications.
-
8)
-
S.T.J. Fenn ,
M. Benaissa ,
D. Taylor
.
Bit serial Berlekamp-like multipliers for GF(2m).
Electron. Lett.
,
22 ,
1893 -
1894
-
9)
-
M. Diab ,
A. Poli
.
New bit-serial systolic multiplier for GF(2m) using irreducible trinomials.
Electron. Lett.
,
13 ,
1183 -
1184
-
10)
-
S.T.J. Fenn ,
D. Taylor ,
M. Benaissa
.
A dual basis bit-serial systolic multiplier for GF(2m).
Integr., VLSI J.
,
139 -
149
-
11)
-
S.T.J. Fenn ,
D. Taylor ,
M. Benaissa
.
A dual basis systolic multiplier for GF(2m).
IEE Proc.- Comput. Digit. Tech.
,
1 ,
43 -
46
-
12)
-
E.R. Berlekamp
.
Bit-serial Reed-Solomon encoders.
IEEE Trans.
,
6 ,
869 -
874
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-cdt_19981938
Related content
content/journals/10.1049/ip-cdt_19981938
pub_keyword,iet_inspecKeyword,pub_concept
6
6