Paper Title
Design of a Round Robin Arbiter on Resource Sharing

Anywhere in this world the resource is limited and the number of users is increasing day by day. Many systems exist in which a large number of requester must get access to a common resource. The common resource may be a shared memory, networking such as packet switching and other statistical multiplexing. Everyone wants access and no one wants to wait. As for limited channel capacity and limited capacity of the serving device, it is too hard to satisfy the subscribers in the conventional way. There comes the idea of resource sharing and giving access to the serving device. In this paper, we have proposed a method to design a round robin arbiter that can be implemented using Verilog code which can work with equal priority for giving users access path in a desired resource sharing. Index Terms - Arbitration, ASM, Round-robin arbiter, Test-Bencher, Xilinx,