DocumentCode :
797542
Title :
Bit-serial Berlekamp-like multipliers for GF(2m)
Author :
Fenn, S.T.J. ; Benaissa, M. ; Taylor, D.
Author_Institution :
Div. of Electron. & Commun., Huddersfield Univ., UK
Volume :
31
Issue :
22
fYear :
1995
fDate :
10/26/1995 12:00:00 AM
Firstpage :
1893
Lastpage :
1894
Abstract :
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
Keywords :
Galois fields; Reed-Solomon codes; decoding; digital arithmetic; encoding; logic circuits; multiplying circuits; GF(2m); RS codes; bit-serial multiplier; constant multipliers;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:19951303
Filename :
490641
Link To Document :
بازگشت