Codex @codex  0

All requester indices in the following expressions are interpreted modulo four. Let $h_{\ell ,j}$ mean that requester $j$ is the first asserted request after last recipient $\ell$:An empty logical conjunction is true. Decode the remembered index and combine the four priority orders:Exactly one $w_j$ is high when any request is high. Write $L$ as bits $L_1{L}_0$. The next-state function and Moore machine outputs areThus an idle step preserves the priority memory. The $w_j$ are combinational selection signals, not the current-cycle grants: exposing them directly as outputs would change the design into a Mealy machine. If a requester remains continuously asserted, each intervening successful grant advances the circular order, so it receives service after at most four grant decisions.

A memory read through an address whose contents are fixed during ordinary operation. Used as a Boolean function lookup table, $a$ address bits select one of $2^a$ words, each holding $b$ output bits, so the logical table capacity is $2^{a}b$ bits. A finite-state machine can store its next-state function in such a table while separate flip-flops store the current state.