A CAM/WTA-based high speed and low power Longest Prefix Matching circuit design

Ruei Jhe Tsai, Hsin Wen Ting, Chi Sheng Lin, Bin-Da Liu

研究成果: Conference contribution

4 引文 斯高帕斯(Scopus)

摘要

In this paper, we propose a novel Content addressable memory / Winner take all-based Longest Prefix Matching (CW-LPM) circuit for the network router application. This CW-LPM circuit not only provides a simple hardware-based solution without some traditional drawbacks such as reordering or unavoidable complex extra hardware, but also has features of low power, low cost, high search speed and scalability. We implemented this CW-LPM circuit by using the TSMC 0.18 μm 1P6M CMOS process with 128 words by 32 bits data configuration. The simulation results show that the proposed CW-LPM circuit works up to 250 MSearches/sec at 1.8-V supply voltage with power consumption of 6.89mW and 140 MSearches/sec at 1.25-V supply voltage. Consequently, the proposed CW-LPM circuit design meets the speed requirement of OC (Optical Carrier) -3072/160 Gb/s line rate multi-gigabit/sec Ethernet network

原文English
主出版物標題APCCAS 2006 - 2006 IEEE Asia Pacific Conference on Circuits and Systems
頁面426-429
頁數4
DOIs
出版狀態Published - 2006 十二月 1
事件APCCAS 2006 - 2006 IEEE Asia Pacific Conference on Circuits and Systems - , Singapore
持續時間: 2006 十二月 42006 十二月 6

出版系列

名字IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS

Other

OtherAPCCAS 2006 - 2006 IEEE Asia Pacific Conference on Circuits and Systems
國家/地區Singapore
期間06-12-0406-12-06

All Science Journal Classification (ASJC) codes

  • 電氣與電子工程

指紋

深入研究「A CAM/WTA-based high speed and low power Longest Prefix Matching circuit design」主題。共同形成了獨特的指紋。

引用此