A Scalable High-Performance Priority Encoder Using 1D-Array to 2D-Array Conversion

In our prior study of an <inline-formula> <tex-math notation="LaTeX">$\boldsymbol {L}$ </tex-math></inline-formula>-bit priority encoder (PE), a so-called one-directional-array to two-directional-array conversion method is deployed to turn an <inline-formula> <tex-math notation="LaTeX">$\boldsymbol {L}$ </tex-math></inline-formula>-bit input data into an <inline-formula> <tex-math notation="LaTeX">$\boldsymbol {M\times N}$ </tex-math></inline-formula>-bit matrix. Following this, an <inline-formula> <tex-math notation="LaTeX">$\boldsymbol {N}$ </tex-math></inline-formula>-bit PE and an <inline-formula> <tex-math notation="LaTeX">$\boldsymbol {M}$ </tex-math></inline-formula>-bit PE are employed to obtain a row index and column index. From those, the highest priority bit of <inline-formula> <tex-math notation="LaTeX">$\boldsymbol {L}$ </tex-math></inline-formula>-bit input data is achieved. This brief extends our previous work to construct a scalable architecture of high-performance large-sized PEs. An optimum pair of (<inline-formula> <tex-math notation="LaTeX">$\boldsymbol {M}$ </tex-math></inline-formula>, <inline-formula> <tex-math notation="LaTeX">$\boldsymbol {N}$ </tex-math></inline-formula>) and look-ahead signal are proposed to improve the overall PE performance significantly. The evaluation is achieved by implementing a variety of PEs whose <inline-formula> <tex-math notation="LaTeX">$\boldsymbol {L}$ </tex-math></inline-formula> varies from 4-bit to 4096-bit in 180-nm CMOS technology. According to post-place-and-route simulation results, at PE size of 64 bits, 256 bits, and 2048 bits the operating frequencies reach 649 MHz, 520 MHz, and 370 MHz, which are 1.2 times, 1.5 times, and 1.4 times, as high as state-of-the-art ones.

[1]  Miad Faezipour,et al.  Wire-Speed TCAM-Based Architectures for Multimatch Packet Classification , 2009, IEEE Transactions on Computers.

[2]  Lawrence T. Clark,et al.  A Dynamic Longest Prefix Matching Content Addressable Memory for IP Routing , 2011, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[3]  Andrew Mason,et al.  A power-optimized 64-bit priority encoder utilizing parallel priority look-ahead , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[4]  Katsumi Inoue,et al.  An FPGA-Based Information Detection Hardware System Employing Multi-Match Content Addressable Memory , 2012, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[5]  Nikos Konofaos,et al.  Low-power, high-performance 64-bit CMOS priority encoder using static-dynamic parallel architecture , 2016, 2016 5th International Conference on Modern Circuits and Systems Technologies (MOCAST).

[6]  Chung-Hsun Huang,et al.  Design of high-performance CMOS priority encoders and incrementer/decrementers using multilevel lookahead and multilevel folding techniques , 2002 .

[7]  Cong-Kha Pham,et al.  An FPGA approach for high-performance multi-match priority encoder , 2016, IEICE Electron. Express.

[8]  Shadi M. Harb,et al.  A VLSI High-Performance Priority Encoder Using Standard CMOS Library , 2006, IEEE Transactions on Circuits and Systems II: Express Briefs.

[9]  Yen-Jen Chang,et al.  A full parallel priority encoder design used in comparator , 2010, 2010 53rd IEEE International Midwest Symposium on Circuits and Systems.