CAA decoder for Cellular Automata based byte error correcting code

doi:10.1109/12.537123

CAA decoder for Cellular Automata based byte error correcting code

1996-01-01

19

PRE

AI

K

K. Sasidhar *

S

Santanu Chattopadhyay

P

P.P. Chaudhuri

DOI：10.1109/12.537123

Original

Original request for help

Save

Abstract

En 中文

Design of Cellular Automata (CA) based byte error correcting code analogous to extended Reed-Solomon code has been proposed in [1], [2]. This code has same restrictions on error correction as that of extended R-S code. In this paper a new design scheme has been reported for parallel implementation of CA based SbEC/DbED and DbEC/DbED code that is analogous to the conventional R-S code. Both the encoder and decoder of this code can be efficiently implemented with an array of CA (CAA) with high throughput. The design is ideally suited for high speed memory systems built with byte organized RAM chips. Extension of the scheme to detect/correct larger number of byte errors has also been reported. Throughput of the decoder to handle t byte errors (t less than or equal to 4) can be found to be substantially better than that of conventional R-S decoder. The proposed decoder provides a simple, modular and cost effective design that ideally suits for VLSI implementation.

Keywords:

cellular automata

error correcting code

cellular automata array (CAA)

error vector

error space

CAA decoder for Cellular Automata based byte error correcting code

Abstract

Journal

Organization