Apparatus and method for setting routing path between routers in chip

Abstract

An apparatus and a method for setting a routing path in System-on-a-Chip (SoC) having an n×n net topology-based structure comprising a plurality of intellectual properties (IPs), each with a unique address, and a plurality of switches forming one-to-one correspondence to the IPs, to transmit and receive data between the IPs by using at least one of the switches. Accordingly, an orthogonal code having orthogonality is assigned according to the direction of transmission of each data (that is, output port). Then, an output port where the data is transmitted is determined, and the data is spread based on an orthogonal code assigned to the output ports of the at least one of the switches.

1 . A method of setting a routing path so as to reduce a buffer size, comprising:
 calculating a difference of the destination address and the source address;   determining whether a first condition is satisfied and setting a routing path of the data to a first side when the first condition is satisfied;   determining whether a second condition is satisfied when the first condition is determined not to be satisfied and setting the routing path of data to a second side when the second condition is determined to be satisfied;   determining whether a third condition is satisfied when the second condition is not satisfied and setting the routing path of data to a third side when the third condition is determined to be satisfied; and   setting the routing path of data to a fourth side.   
   
   
       2 . The method of  claim 1 , wherein at least two data having different destination addresses are generated in the switch. 
   
   
       3 . The method of  claim 1 , wherein the switch spreads each data at the same point. 
   
   
       4 . The method of  claim 1 , wherein the number of data packets and the number of spreaders are the same. 
   
   
       5 . The method of  claim 1 , wherein the first condition is 1≦b≦(n−1−a), b being a difference between the source address and the destination address, n being a modulo, and a being the source address modulo n, and wherein the first side is the right side (east). 
   
   
       6 . The method of  claim 1 , wherein the second condition is b≦(n−a), b being a difference between the source address and the destination address, n being a modulo, and a being the source address modulo n, and wherein the second side is the downward side (south). 
   
   
       7 . The method of  claim 1 , wherein the third condition is −a≦b≦−1, b being a difference between the source address and the destination address, n being a modulo, and a being the source address modulo n, and wherein the third side is the left side (west). 
   
   
       8 . The method of  claim 1 , wherein the fourth side is upward (north).