Priority encoder: Difference between revisions

Revision as of 14:05, 29 February 2020

Revision as of 21:39, 11 October 2020

Line 34:

An open-source Verilog generator for the recursive priority-encoder is available online.<ref>{{Cite web|url=https://github.com/AmeerAbdelhadi/Indirectly-Indexed-2D-Binary-Content-Addressable-Memory-BCAM/blob/master/pe|title=https://github.com/AmeerAbdelhadi/Indirectly-Indexed-2D-Binary-Content-Addressable-Memory-BCAM/blob/master/pe|last=|first=|date=|website=|url-status=live|archive-url=|archive-date=|access-date=}}</ref>

[[File:PE-recursion.svg|alt=Priority-encoder (left) symbol (right) recursive definition.|border|center|thumb|416x416px|Priority-encoder (left) symbol (right) recursive definition.]]

A behavioral description of priority encoder in Verilog is as follows.<ref>{{Cite web|url=https://github.com/AmeerAbdelhadi/Indirectly-Indexed-2D-Binary-Content-Addressable-Memory-BCAM|title=AmeerAbdelhadi/Indirectly-Indexed-2D-Binary-Content-Addressable-Memory-BCAM|website=GitHub|language=en|access-date=2020-02-29}}</ref><syntaxhighlight lang="verilog" line="1">