High-Frequency and ETP-Efficient Range-Matching Scheme

A dynamic–static mixed range-matching scheme is proposed, which significantly increases system clock frequency and reduces $$\hbox {Energy-T}_{\mathrm {clock}}$$Energy-Tclock-Product (ETP). Furthermore, the range-matching cell adopted in the current scheme presents higher-speed performance although it uses two transistors less than the previous one. Using 1.2V SMIC 130 nm process, the proposed 16-bit range-matching word (RMW) can work in the minimal clock cycle of 0.753 ns. In case of 50 % duty cycle ratio and the minimal clock cycle, the ETP of proposed RMW is 5.947 fJ $$\cdot $$· ns/bit/search.

[1]  José G. Delgado-Frias,et al.  Decoupled dynamic ternary content addressable memories , 2005, IEEE Transactions on Circuits and Systems I: Regular Papers.

[2]  David E. Taylor Survey and taxonomy of packet classification techniques , 2005, CSUR.

[3]  Bin-Da Liu,et al.  A High-Speed and EDP-Efficient Range-Matching Scheme for Packet Classification , 2009, IEEE Transactions on Circuits and Systems II: Express Briefs.

[4]  Michel Verleysen,et al.  A high-storage capacity content-addressable memory and its learning algorithm , 1989 .

[5]  Jinn-Shyan Wang,et al.  An AND-type match-line scheme for high-performance energy-efficient content addressable memories , 2006 .

[6]  Bin Liu,et al.  TCAM-based distributed parallel packet classification algorithm with range-matching solution , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[7]  Suhwan Kim,et al.  A High-Speed Range-Matching TCAM for Storage-Efficient Packet Classification , 2009, IEEE Transactions on Circuits and Systems I: Regular Papers.