TECHNOLOGY Easing Complication and Error Detection of RS Codes Using CA based Codes
N. Mageswari, Krishnan Mahadevan · 2013
This paper reports a novel approach for Cellular Au tomata (CA) based byte error correction codes to ex tend the integrated architecture of Reed-Solomon (RS) codes. In general, reed Solomon codes are widely used for forward error correction codes in communication system. Burst-error correction is a relatively complicated pla ying field because of the computational difficulty. In Existin g work, they propose a unified design of reed Solom on decoder for correcting the random errors and burst error wi th fewer complications. In this paper, we propose C ellular Automata based byte error correction by using an ad aptive algorithm which can correct the random error as well as burst and byte level of error detection and correct ion. With these automata, the power and error corre ction improves for both the encoder and decoder can be efficiently implemented with an array of CA with high throughput. This design is best suited for high speed memory systems built with byte organized RAM chips. This design methodology is so simple which can be implemented in VLSI design.