期刊名称:International Journal of Computer Science and Network Solutions
印刷版ISSN:2345-3397
出版年度:2014
卷号:2
期号:8
页码:58-71
出版社:International Journal of Computer Science and Network Solutions
摘要:Reed-Solomon (RS) codes are widely employed for error correction due to their distinct capability of correctingboth random and burst errors. These codes are very popularly used in many applications, like storage devices (CD,DVD), wireless communications, high speed modems, satellite communications and highly reliable memorysystems. But the complexities of RS encoder and decoder increase with the error correcting capability of the codes.Hence many researchers have put their effort to minimize the complexity of RS codec. A VLSI system designeralways prefers to have simple, regular, modular and cascade-able structure with local interconnection, for reliableand high speed operation of the circuit. It has been found that these parameters are supported by local neighborhoodCA. This class of codes is known as CA-based error correcting codes (CAECC). CA is mathematical idealization ofphysical systems, in which space and time are discrete, and each cell can assume the value 0 or 1. The cells evolvein discrete time steps according to some deterministic rule that depends only on logical neighborhood. In this paperwe investigate different CA-based error correcting codes schemes, presented in this area. The results show that theCA-based encoding/decoding scheme is suitable, from VLSI design viewpoint, and attractive for its simplicity,regularity and higher throughput. Also, it requires significantly less hardware, compared to the existing techniquesemployed for Reed–Solomon (RS) codes
关键词:Error Control Codes; Cellular Automata; RS codes