Name
Abstract | ||
|---|---|---|
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 mu 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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/APCCAS.2006.342480 | 2006 IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS |
Keywords | Field | DocType |
low power electronics,content addressable memory,network synthesis,winner take all,longest prefix matching,network routing,circuit design | Content-addressable memory,Computer science,Voltage,Optical Carrier transmission rates,Circuit design,Electronic engineering,Ethernet,Longest prefix match,Low-power electronics,Scalability | Conference |
Citations | PageRank | References |
2 | 0.39 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ruei-jhe Tsai | 1 | 2 | 0.39 |
| Hsin-Wen Ting | 2 | 41 | 8.81 |
| Chi-Sheng Lin | 3 | 159 | 17.50 |
| Bin-da Liu | 4 | 563 | 66.56 |