Open Access Open Access  Restricted Access Subscription or Fee Access

Design of Efficient Pre-Computation based CAM

Pallavi Shivatare, V.G. Raut

Abstract


Content-addressable memory (CAM) is a special type of computer memory which provides a fast data search operation in single clock cycle. Content-addressable memory (CAM) is frequently used in applications such as lookup tables, databases, associative computing, and networking. However the high speed of CAM increases the power consumption. This paper presents survey of low power techniques i.e. One’s count, Block XOR approach and Gate block selection to improve power efficiency of pre-computation based CAM. In our experiment we used Xilinx to estimate the power consumption. Compared with the ones count PB-CAM system the experimental result shows that our proposed approach can achieve 30 %   power reduction.


Keywords


Block XOR, Gate Block Selection, Pre-Computation

Full Text:

PDF

References


S. Jeeva, S. Bharati, “Power Efficient Architecture of Pre-computation Based Content Addressable Memory,” ICCCI, Jan. 2012.

K. Pagiamtzis and A. Sheikholeslami, “Content-addressable memory (CAM) circuits and architectures:A tutorial and survey,” IEEE J. Solid-State Circuits , vol. 41, no. 3, Mar. 2006, pp. 712–727.

H. Miyatake, M. Tanaka, and Y. Mori, “A design for high- speed low-power CMOS fully parallel content-addressable memory macros,” IEEE J. Solid-State Circuits , vol. 36, no. 6, Jun. 2001, pp. 956–968.

I. Arsovski and A. Sheikholeslami, “A mismatch-dependent power allocation technique for match-line sensing in content- addressable memories,” IEEE J. Solid-State Circuits , vol. 38, no. 11,Nov. 2003, pp. 1958–1966.

K. Pagiamtzis and A. Sheikholeslami, “A low-power content-addressable Memory (CAM) using pipelined hierarchical search scheme,” IEEE J. Solid-State Circuits, vol. 39, no. 9 Sep. 2004, pp. 1512–1519.

I. Arsovski, T. Chandler, and A. Sheikholeslami, “A ternary content addressable memory (TCAM) based on 4T static storage and including a current-race sensing scheme,” IEEE J. Solid-State Circuits, vol. 38, no. 1, , Jan. 2003, pp. 155– 158.

K. Pagiamtzis and A. Sheikholeslami, “Using cache to reduce power in Content-addressable memories (CAMs),” in Proc. IEEE Custom integer. Circuits Conf., Sep. 2005, pp. 369–372.

C. S. Lin, J. C. Chang, and B. D. Liu, “A low-power pre computation based Fully parallel content-addressable memory,” IEEE J. Solid-State Circuits, vol. 38, no. 4, Apr. 2003, pp. 622–654.

Y. J. Chang, S. J. Ruan, and F. Lai, “Design and analysis of low power cache using two-level filter scheme,” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 11, no. 4, pp. 568–580, Aug. 2003.

K. Vivekanandarajah, T. Srikanthan, and S. Bhattacharyya, “Dynamic filter cache for low power instruction memory hierarchy,” in Proc. EuromicroSymp. Digit. Syst. Des., Sep. 2004, pp. 607–610.

R. Min, W. B. Jone, and Y. Hu, “Location cache: A low-power L2cache system,” in Proc. Int. Symp. Low Power Electron. Des. Apr.2004, pp. 120–125.

K. H. Cheng, C. H.Wei, and S. Y. Jiang, “Static divided word matching line for low-power content addressable memory design,” in Proc. IEEEInt. Symp. Circuits Syst., May 2004, vol. 2, pp. 23–26.

S. Hanzawa, T. Sakata, K. Kajigaya, R. Takemura, and T. Kawahara,“A large-scale and low-power CAM architecture featuring a one-hotspot block code for IP-address lookup in a network router,” IEEE J. Solid-State Circuits, vol. 40, no. 4, pp. 853–861, Apr. 2005.

Y. Oike, M. Ikeda, and K. Asada, “A high-speed and low-voltage associative co-processor with exact Hamming/Manhattan- distance estimation using word-parallel and hierarchical search architecture,” IEEE J. Solid-State Circuits, vol. 39, no. 8, pp. 1383– 1387, Aug. 2004.

K. Pagiamtzis and A. Sheikholeslami, “A low-power content-addressable memory (CAM) using pipelined hierarchical search scheme,”IEEE J. Solid-State Circuits, vol. 39, no. 9, pp. 1512–1519, Sep. 2004.

D. K. Bhavsar, “A built-in self-test method for write-only content addressablememories,” in Proc. 23rd IEEE VLSI Test Symp., 2005, pp.9–14.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.