Efficient standard basis Reed-Solomon encoder

Authors:
S. K. Jain;K. K. Parhi
Affiliations:
Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA;-
Venue:
ICASSP '96 Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06
Year:
1996

Citing 0
Cited 3

Hardware performance characterization of block cipher structures

CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Systolic and non-systolic scalable modular designs of finite field multipliers for reed-solomon codec

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Efficient semisystolic architectures for finite-field arithmetic

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an efficient Reed-Solomon encoder based on standard basis. The key operation in Reed-Solomon encoding is the multiplication of a feedback term with several (possibly) known terms. We present an efficient structure to implement this operation. The hardware complexity of this encoder is identical to the well-known Berlekamp encoder. It however, offers two advantages over the Berlekamp encoder-a critical path independent of the order of Reed-Solomon code being implemented and the ability to encode without any need for basis conversion.