This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
CA-Based Byte Error-Correcting Code
March 1995 (vol. 44 no. 3)
pp. 371-382

Abstract—This paper reports a novel approach for designing byte error-correcting codes using cellular automata (CA). A simple scheme for generation and decoding of single-byte error-correcting and double-byte error-detecting codes, referred to as CA-SbEC-DbED, is presented. Extension of the scheme to locate/correct larger number of information byte errors has been also included. The encoding and decoding algorithms have been designed with the help of a linear operator that can be conveniently realized with a maximum length group CA. The regular, modular and cascadable structure of CA can be economically built with VLSI technology. Compared to the existing architecture of the Reed-Solomon decoder chip, CA-based implementation of the proposed decoding scheme provides a simple cost effective solution.

[1] A.K. Das and P. Pal Chaudhuri, "Efficient Characterization of Cellular Automata," Proc. IEE (Part E), vol. 137, pp. 81-87, Jan. 1990.
[2] S. Wolfram,“Statistical mechanics of cellular automata,” Rev. Modern Physics, vol. 55, no. 3, July 1983.
[3] A.K. Das,D. Saha,S. Misra,, and P.P. Chaudhuri,“Signature analyzer based on additive cellular automata,” Proc. Conf. 20th Fault Tolerant Computing Systems, pp. 265-272, June 1990,U.K.
[4] P.D. Hortensius et al., "Cellular Automata Based Pseudo-Random Number Generators for Built-In Self-Test," IEEE Trans. Computer-Aided Design, vol. 8, pp. 842-859, Aug. 1989.
[5] W. Pries, A. Thanailakis, and H.C. Card, "Group Properties of Cellular Automata and VLSI Applications," IEEE Trans. Computers, vol. 35, no. 12, pp. 1,013-1,024, Dec. 1986.
[6] M. Serra et al., "The Analysis of One-Dimensional Linear Cellular Automata and Their Aliasing Properties," IEEE Trans. Computer-Aided Design, vol. 9, no. 7, pp. 767-778, July 1990.
[7] A. Das and P.P. Chaudhuri, “Pseudo-Exhaustive Test Pattern Generation Using Cellular Automata,” IEEE Trans. Computers, Vol. 42, No. 3, Mar. 1993, pp. 340-352.
[8] D. Roy Chowdhury, S. Basu, I. Sen Gupta, and P. Pal Chaudhuri, "Design of CAECC—Cellular Automata Based Error Correcting code," IEEE Trans. Computers, vol. 43, no. 6, pp. 759-764, June 1994.
[9] D. Roy Chowdhury and P. Pal Chaudhuri, "Architecture for VLSI Design of CA Based Byte Error Correcting Code Decoders," Proc. VLSI Design '94, pp. 283-286, July 1982.
[10] S. Kaneda and E. Fujiwara,“Single byte error-correcting-double byte error-detecting codes for memory systems,” IEEE Trans Computers, vol. C-31, pp. 596-602, July 1982.
[11] I.S. Reed and G. Solomon,“Polynomial codes over certain finite fields,” J. Soc. Ind. Appl. Math. vol. 6, pp. 16-21, June 1960.
[12] J.K. Wolf,“Adding two information symbols to certain nonbinary BCH codes and some applications,” Bell System Tech. J., pp. 2405-2424, Sept. 1969.
[13] A.K. Bhat and L.L. Kinney,“A high-speed parallel encoder/decoder for b-adjacent error-checking codes,” Proc. Third USA-Japan Computer Conf., pp. 203-207, 1978.
[14] H. Okano and H. Imai, "A Construction Method of High Speed Decoders Using ROM's for BCH and RS Codes," IEEE Trans. Computers, vol. 36, no. 10, Oct. 1987.
[15] K.Y. Liu,“Architecture design for VLSI design of RS decoders,” IEEE Trans. Computers, vol. 33, Feb. 1984.
[16] H.M. Shao,T.K. Truong,L.J. Deutsch,J.H. Yuen,, and I.S. Reed,“A VLSI design of a pipeline Reed-Solomon decoder,” IEEE Trans. Computers, vol. 34, no. 5, pp. 393-403, May 1985.
[17] T.R.N. Rao and Fujiwara, Error-Coding for Computer Systems.Englewood Cliffs, N.J.: Prentice Hall, 1989.
[18] D.K. Pradhan and S. Gupta, A New Framework for Designing and Analyzing BIST Techniques and Zero Aliasing Compression IEEE Trans. Computers, vol. 40, no. 6, June 1991.
[19] C. Chen,“Byte-oriented error-correcting codes for semiconductor memory systems,” IEEE Ttans Computer., vol. 35, pp. 646-648, July 1986.
[20] C. Chen,“Error-correcting codes for byte-organized memory systems,” IEEE Trans. Information Theory, vol. 32, pp. 181-185, Mar. 1986.
[21] S. Lin and D. J. Costello,Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
[22] W. Peterson and E. Weldon,Error Correcting Codes, MIT Press, 1972.

Index Terms:
Cellular automata, error-correcting code, fault tolerance, signature analysis.
Citation:
Indranil Sen Gupta, Dipanwita Roy Chowdhury, Parimal Pal Chaudhuri, "CA-Based Byte Error-Correcting Code," IEEE Transactions on Computers, vol. 44, no. 3, pp. 371-382, March 1995, doi:10.1109/12.372030
Usage of this product signifies your acceptance of the Terms of Use.