A priority encoder is a circuit or algorithm that compresses multiple binary inputs into a smaller number of outputs, similar to a simple encoder. The output of a priority encoder is the binary representation of the index of the most significant activated line. In contrast to the simple encoder, if two or more inputs to the priority encoder are active at the same time, the input having the highest priority will take precedence. It is an improvement on a simple encoder because it can handle all possible input combinations, but at the cost of extra logic. Applications of priority encoders include their use in interrupt controllers (to allow some interrupt requests to have higher priority than others), decimal or binary encoding, and analog-to-digital / digital to-analog conversion.
Implementation A truth table of a single bit 4-to-2 priority encoder is shown, where the inputs are shown in decreasing order of priority left-to-right, and "x" indicates a don't care term - i.e. any input value there yields the same output since it is superseded by a higher-priority input. The (usually-included) "v" output indicates if the input is valid.
Priority encoders can be easily connected in arrays to make larger encoders, such as one 16-to-4 encoder made from six 4-to-2 priority encoders – four 4-to-2 encoders having the signal source connected to their inputs, and the two remaining encoders take the output of the first four as input.
Recursive construction of priority encoders Sources: A priority-encoder, also called leading zero detector (LZD) or leading zero counter (LZC), receives an n {\displaystyle n} -bit input vector and detects the index of the first binary ‘1’ in the input vector. A valid signal indicates if any binary ‘1’ was detected in the input vector, hence the index is valid. Priority-encoders can be efficiently constructed by recursion. The input vector is split into k {\displaystyle k} equal fragments with n / k {\displaystyle n/k} bits. A priority encoder PE n / k {\displaystyle {\textrm {PE}}_{n/k}} with a narrower width of 𝑛/𝑘 is applied for each fragment. The valid bit of each of the k {\displaystyle k} PE n / k {\displaystyle {\textrm {PE}}_{n/k}} ‘s goes to a k {\displaystyle k} bit PE n / k {\displaystyle {\textrm {PE}}_{n/k}} to detect the first valid fragment. The location of this fragment is the higher part of the overall index, and steers the exact location within the fragment itself to produce the lower part of the overall index. The depth of the proposed structure is ⌈ log k n ⌉ {\displaystyle \lceil \log _{k}n\rceil } , while the hardware area complexity is O ( n ) {\displaystyle {\mathcal {O}}(n)} . If Altera's Stratix V or equivalent device is used, k = 4 {\displaystyle k=4} is recommended to achieve higher performance and area compression, since the mux can be implemented using 6-LUT, hence an entire ALM. An open-source Verilog generator for the recursive priority-encoder is available online.
A behavioral description of priority encoder in Verilog is as follows. In this case, the LSB has the highest priority.
Simple encoder
A simple encoder circuit is a one-hot to binary converter. That is, if there are 2n input lines, and at most only one of them will ever be high, the binary code of this 'hot' line is produced on the n-bit output lines.
Notes
References
