This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Low-Cost High-Capacity Associative Memory Design Using Cellular Automata
October 1995 (vol. 44 no. 10)
pp. 1260-1264

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).

[1] P.H. Bardell, Analysis of Cellular Automata Used as a Pseudo-Random Pattern Generators Proc. Int'l Test Conf., pp. 762-768, 1990.
[2] D. Roy Chowdhury,S. Basu,I. Sen Gupta,, and P. Pal Chaudhuri,“Design of CAECC—Celluar automata based error correcting code,” IEEE Tans. Computers, vol. 43, no. 1, Jan. 1994.
[3] D. Roy Chowdhury,I. Sen Gupta,, and P. Pal Chaudhuri,“Theory and applications of two-dimensional cellular automata as parallel random pattern generator,” J. Electronic Testing and Applications, vol. 1, pp. 65-80, Feb. 1994.
[4] D. Roy Chowdhury,P. Subbarao,, and P. Pal Chaudhuri,“Characterization of two-dimensional cellular automata using matrix algebra,” Information Sciences, vol. 71, no. 3, pp. 289-314, July 1993.
[5] J.G.D. da Silva and I. Watson,“Pseudoassociative store with hardware hashing,” Proc. IEE (Part E), vol. 130, no. 1, pp. 19-24, Jan. 1983.
[6] A.K. Das and P. Pal Chaudhuri, "Efficient Characterization of Cellular Automata," Proc. IEE (Part E), vol. 137, pp. 81-87, Jan. 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] E. Horowitz and S. Sahni,Fundamentals of Data Structures. Computer Science Press, 1983.
[9] P.D. Hortensius, R.D. McLeod, and H.C. Card, Parallel Random Number Generation for VLSI Systems using Cellular Automata IEEE Trans. Computers, vol. 38, no. 10, pp. 1466-1473, Oct. 1989.
[10] D.E. Knuth,The Art of Computer Programming—Sorting&Searching.Reading, Mass.: Addison-Wesley, 1981.
[11] 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.
[12] H.S. Stone,Discrete Mathematical Structures and Their Applications. Science Research Associates, 1973.
[13] W.A. Triebel and A.E. Chu,Handbook of Semiconductor and Bubble Memories.Englewood Cliffs, N.J.: Prentice-Hall, 1982.
[14] S. Wolfram,“Random sequence generation by cellular automata,” Advances in Applied Mathematics, vol. 7, pp. 127-169, 1986.

Index Terms:
Hashing, cellular automata, associative memory.
Citation:
I. Sen Gupta, D. Roy Chowdhury, P. Pal Chaudhuri, "A Low-Cost High-Capacity Associative Memory Design Using Cellular Automata," IEEE Transactions on Computers, vol. 44, no. 10, pp. 1260-1264, Oct. 1995, doi:10.1109/12.467703
Usage of this product signifies your acceptance of the Terms of Use.