A High Speed Low Power CAM with Power-Gated MatchLine Sensing Using Keyword-Based Search Method

M.Shanmugapriya*, M. Shenbagapriya**
* 2nd year ME Student, VLSI Design, Department of ECE, Knowledge Institute of Technology, Salem, India.
** Assistant Professor, Department of ECE, Knowledge Institute of Technology, Salem, India.
Periodicity:November - January'2014
DOI : https://doi.org/10.26634/jps.1.4.2667

Abstract

The design of high speed Content Addressable Memory (CAM) offers high-speed search function in a single clock cycle. Content Addressable Memory (CAM) is a type of solid-state memory in which data are accessed by their contents rather than physical locations. It receives input search data, i.e., a search word, and returns the address of a similar word that is stored in its data-bank. In previous system, we introduced a parity bit that leads to sensing delay and increase the power consumption. It takes more time to sense the match line. In this paper, we used keyword based search method. The concept of this method is to pre-compare several bits of the match line in advance. Through the mechanism of the keyword search pre-comparison scheme, it can decide that whether the other bits would be compared or not and which reduces even more sensing delay and reduce the power.

Keywords

Content Addressable Memory (CAM), Keyword search, Match line.

How to Cite this Article?

Shanmugapriya, M., and Shenbagapriya, M. (2014). A High Speed Low Power Cam with Power-Gated Match Line Sensing Using Keyword Based Search Method. i-manager’s Journal on Power Systems Engineering, 1(4), 34-38. https://doi.org/10.26634/jps.1.4.2667

References

[1]. A. T. Do, S. S. Chen, Z. H. Kong, and K. S. Yeo,(2011) "A low-power CAM with efficient power and delay trade-off," in Proc. IEEE Int. Symp. Circuits Syst. (ISCAS), pp. 2573–2576.
[2]. N. Mohan, W. Fung, D. Wright, and M. Sachdev, (2009) "A low-power ternary CAM with positive-feedback match-line sense amplifiers,"IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 56, No. 3, pp. 566–573, Mar.
[3]. N. Mohan and M. Sachdev,(2009) "Low-leakage storage cells for ternarycontent addressable memories," IEEE Trans. Very Large Scale Integration.(VLSI) Syst., vol. 17, no. 5, pp. 604–612, May.
[4]. O. Tyshchenko and A. Sheikholeslami,(2008) "Match sensing using matchline stability in content addressable memorys (CAM)," IEEE J. Solid-State Circuits, vol. 43, no. 9, pp. 1972–1981, Sep.
[5]. S. Baeg,(2008) "Low-power ternar y contentaddressable memory design using a segmented match line," IEEE Trans. Circuits Syst. I, Reg.Papers, vol. 55, no. 6, pp. 1485–1494, Jul.
[6]. Hanhua Chen and Hai Jin Jiliang Wang, Lei Chen, Yunhao Liu, Lionel Ni (2008) “Efficient Multi-keyword Search over P2P Web" April 21-25, Beijing, China pp 989- 997.
[7]. K. Pagiamtzis and A. Sheikholeslami,(2006) "Contentaddressable memory (CAM) circuits and architectures:A tutorial and survey," IEEE J. Solid-State Circuits, vol. 41, no. 3, pp. 712–727, Mar.
[8]. Kostas pagiamtzis and Ali sheikholeslami (2005) "Using cache to reduce power in content-addressable memories (cams)” IEEE 2005 custom integrated circuits conference, pp 369-372.
[9]. K. Pagiamtzis and A. Sheikholeslami,(2004) "A lowpower content-addressable memory (CAM) using pipelined hierarchical search scheme,"IEEE J. Solid-State Circuits, vol. 39, no. 9, pp. 1512–1519, Sep.
[10]. I. Arsovski and A. Sheikholeslami,(2003) "A mismatch-dependent power allocation technique for match-linesensing in co ntent-addressable memories,"IEEE J. Solid-State Circuits, vol. 38, no. 11, pp. 1958–1966,Nov.
[11]. M. Kobayashi, T. Murase, and A. Kuriyama,(2000) "A longest prefix match search engine for multi-gigabit IP processing," in IEEE Int. Conf. Communications, vol. 3, June 2000, pp. 1360–1364.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Online 15 15

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.