An arbiter selects at most one asserted request, searching cyclically after the most recent successful recipient. After a grant it advances that remembered position. This implements circular priority among bits representing competing requests; it is distinct from assigning a fixed priority forever.
