대한전자공학회:학술대회논문집 (Proceedings of the IEEK Conference)
- 대한전자공학회 2002년도 ITC-CSCC -3
- /
- Pages.1535-1538
- /
- 2002
Ternary Content Addressable Memory with Hamming Distance Search Functions
- Uchiyama, Hiroki (Department of Communications Eng., School of Information Tech, and Electronics, Tokai University) ;
- Tanaka, Hiroaki (Department of Communications Eng., School of Information Tech, and Electronics, Tokai University) ;
- Fukuhara, Masaaki (Department of Communications Eng., School of Information Tech, and Electronics, Tokai University) ;
- Yoshida, Masahiro (Department of Communications Eng., School of Information Tech, and Electronics, Tokai University) ;
- Suzuki, Yasoji (Department of Electronics, School of Information Tech. and Electronics., Tokai University)
- 발행 : 2002.07.01
초록
The flexibility of content addressable mem-ory (CAM) can greatly be extended through the use of trits (ternary digits) Trits consist of binary logical values “0” and “1” with addition of “x” (“dont’t care”). The “dont’t care“is extremely useful for providing com- pact representation of sets of bit strings. In this paper, we propose a new ternary CAM with Hamming distance search functions. Each memory cell in the CAM consists of a pair of lambda diodes which can store trits, namely, a logical “0”, “1” and “x” (“dont’t care“). The CAM can compare stored data and an input data in parallel, and find stored data with Hamming distance within a certain range (“near match“). Also, the interrogation characteristics of the ternary CAM are analyzed in detail. Furthermore, the results obtained these analyses are fully confirmed by simulation using the circuit analysis program HSPICE.
키워드