loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2004 IEEE International Conference on Computer Design (ICCD'04)
PCAM: A Ternary CAM Optimized for Longest Prefix Matching Tasks
San Jose, CA
October 11-October 13
ISBN: 0-7695-2231-9
Mohammad J. Akhbarizadeh, The University of Texas at Dallas
Mehrdad Nourani, The University of Texas at Dallas
Deepak S. Vijayasarathi, The University of Texas at Dallas
Poras T. Balsara, The University of Texas at Dallas
An optimized Ternary CAM concept is introduced for application in the longest prefix matching tasks of the Internet search engines. It employs w +1 RAM bits for a word of size w. A conventional TCAM needs 2w RAM bits for the same word size. Based on this concept an 8 bit Prefix-CAM cluster is designed out of 9 SRAM bits, four of which merge to store a 32-bit IPv4 prefix. A complete Prefix-CAM module employs 22% less transistors than a conventional TCAM, for equal storage size and equal functionality. We confirm the 22% area saving by implementing the layouts for Prefix-CAM and TCAM words. Our design also reduces interconnect area by reducing address decode lines.
Citation:
Mohammad J. Akhbarizadeh, Mehrdad Nourani, Deepak S. Vijayasarathi, Poras T. Balsara, "PCAM: A Ternary CAM Optimized for Longest Prefix Matching Tasks," iccd, pp.6-11, 2004 IEEE International Conference on Computer Design (ICCD'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.