Algorithm and Architecture for a Low-Power Content-Addressable Memory Based on Sparse Clustered Networks

We propose a low-power content-addressable memory (CAM) employing a new algorithm for associativity between the input tag and the corresponding address of the output data. The proposed architecture is based on a recently developed sparse clustered network using binary connections that on-average eliminates most of the parallel comparisons performed during a search. Therefore, the dynamic energy consumption of the proposed design is significantly lower compared with that of a conventional low-power CAM design. Given an input tag, the proposed architecture computes a few possibilities for the location of the matched tag and performs the comparisons on them to locate a single valid match. TSMC 65-nm CMOS technology was used for simulation purposes. Following a selection of design parameters, such as the number of CAM entries, the energy consumption and the search delay of the proposed design are 8%, and 26% of that of the conventional NAND architecture, respectively, with a 10% area overhead. A design methodology based on the silicon area and power budgets, and performance requirements is discussed.

[1]  K. Pagiamtzis,et al.  Content-addressable memory (CAM) circuits and architectures: a tutorial and survey , 2006, IEEE Journal of Solid-State Circuits.

[2]  Hung-Hsiang Jonathan Chao,et al.  Next generation routers , 2002, Proc. IEEE.

[3]  Vincent Gripon,et al.  Nearly-optimal associative memories based on distributed constant weight codes , 2012, 2012 Information Theory and Applications Workshop.

[4]  K. Pagiamtzis,et al.  A low-power content-addressable memory (CAM) using pipelined hierarchical search scheme , 2004, IEEE Journal of Solid-State Circuits.

[5]  Vincent C. Gaudet,et al.  High-Throughput Low-Energy Content-Addressable Memory Based on Self-Timed Overlapped Search Mechanism , 2012, 2012 IEEE 18th International Symposium on Asynchronous Circuits and Systems.

[6]  Sanu Mathew,et al.  A 128×128b high-speed wide-and match-line content addressable memory in 32nm CMOS , 2011, 2011 Proceedings of the ESSCIRC (ESSCIRC).

[7]  K. Pagiamtzis,et al.  Pipelined match-lines and hierarchical search-lines for low-power content-addressable memories , 2003, Proceedings of the IEEE 2003 Custom Integrated Circuits Conference, 2003..

[8]  K. Fujishima,et al.  A cost-efficient high-performance dynamic TCAM with pipelined hierarchical searching and shift redundancy architecture , 2005, IEEE Journal of Solid-State Circuits.

[9]  Bin-Da Liu,et al.  A low-power precomputation-based fully parallel content-addressable memory , 2003, IEEE J. Solid State Circuits.

[10]  Naoya Onizawa,et al.  Selective decoding in associative memories based on Sparse-Clustered Networks , 2013, 2013 IEEE Global Conference on Signal and Information Processing.

[11]  Wei Hwang,et al.  A 65 nm 0.165 fJ/Bit/Search 256 $\,\times\,$144 TCAM Macro Design for IPv6 Lookup Tables , 2011, IEEE Journal of Solid-State Circuits.

[12]  Sethuraman Panchanathan,et al.  A content-addressable memory architecture for image coding using vector quantization , 1991, IEEE Trans. Signal Process..

[13]  Tien-Fu Chen,et al.  An Adaptively Dividable Dual-Port BiTCAM for Virus-Detection Processors in Mobile Devices , 2009, IEEE Journal of Solid-State Circuits.

[14]  Shanq-Jang Ruan,et al.  Low Power Design of Precomputation-Based Content-Addressable Memory , 2008, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[15]  Zhao Lei,et al.  Reducing instruction TLB's leakage power consumption for embedded processors , 2010, International Conference on Green Computing.

[16]  John J. Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities , 1999 .

[17]  Chingwei Yeh,et al.  Energy-Efficient Content Addressable Memories , 2005 .

[18]  Vincent Gripon,et al.  Sparse Neural Networks With Large Learning Diversity , 2011, IEEE Transactions on Neural Networks.

[19]  H.J. Mattausch,et al.  A 143MHz 1.1W 4.5Mb dynamic TCAM with hierarchical searching and shift redundancy architecture , 2004, 2004 IEEE International Solid-State Circuits Conference (IEEE Cat. No.04CH37519).

[20]  Nen-Fu Huang,et al.  Design of multi-field IPv6 packet classifiers using ternary CAMs , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[21]  Mamoru Nakanishi,et al.  A real-time CAM-based Hough transform algorithm and its performance evaluation , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[22]  Jhing-Fa Wang,et al.  Cam-Based VLSI Architectures for Dynamic Huffman Coding , 1994, IEEE International Conference on Consumer Electronics.

[23]  Yen-Jen Chang,et al.  Hybrid-Type CAM Design for Both Power and Performance Efficiency , 2008, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[24]  C. A. Zukowski,et al.  Use of selective precharge for low-power on the match lines of content-addressable memories , 1997, Proceedings. International Workshop on Memory Technology, Design and Testing (Cat. NO.97TB100159).

[25]  Yu-Jen Huang,et al.  A Low-Power Ternary Content Addressable Memory With Pai-Sigma Matchlines , 2012, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[26]  Chingwei Yeh,et al.  An AND-type match-line scheme for energy-efficient content addressable memories , 2005, ISSCC. 2005 IEEE International Digest of Technical Papers. Solid-State Circuits Conference, 2005..

[27]  Yen-Jen Chang,et al.  Two New Techniques Integrated for Energy-Efficient TLB Design , 2007, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[28]  Vincent Gripon,et al.  Architecture and implementation of an associative memory using sparse clustered networks , 2012, 2012 IEEE International Symposium on Circuits and Systems.

[29]  Vincent Gripon,et al.  Reduced-complexity binary-weight-coded associative memories , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[30]  Mamoru Nakanishi,et al.  On using the CAM concept for parametric curve extraction , 2000, IEEE Trans. Image Process..

[31]  K. Hirata,et al.  A 1.2-million transistor, 33-MHz, 20-b dictionary search processor (DISP) ULSI with a 160-kb CAM , 1990 .

[32]  Vincent Gripon,et al.  A low-power Content-Addressable Memory based on clustered-sparse networks , 2013, 2013 IEEE 24th International Conference on Application-Specific Systems, Architectures and Processors.

[33]  Jong-Seop Kim,et al.  A single chip Lempel-Ziv data compressor , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[34]  Tomás Lang,et al.  Reducing TLB power requirements , 1997, Proceedings of 1997 International Symposium on Low Power Electronics and Design.

[35]  K. J. Schultz,et al.  Fully parallel integrated CAM/RAM using preclassification to enable large capacities , 1996, IEEE J. Solid State Circuits.