A bit-serial multiplier for GF(2m) is presented. This multiplier operates in a similar way to the traditional Berlekamp multiplier and has the same hardware requirements. However the format of the inputs to the proposed multiplier is different, and in some circumstances constant multipliers based on this approach can be clocked faster than those based on the traditional Berlekamp multiplier.
References
-
-
1)
-
E.R. Berlekamp
.
Bit-serial Reed-Solomon encoders.
IEEE Trans.
,
869 -
874
-
2)
-
Fenn, S.T.J.: `Optimised algorithms and circuit architectures for performing finitefield arithmetic in Reed-Solomon codecs', 1993, PhD, University of Huddersfield.
-
3)
-
M. Morii ,
M. Kasahara ,
D.L. Whiting
.
Efficient bit-serial multiplication and the discrete-time Wiener-Hopftequation over finite fields.
IEEE Trans.
,
1177 -
1183
-
4)
-
R. Lidl ,
H. Niederreiter
.
(1986)
An introduction to finite fields and their applications.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19951303
Related content
content/journals/10.1049/el_19951303
pub_keyword,iet_inspecKeyword,pub_concept
6
6