N-BYTE ERROR DETECTING AND CORRECTING CODE USING REED- SOLOMON AND CELLULAR AUTOMATA APPROACH

Single and double byte errors are most common errors in memory systems. With the advancement of technologies, more information bytes can be send over a transmission channel, but this increases the probability of more errors. Here we propose a methodology for detecting and correcting N-byte errors in the information bytes based on cellular automata (CA) concept. Cellular automata already accepted as an attractive structure for error detecting and correcting codes. In this paper, highly efficient, reliable and less complex cellular automata based N-byte error correcting encoder and decoder has been proposed. The design is capable of adding 2N check bytes corresponding to N information bytes at the encoder, which are used at the decoder section to detect and correct the byte errors.

[1]  Hanho Lee High-speed VLSI architecture for parallel Reed-Solomon decoder , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

[2]  W. Wilhelm A new scalable VLSI architecture for Reed-Solomon decoders , 1999 .

[3]  Indrajit Chakrabarti,et al.  An Improved Double Byte Error Correcting Code Using Cellular Automata , 2008, ACRI.

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

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