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 pm 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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.