Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
202 words
An MtoL (behavioral model to layout information) method for converting an RTL (register transfer level) behavioral model in the form of an RTL module tree including a plurality of hierarchical RTL modules representing the logic structure and functionality of an integrated circuit, into MtoL layout information for use in a block router, comprising the steps: assigning to selected ones of the RTL modules MtoL macros that define corresponding geometric and terminal information; extracting these MtoL macros along with the RTL modules for inclusion in the MtoL extract tree; extracting from the RTL module tree the hierarchical RTL modules to create a corresponding hierarchical MtoL extract tree; performing a flattening transformation of the hierarchical Mtol extract tree to provide a non-hierarchical representation including a terminal interconnection netlist, said performing said flattening transformation accomplished by the substeps of performing a breadth first traversal through the hierarchical MtoL extract tree to create a linked list of all leaf nodes, which correspond to layout style blocks or intermediate blocks designated as leaf nodes, and performing a depth first search of the Mtol extract tree to generate a netlist that describes a routine network; and using the non-hierarchical representation and terminal interconnect netlist, generating MtoL layout information.
Claim 2
Dependent Claim
202 words
An MtoL (behavioral model to layout information) method for converting an RTL (register transfer level) behavioral model in the form of an RTL module tree including a plurality of hierarchical RTL modules representing the logic structure and functionality of an integrated circuit, into MtoL layout information for use in a block router, comprising the steps: assigning to selected ones of the RTL modules MtoL macros that define corresponding geometric and terminal information; extracting these MtoL macros along with the RTL modules for inclusion in the MtoL extract tree; extracting from the RTL module tree the hierarchical RTL modules to create a corresponding hierarchical MtoL extract tree; performing a flattening transformation of the hierarchical Mtol extract tree to provide a non-hierarchical representation including a terminal interconnection netlist, said performing said flattening transformation accomplished by the substeps of performing a breadth first traversal through the hierarchical MtoL extract tree to create a linked list of all leaf nodes, which correspond to layout style blocks or intermediate blocks designated as leaf nodes, and performing a depth first search of the Mtol extract tree to generate a netlist that describes a routine network; and using the non-hierarchical representation and terminal interconnect netlist, generating MtoL layout information.
Claim 3
Dependent Claim
29 words
The MtoL method of claim 1, wherein the MtoL layout information includes bounding boxes (including geometry and terminal location), initial bounding box placements, and an associated terminal interconnect netlist.
Claim 4
Dependent Claim
25 words
The MtoL method of claim 1, wherein the MtoL macros are MtoL bounding box and terminal macros that define bounding box geometry and terminal location.
Claim 5
Dependent Claim
54 words
The MtoL method of claim 1, wherein the RTL modules are written in a modeling language that is not in an MtoL input format, and wherein the step of extracting hierarchical RTL modules from the RTL module tree is accomplished by converting the RTL modules into extract files according to an MtoL input format.
Claim 6
Dependent Claim
28 words
The MtoL method of claim 1, wherein the netlist comprises a linked list of interconnected groups of terminals excluding terminals contained in the intermediate blocks of the hierarchy.
Claim 7
Dependent Claim
25 words
The MtoL method of claim 1, wherein the step of generating MtoL layout information, is accomplished using the list of leaf nodes and the netlist.
Claim 8
Dependent Claim
37 words
The MtoL method of claim 6, further comprising the step of: assigning to selected intermediate blocks MtoL leaf macros that designate such blocks as leaf nodes; such that MtoL layout information is generated for such intermediate blocks.
Claim 9
Dependent Claim
78 words
The MtoL method of claim 7, further comprising the step of: assigning MtoL exist macros to selected ones of the intermediate blocks designated as leaf nodes by MtoL leaf macros, with each MtoL exist macro identifying a corresponding external file of layout information for the associated intermediate block; such that, for each MtoL exist macro, the step of generating layout information is accomplished by importing the associated external file of layout information for output as MtoL layout information.
Claim 10
Dependent Claim
212 words
An MtoL (behavioral model to layout information) method for converting an RTL (register transfer level) behavioral model in the form of an RTL module tree including a plurality of hierarchical RTL modules representing the logic structure and functionality of an integrated circuit, into MtoL layout information for use in a block router, comprising the steps: assigning MtoL macros to selected ones of the RTL modules, said MtoL macros defining corresponding bounding box and terminal location information for said assigned RTL modules; extracting from the RTL module tree the hierarchical RTL modules and MtoL macros to create a corresponding hierarchical MtoL extract tree; performing a flattening transformation of the hierarchical Mtol extract tree to provide a non-hierarchical representation including a terminal interconnection netlist; and using the non-hierarchical representation and terminal interconnect netlist, generating MtoL layout information in the form of bounding boxes (including geometry and terminal location), initial bounding box placements, and an associated terminal interconnect netlist, said MtoL layout information generated for RTL modules not having assigned MtoL macros including said geometry and terminal location for bounding boxes having default bounding box geometries that is a smallest bounding box that Will accommodate a number of terminals assigned to said RTL module and a random distribution of terminal locations around said bounding box.
Claim 11
Dependent Claim
212 words
An MtoL (behavioral model to layout information) method for converting an RTL (register transfer level) behavioral model in the form of an RTL module tree including a plurality of hierarchical RTL modules representing the logic structure and functionality of an integrated circuit, into MtoL layout information for use in a block router, comprising the steps: assigning MtoL macros to selected ones of the RTL modules, said MtoL macros defining corresponding bounding box and terminal location information for said assigned RTL modules; extracting from the RTL module tree the hierarchical RTL modules and MtoL macros to create a corresponding hierarchical MtoL extract tree; performing a flattening transformation of the hierarchical Mtol extract tree to provide a non-hierarchical representation including a terminal interconnection netlist; and using the non-hierarchical representation and terminal interconnect netlist, generating MtoL layout information in the form of bounding boxes (including geometry and terminal location), initial bounding box placements, and an associated terminal interconnect netlist, said MtoL layout information generated for RTL modules not having assigned MtoL macros including said geometry and terminal location for bounding boxes having default bounding box geometries that is a smallest bounding box that Will accommodate a number of terminals assigned to said RTL module and a random distribution of terminal locations around said bounding box.
Claim 12
Dependent Claim
54 words
The MtoL method of claim 9, wherein the RTL modules are written in a modeling language that is not in an MtoL input format, and wherein the step of extracting hierarchical RTL modules from the RTL module tree is accomplished by converting the RTL modules into extract files according to an MtoL input format.
Claim 13
Dependent Claim
91 words
The MtoL method of claim 9, wherein the flattening transformation is accomplished by the substeps of: performing a breadth first traversal through the hierarchical MtoL extract tree to create a linked list of all leaf nodes, which correspond to layout style blocks or intermediate blocks designated as leaf nodes; and performing a depth first search of the MtoL extract tree to generate a netlist that describes a routing network in the form of a linked list of interconnected groups of terminals excluding terminals contained in the intermediate blocks of the hierarchy.
Claim 14
Dependent Claim
104 words
The MtoL method of claim 11, further comprising the steps of: assigning to selected intermediate blocks MtoL leaf macros that designate such blocks as leaf nodes; assigning MtoL exist macros to selected ones of the intermediate blocks designated as leaf nodes by MtoL leaf macros, with each MtoL exist macro identifying a corresponding external file of layout information for the associated intermediate block; such that MtoL layout information is generated for such intermediate blocks either directly, or in the case of a leaf node assigned an MtoL exist macro, by importing the associated external file of layout information for output as MtoL layout information.