论文信息 - A Low-Power Associative Processor with the R-th Nearest-Match Hamming-Distance Search Engine Employing Time-Domain Techniques

A Low-Power Associative Processor with the R-th Nearest-Match Hamming-Distance Search Engine Employing Time-Domain Techniques

In this paper, a low-power Hamming distance associative processor employing time-domain techniques has been developed focusing on the implementation of an r-th nearest-match location identification function. The architecture not only inherits advantages of analog implementations on power consumption but also improves the accuracy of such implementations. This is because it employs digital technique for distance comparison and delay-time technique for searching for the r-th nearest-match template word. A 64-bit 32-word proof-of-concept chip has been designed and fabricated in a 0.18-um CMOS process and has been successfully tested. Power consumption is below 1.8 mW and core size is 0.65x0.445 mm2, respectively.

Tadashi Shibata | Trong Tu Bui | T. Shibata | Trong-Tu Bui

[1] Masahiro Yoshida,et al. Power consumption of a Hamming distance search CAM using neuron MOS transistors , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[2] S. Nakahara,et al. A digital circuit for a minimum distance search using an asynchronous bubble shift memory , 2004, 2004 IEEE International Solid-State Circuits Conference (IEEE Cat. No.04CH37519).

[3] Tadashi Shibata,et al. A Compact and Power-Efficient Implementation of Rank Order Filters Using Time-Domain Digital Computation Technique , 2007 .

[4] Tadahiro Ohmi,et al. Functionality Enahncement in Elemental Devices for Implementing Intelligence on Integrated Circuits , 1997 .

[5] M. Ikeda,et al. Time–domain minimum–distance detector and its application to low power coding scheme on chip interface , 1998, Proceedings of the 24th European Solid-State Circuits Conference.

[6] M. Ikeda,et al. A high-speed and low-voltage associative co-processor with exact Hamming/Manhattan-distance estimation using word-parallel and hierarchical search architecture , 2004, IEEE Journal of Solid-State Circuits.

[7] Hans Jurgen Mattausch,et al. Compact associative-memory architecture with fully parallel search capability for the minimum Hamming distance , 2002, IEEE J. Solid State Circuits.