A Paradigm for Generalized Multi-Level Priority Encoders
Maxwell Phillips, Firas Hassan, Ahmed Ammar

TL;DR
This paper introduces a generalized multi-level priority encoder paradigm that reduces complexity and analyzes tradeoffs between complexity and delay across various architectures for high-precision applications.
Contribution
It extends the two-level priority encoder concept to multiple levels using cascading and composition, providing a comprehensive analysis and a toolkit for optimal hardware design.
Findings
Two-level architecture halves complexity with increased delay
Additional levels offer diminishing complexity benefits
Tree and recursive designs are faster but more complex
Abstract
Priority encoders are typically considered expensive hardware components in terms of complexity, especially at high bit precisions or input lengths (e.g., above 512 bits). However, if the complexity can be reduced, priority encoders can feasibly accelerate a variety of key applications, such as high-precision integer arithmetic and content-addressable memory. We propose a new paradigm for constructing priority encoders by generalizing the previously proposed two-level priority encoder structure. We extend this concept to three and four levels using two techniques -- cascading and composition -- and discuss further generalization. We then analyze the complexity and delay of new and existing priority encoder designs as a function of input length, for both FPGA and ASIC implementation technologies. In particular, we compare the multi-level structure to the traditional single-level priority…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLow-power high-performance VLSI design · Error Correcting Code Techniques · Parallel Computing and Optimization Techniques
