A Low-Cost High-Capacity Associative Memory Design Using Cellular Automata

Authors:
I. Sen Gupta;D. Roy Chowdhury;P. Pal Chaudhuri
Affiliations:
-;-;-
Venue:
IEEE Transactions on Computers
Year:
1995

Citing 8
Cited 1

Random sequence generation by cellular automata

Advances in Applied Mathematics
Parallel Random Number Generation for VLSI Systems Using Cellular Automata

IEEE Transactions on Computers
Characterization of two-dimensional cellular automata using matrix algebra

Information Sciences: an International Journal
A class of two-dimensional cellular automata and their applications in random pattern testing

Journal of Electronic Testing: Theory and Applications
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Handbook of Semiconductor and Bubble Memories

Handbook of Semiconductor and Bubble Memories
Vector Space Theoretic Analysis of Additive Cellular Automata and its Application for Pseudoexhaustive Test Pattern Generation

IEEE Transactions on Computers
Design of CAECC - Cellular Automata Based Error Correcting Code

IEEE Transactions on Computers

Hardware support for language aware information mining

KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III

Quantified Score

Hi-index	14.98

Visualization

Abstract

The present paper reports a novel scheme for designing fast retrieval memory system using cellular automata. In essence, the proposed scheme implements the concept of hashing in hardware. This makes possible the design of low-cost high-capacity memory systems with limited content addressability as an option. The efficiency of the scheme has been verified through extensive simulation studies of the hardwired hashing function built around 1D and 2D linear cellular automata (CA).