Universal Reed-Solomon decoders based on the Berlekamp-Massey algorithm

Universal Reed-Solomon decoders allow flexibility in some or all of the code parameters,and hence lend themselves to applications wherein adaptability and reconfigurability are important considerations. In this paper,we consider universal finite field arithmetics using either canonical polynomial basis or shifted polynomial basis, and propose a high-speed universal Reed-Solomon decoder by modifying the high-speed decoder proposed in [10 ].

[1]  Chien-Ming Wu,et al.  An area-efficient versatile Reed-Solomon decoder for ADSL , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[2]  Tho Le-Ngoc,et al.  A Cellular Structure for a Versatile Reed-Solomon Decoder , 1997, IEEE Trans. Computers.

[3]  Pravin Varaiya,et al.  Capacity of fading channels with channel side information , 1997, IEEE Trans. Inf. Theory.

[4]  Tho Le-Ngoc,et al.  A Versatile Time-Domain Reed-Solomon Decoder , 1990, IEEE J. Sel. Areas Commun..

[5]  Richard E. Blahut,et al.  A Universal Reed-Solomon Decoder , 1984, IBM J. Res. Dev..

[6]  Stephen B. Wicker,et al.  Reed-Solomon Codes and Their Applications , 1999 .

[7]  Naresh R. Shanbhag,et al.  High-speed architectures for Reed-Solomon decoders , 2001, IEEE Trans. Very Large Scale Integr. Syst..

[8]  H. Samueli,et al.  A single-chip universal digital satellite receiver with 480 MHz IF input , 1999, 1999 IEEE International Solid-State Circuits Conference. Digest of Technical Papers. ISSCC. First Edition (Cat. No.99CH36278).

[9]  Fabrizio Lombardi,et al.  VLSI algorithms, architectures, and implementation of a versatile GF(2/sup m/) processor , 2000 .

[10]  Tho Le-Ngoc,et al.  Decoding Reed-Solomon codes generated by any generator polynomial , 1989 .

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

[12]  Trieu-Kien Truong,et al.  Systolic Multipliers for Finite Fields GF(2m) , 1984, IEEE Transactions on Computers.

[13]  M. A. Hasan,et al.  Efficient architectures for computations over variable dimensional Galois fields , 1998 .