Open Access Open Access  Restricted Access Subscription or Fee Access

An Improved Cellular Automata-based Multi byte ECC

V. Nagarajan, V. Kannan

Abstract


This paper identifies and resolves the weakness and limitation of existing Cellular Automata (CA) -based byte Error Correcting Code (ECC) and proposes an improved CA-based multi byte ECC which overcomes the identified weakness up to some extent. The code is very much suited from VLSI design viewpoint and requires significantly less hardware and power for decoding compared to the existing techniques employed for Reed–Solomon (RS) Codes. In this paper we are designing the Cellular Automata (CA) based multi byte error correction architecture. Cellular Automata is established for developing bits and bytes Error Correcting Codes. This code is very much suited from Very Large Scale Integration design viewpoint and requires much less hardware and power for decoding. The existing CA based error correcting scheme explains only about the double byte error correction. But this paper explains the error correction possibilities even if more than two errors present.

Keywords


Cellular Automata, Error Correcting Code, Multi Byte ECC

Full Text:

PDF

References


Bhaumik, J.Chowdhury, D.R, “New Architectural Design of CA-Based Codec,”IEEE Trans. Inf. Theory, vol.18,no.7, pp. 1139-1144,July 2010.W.-K. Chen, Linear Networks and Systems (Book style). Belmont, CA: Wadsworth, 1993, pp. 123–135.

Jaydeb Bhaumik1, Balaji Janakiram and Dipanwita Roy Chowdhury, “Architectural Design of CA-Based Double Byte Error Correcting Codec,”IEEE Trans. Inf. Theory, pp.1–6,March 2009.

Nandi, C. Rambabu, and P. P. Chaudhuri, “A VLSI architecture for cellular automata based Reed-Solomon decoder,” in Proc. I-SPAN, 1999, pp.158–165.

R. J. Mceliece and L. Swanson, “On the decoder error probability for Reed-Solomon codes,” IEEE Trans. Inf. Theory, vol. IT-32, no.5, pp.701–703, Sep.1986

Nandi, S.; Kar, B.K.; Pal Chaudhuri, P, “Theory and Applications of Cellular Automata in Cryptography,” IEEE Trans. Comput., vol.43,no.12, pp.1346-1357,August 2002.

Chin-Long Chen,“Error-correcting codes for byte-organized memory systems,”IEEETrans. Inf.Theory,vol.IT-32,no.2,pp.181–185, January 2003.

Miller, D.B., Fredkin, E.: Two-state, reversible, universal cellular automata in three dimensions. In: proceedings of ACM Computing Frontiers 2005

B. Chopard and M. Droz, Cellular Automata Modeling of Physical Systems. Cambridge University Press, 1998.

A. Imre, G. Csaba, L. Ji, A. Orlov, G. H. Bernstein, and W.Porod,“Majority logic gate for magnetic quantum-dot cellular automata,” Science, vol. 311, no. 5758, pp. 205–208, Jan 2006.

M. Khatun, T. Barclay, I. Sturzu, and P. D. Tougaw, “Fault tolerance calculations for clocked quantum-dot cellular automata devices,” Journal Of Applied Physics, vol. 98, no. 9, p. 094904, Nov 2005.

A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,” Physical Review A, vol. 54, no. 2, pp. 1098–1105, Aug 1996.

D. R. Chowdhury, I. S. Gupta, and P. P. Chaudhuri, “CA-based byte Error-correcting code,” IEEE Trans. Comput., vol. 44, no. 3, pp.371– 382, Mar.1995.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.