A parametrical architecture for Reed-Solomon decoders

Reed-Solomon decoders are digital decoders that use RS detecting and correcting of errors codes. RS codes are widely diffused in the transmission and storage of digital information and they are often used in concatenated encoding schemes to obtain great correction capabilities and good robustness to burst errors. In this study, a parametrical approach was chosen for decoder implementation at gate-level, based on the Berlekamp algorithm. This means that the decoder structure depends on two parameters: the bit number used for the symbol representation (m), and the error correction capability (t). The obtained architecture is suitable for a large number of different application (including high definition digital TV) and can be quickly synthesised using Synopsys for any required values of m and t.

[1]  J. H. Yuen,et al.  A VLSI design of a pipeline Reed-Solomon decoder , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[2]  R. Blahut Theory and practice of error control codes , 1983 .

[3]  Elwyn R. Berlekamp,et al.  Bit-serial Reed - Solomon encoders , 1982, IEEE Transactions on Information Theory.

[4]  Trieu-Kien Truong,et al.  A VLSI Design of a Pipeline Reed-Solomon Decoder , 1985, IEEE Transactions on Computers.

[5]  Trieu-Kien Truong,et al.  VLSI Architectures for Computing Multiplications and Inverses in GF(2m) , 1983, IEEE Transactions on Computers.

[6]  Vijay K. Bhargava,et al.  Division and bit-serial multiplication over GF(qm) , 1992 .