E—RiCoBiT—II: A High Performing RiCoBiT (Ring Connected Binary Tree) Topology with Fully Adaptive Routing Algorithm

Network on Chip (NoC) is very useful in connecting the different components of a chip. Many NoC topologies like 2D mesh, torus etc. are already in use. RiCoBiT (Ring Connected Binary Tree) is a new topology which was recently proposed and studied. RiCoBiT is a topology where performance parameters like maximum hop and average hop are better than the other topologies. Area parameters like wirelength and number of wire segments are approximately the same as compared to other topologies, but one of the biggest problems with this topology was the lack of an adaptive routing algorithm. Thus, we propose a new routing algorithm which is adaptive in nature. The algorithm is tested for all cases: destination and source in the same ring, destination is above the source ring, and the destination is below the source ring. The testing of the algorithm was performed by using a simulation setup for E-RiCoBiT- II (Enhanced RiCoBiT). It is observed that the topology is 100. The average hop, maximum hop, and total time are studied for the proposed architecture and algorithm.