Routing in Networks-on-Chip with Circulant Topology with Three Generatrices of Type C(N;S1,S2,S3)

The paper presents the implementation of a dynamic routing algorithm intended for use in networks-on-chip with a circulant topology with three generatrices of type C(N; s
₁
, s
₂
, s
₃
) for finding the shortest routes between any two network nodes. The algorithm can be implemented as a RTL state machine in routers for NoCs. The proposed algorithm was tested on sets of optimal circulants. Compared with the classical algorithms A* or Dijkstra, the proposed algorithm does not require to calculate the entire path of the packet, but calculates the port number to which the packet should be sent so that it can reach the destination node. This makes it possible to significantly simplify the structure of the NoC router.