VHDL Modelling of Reed Solomon Decoder

In digital communication systems, both random and burst errors may occur in the transmission channel. As a result, the signal will be distorted at the receiver. Error correction coding is required to eliminate such errors. In this study, a Reed Solomon (255, 191) error correction code is modelled to detect and correct the data transmitted in a noisy channel. Reed Solomon (RS) codec is a powerful error correction tool that is used to ensure the errors correction in digital communication systems. However, RS codec is computionally intensive and custom design is required for different digital systems. RS decoder modeling using Very High speed hardware Description Language (VHDL) made it suitable to be implemented on a Field Programmable logic Array (FPGA) based copocessor. The flexibility of FPGA in hardware reconfiguration greatly reduces the development time for RS decoder in all kinds of specialized circuit designs. The arithmetic operations which are used in RS code were Galois Fields (GF) addition and multiplication. This study presented: i) RS encoder modelled using MATLAB with data encoded in the noisy channel for functional verification. ii) RS decoder modelled in Very High speed hardware Description Language (VHDL) to recover the erroneous data. RS decoder has been successfully simplified to only four sub-modules in order to reduce the FPGA's resources utilization. The VHDL modelled RS (255, 191) decoder has the capability of 32 symbol-errors detection and correction. It can be added into the VHDL designer library for future system designs.

[1]  R. Roth,et al.  Efficient decoding of Reed-Solomon codes beyond half the minimum distance , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[2]  Xu He,et al.  A New High-Speed Architecture for Reed-Solomon Decoder , 2009, 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing.

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

[4]  L. J. Deutsch,et al.  On the VLSI Design of a Pipeline Reed-Solomon Decoder Using Systolic Arrays , 2003 .

[5]  Jongyoon Shin,et al.  A High-Speed Pipelined Degree-Computationless Modified Euclidean Algorithm Architecture for Reed-Solomon Decoders , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[6]  Krishna R. Narayanan,et al.  Algebraic Soft-Decision Decoding of Reed–Solomon Codes Using Bit-Level Soft Information , 2006, IEEE Transactions on Information Theory.

[7]  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.

[8]  Alexander Vardy,et al.  Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.

[9]  Hsie-Chia Chang,et al.  A Low-Power Design for Reed-Solomon Decoders , 2003, J. Circuits Syst. Comput..

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

[11]  James S. Plank A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems , 1997 .