By Topic

GF(2m) multiplication over triangular basis for design of Reed-Solomon codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Furness, R. ; Dept. of Electr. & Electron. Eng., Huddersfield Univ., UK ; Benaissa, M. ; Fenn, S.T.J.

Bit-serial and bit-parallel multiplication architectures for GF(2m) are presented, using a triangular basis representation of field elements. The paper is a development of the work originally presented by Hasan and Bhargava. It is shown that, by forcing these multipliers to operate entirely over the triangular basis, lower latency delays and hardware savings can be made. Also, a more flexible definition of the triangular basis is presented, which allows a number of triangular bases to any given basis to be defined. It is shown that when the defining irreducible polynomial is a trinomial, the triangular basis is a simple permutation of the polynomial basis elements. Furthermore, if the defining irreducible polynomial is a pentanomial of a certain form the triangular basis to polynomial basis conversion requires minimal hardware and a reordering of basis coefficients

Published in:

Computers and Digital Techniques, IEE Proceedings -  (Volume:145 ,  Issue: 6 )