Binary tree search architecture for efficient implementation of round robin arbiters

A new architecture for the implementation of round robin arbiters (RRAs) with one-hot encoded grant signals is introduced. The proposed architecture uses a binary tree search (BTS) mechanism in conjunction with a unit-weighted representation of the priority index. It is shown that the proposed BTS RRA architecture achieves very significant improvements in time-area complexity compared to the most efficient conventional RRA configuration to date.