Error correcting capability of cellular automata based associative memory

Author

Maji, Pradipta ; Ganguly, Niloy ; Chaudhuri, P. Pal

Author_Institution

Dept. of Comput. Sci. & Technol., Bengal Eng. Coll., Howrah, India

Volume

33

Issue

4

fYear

2003

fDate

7/1/2003 12:00:00 AM

Firstpage

466

Lastpage

480

Abstract

This paper reports the error correcting capability of an associative memory model built around the sparse network of cellular automata (CA). Analytical formulation supported by experimental results has demonstrated the capability of CA based sparse network to memorize unbiased patterns while accommodating noise. The desired CA are evolved with an efficient formulation of simulated annealing (SA) program. The simple, regular, modular, and cascadable structure of CA based associative memory suits ideally for design of low cost high speed online pattern recognizing machine with the currently available VLSI technology.

Keywords

VLSI; cellular automata; content-addressable storage; error correction; simulated annealing; CA based sparse network; SA; VLSI; cellular automata based associative memory; error correcting capability; low-cost high-speed online pattern recognition; noise; simulated annealing; unbiased patterns; Associative memory; Automata; Costs; Error correction; Neural networks; Pattern analysis; Pattern matching; Pattern recognition; Simulated annealing; Very large scale integration;

fLanguage

English

Journal_Title

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on

Publisher

ieee

ISSN

1083-4427

Type

jour

DOI

10.1109/TSMCA.2003.817035

Filename

1235980