Logic structure aware circuit routing

Abstract

A method, executed by a computer, for routing a circuit includes receiving a logic structure for a circuit, retrieving a logic template, determining whether the logic structure for the circuit matches the logic template, and routing the circuit using a routing recipe corresponding to the logic template in response to determining that the logic structure matches the logic template. A corresponding computer program product and computer system are also disclosed herein.

What is claimed is: 
     
         1 . A method, executed by a computer, for routing a circuit, the method comprising:
 receiving a logic structure for a circuit;   retrieving a logic template;   determining whether the logic structure for the circuit matches the logic template; and   routing the circuit using a routing recipe corresponding to the logic template in response to determining that the logic structure matches the logic template.   
     
     
         2 . The method of  claim 1 , wherein the logic template comprises a topology formula. 
     
     
         3 . The method of  claim 2 , wherein the topology formula defines a cell type and a cell quantity for a plurality of stages. 
     
     
         4 . The method of  claim 2 , wherein the topology formula is datawidth dependent. 
     
     
         5 . The method of  claim 1 , wherein the logic template comprises a wiring formula. 
     
     
         6 . The method of  claim 5 , wherein the wiring formula defines an interconnection pattern for interconnecting two cell stages. 
     
     
         7 . The method of  claim 1 , wherein the routing recipe comprises one or more of a routing priority, a routing weight, a scenic ratio, a wirecode assignment, and a layer assignment. 
     
     
         8 . The method of  claim 1 , wherein the routing recipe is dependent on a datawidth of the circuit. 
     
     
         9 . The method of  claim 1 , wherein the routing recipe is dependent on at least one of circuit speed, circuit power consumption, and circuit density. 
     
     
         10 . The method of  claim 1 , wherein the routing recipe is retrieved from a database comprising a plurality of pre-tabulated routing recipes. 
     
     
         11 . A computer program product comprising:
 one or more computer readable storage media and program instructions stored on the one or more computer readable storage media, the program instructions comprising instructions to:   receive a logic structure for a circuit;   retrieve a logic template;   determine whether the logic structure for the circuit matches the logic template; and   route the circuit using a routing recipe corresponding to the logic template in response to determining that the logic structure matches the logic template.   
     
     
         12 . The computer program product of  claim 11 , wherein the logic template comprises a topology formula. 
     
     
         13 . The computer program product of  claim 12 , wherein the topology formula defines a cell type and a cell quantity for a plurality of stages. 
     
     
         14 . The computer program product of  claim 12 , wherein the topology formula is datawidth dependent. 
     
     
         15 . The computer program product of  claim 11 , wherein the routing recipe is dependent on a datawidth of the circuit. 
     
     
         16 . A computer system comprising:
 one or more computers;   one or more computer readable storage media and program instructions stored on the one or more computer readable storage media for execution by at least one of the computers, the program instructions comprising instructions to:   receive a logic structure for a circuit;   retrieve a logic template;   determine whether the logic structure for the circuit matches the logic template; and   route the circuit using a routing recipe corresponding to the logic template in response to determining that the logic structure matches the logic template.   
     
     
         17 . The computer system of  claim 16 , wherein the logic template comprises a topology formula. 
     
     
         18 . The computer system of  claim 17 , wherein the topology formula defines a cell type and a cell quantity for a plurality of stages. 
     
     
         19 . The computer system of  claim 17 , wherein the topology formula is datawidth dependent. 
     
     
         20 . The computer system of  claim 16 , wherein the routing recipe is dependent on a datawidth of the circuit.