PCAM: A Ternary CAM Optimized for Longest Prefix Matching Tasks

Authors:
Mohammad J. Akhbarizadeh;Mehrdad Nourani;Deepak S. Vijayasarathi;Poras T. Balsara
Affiliations:
The University of Texas at Dallas;The University of Texas at Dallas;The University of Texas at Dallas;The University of Texas at Dallas
Venue:
ICCD '04 Proceedings of the IEEE International Conference on Computer Design
Year:
2004

Citing 0
Cited 4

Ripple-Precharge TCAM A Low-Power Solution for Network Search Engines

ICCD '05 Proceedings of the 2005 International Conference on Computer Design
A nonredundant ternary CAM circuit for network search engines

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A TCAM-Based Parallel Architecture for High-Speed Packet Forwarding

IEEE Transactions on Computers
Design of embedded TCAM based longest prefix match search engine

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.