메뉴 건너뛰기




Volumn , Issue , 2010, Pages 853-858

A low-power content-addressable memory (CAM) using pipelined search scheme

(1)  Mandal, I a  

a SRSIT   (India)

Author keywords

Content addressable memory (CAM); Low power VLSI; Pipeline

Indexed keywords

CONTENT ADDRESSABLE MEMORY; DESIGN CHALLENGES; HIERARCHICAL SEARCH; HIGH-SPEED; IN-NETWORK; LOOK UP TABLE; LOW POWER; LOW POWER VLSI; MEMORY DENSITY; MEMORY PATTERNS; OTHER APPLICATIONS; PACKET CLASSIFICATION; PACKET FORWARDING; POWER CONSUMPTION; POWER REDUCTIONS; SEARCH OPERATIONS; SEARCH SCHEME; SINGLE-CLOCK-CYCLE;

EID: 77952363897     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1741906.1742103     Document Type: Conference Paper
Times cited : (2)

References (9)
  • 1
    • 0004141908 scopus 로고    scopus 로고
    • Prentice Hall, Upper Saddle River, NJ
    • A. S. Tanenbaum, "Computer Networks," Prentice Hall, Upper Saddle River, NJ, 2003.
    • (2003) Computer Networks
    • Tanenbaum, A.S.1
  • 3
    • 0242611950 scopus 로고    scopus 로고
    • Pipelined match-lines and hierarchical search-lines for low-power content-addressable memories
    • K. Pagiamtzis and A. Sheikholeslami, "Pipelined match-lines and hierarchical search-lines for low-power content-addressable memories," Proc. IEEE Custom Integrated Circuits Conf., 2003, pp. 383-386.
    • (2003) Proc. IEEE Custom Integrated Circuits Conf. , pp. 383-386
    • Pagiamtzis, K.1    Sheikholeslami, A.2
  • 4
    • 0038623638 scopus 로고    scopus 로고
    • High-speed IP routing with binary decision diagrams based hardware address lookup engine
    • May
    • R. Sangireddy, and A. K. Somani, "High-speed IP routing with binary decision diagrams based hardware address lookup engine," IEEE Journal on Selected Areas in Communications, vol.21, no.4, pp. 513-521, May 2003.
    • (2003) IEEE Journal on Selected Areas in Communications , vol.21 , Issue.4 , pp. 513-521
    • Sangireddy, R.1    Somani, A.K.2
  • 6
    • 0027222524 scopus 로고
    • Fast routing table lookup using CAMs
    • San Francisco, CA
    • A. J. McAuley, and P. Francis, "Fast routing table lookup using CAMs," Proceedings INFOCOM'93, San Francisco, CA, vol.3, pp. 1382-1391, 1993.
    • (1993) Proceedings INFOCOM'93 , vol.3 , pp. 1382-1391
    • McAuley, A.J.1    Francis, P.2
  • 7
    • 0026748024 scopus 로고
    • Putting routing tables in silicon
    • Jan.
    • T.-B. Pei and C. Zukowski, "Putting routing tables in silicon," IEEE Network Mag., vol.6, pp. 42-50, Jan. 1992.
    • (1992) IEEE Network Mag , vol.6 , pp. 42-50
    • Pei, T.-B.1    Zukowski, C.2
  • 8
    • 0024700068 scopus 로고
    • Content-addressable and associative memory: Alternatives to the ubiquitous RAM
    • July
    • L. Chisvin and R. J. Duckworth, "Content-addressable and associative memory: Alternatives to the ubiquitous RAM," IEEE Computer, vol.22, pp. 51-64, July 1989.
    • (1989) IEEE Computer , vol.22 , pp. 51-64
    • Chisvin, L.1    Duckworth, R.J.2
  • 9
    • 0035369412 scopus 로고    scopus 로고
    • A design for highspeed lowpower CMOS fully parallel content-addressable memory macros
    • June
    • H. Miyatake, M. Tanaka, and Y. Mori, "A design for highspeed lowpower CMOS fully parallel content-addressable memory macros," IEEE J. Solid-State Circuits, vol.36, pp. 956-968, June 2001. .
    • (2001) IEEE J. Solid-State Circuits , vol.36 , pp. 956-968
    • Miyatake, H.1    Tanaka, M.2    Mori, Y.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.