Method for manufacturing and designing a wiring of a channel of an electronic device and electronic apparatus
AssigneeMotorola, Inc.
InventorsAlexander Marchenko, Andrey Plis, Gopal Vijayan
Life of this patent
Estimating the term…
Abstract
The invention relates to a method for manufacturing of electronic devices, such as very large scale integrated devices, having a channel. The channel routing is done based on a compositional approach in which initially all individual terminals are represented by individual nodes in a terminal vertical constraint graph. Individual constraints between individual terminals are represented by separate edges. This approach allows the resolution of difficult classes of routing problems in an efficient way.
Claims5
A method for designing an electronic device having a channel, said channel having a boundary and a set of terminals being situated on said boundary, said channel having tracks and columns for wiring a number of nets, each of said nets having a sub-set of said set of terminals, and said terminals of said sub-set are not vacant terminals, said channel having a wiring of said nets, said wiring being designed in accordance with the steps of:
- a1) generating a terminal vertical constraint graph, said terminal vertical constraint graph comprising nodes and edges, each of said nodes being representative of at least one of said terminals, each of said edges being representative of a vertical constraint between at least a pair of said terminals which are situated in the same column and each of said edges having assigned thereto an edge rating, so that all of the terminals of said set of terminals are represented in said terminal vertical constraint graph, and said terminal vertical constraint graph having a total rating;
- and
- a2) merging of two of said nodes, said step of merging comprising the steps of:
- a2.1) initializing said edge rating for each of said edges by a first predefined value;
- a2.2) changing said edge rating of one of said edges by a second predefined value if said one of said edges connects to one of said nodes which has been merged;
- a2.3) changing said edge rating of one of said edges by a third predefined value if said one of said edges connects to one of said nodes which is representative of a vacant terminal;
- a2.4) determining said total rating by integrating said edge ratings;
- a2.5) selecting two of said nodes to be merged based on said total rating;
- a3) assigning of trunks to said channel according to said resulting terminal vertical constraint graph.
An electronic apparatus having a channel, said channel having a boundary and a set of terminals being situated on said boundary, said channel having tracks and columns for wiring a number of nets, each of said nets having a sub-set of said set of terminals, and said terminals of said sub-set are not vacant terminals, said channel having a wiring of said nets, said wiring being designed in accordance with a method comprising the steps of:
- a1) generating a terminal vertical constraint graph, said terminal vertical constraint graph comprising nodes and edges, each of said nodes being representative of at least one of said terminals, each of said edges being representative of a vertical constraint between at least a pair of said terminals which are situated in the same column and each of said edges having assigned thereto an edge rating, so that all of the terminals of said set of terminals are represented in said terminal vertical constraint graph, and said terminal vertical constraint graph having a total rating;
- and
- a2) merging of two of said nodes, said step of merging comprising the steps of:
- a2.1) initializing said edge rating for each of said edges by a first predefined value;
- a2.2) changing said edge rating of one of said edges by a second predefined value if said one of said edges connects to one of said nodes which has been merged;
- a2.3) changing said edge rating of one of said edges by a third predefined value if said one of said edges connects to one of said nodes which is representative of a vacant terminal;
- a2.4) determining said total rating by integrating said edge ratings;
- a2.5) selecting two of said nodes to be merged based on said total rating;
- a3) assigning of trunks to said channel according to said resulting terminal vertical constraint graph.
A computer readable medium having a computer program stored thereon for designing an electronic apparatus having a channel, said channel having a boundary and a set of terminals being situated on said boundary, said channel having tracks and columns for wiring a number of nets, each of said nets having a sub-set of said set of terminals, and said terminals of said sub-sets are not vacant terminals, said channel having a wiring of said nets, said computer program being adapted to carry out the design of said wiring in accordance with the steps of:
- a1) generating a terminal vertical constraint graph, said terminal vertical constraint graph comprising nodes and edges, each of said nodes being representative of at least one of said terminals, each of said edges being representative of a vertical constraint between at least a pair of said terminals which are situated in the same column and each of said edges having assigned thereto an edge rating, so that all of the terminals of said set of terminals are represented in said terminal vertical constraint graph, and said terminal vertical constraint graph having a total rating;
- and
- a2) merging of two of said nodes, said step of merging comprising the steps of:
- a2.1) initializing said edge rating for each of said edges by a first predefined value;
- a2.2) changing said edge rating of one of said edges by a second predefined value if said one of said edges connects to one of said nodes which has been merged;
- a2.3) changing said edge rating of one of said edges by a third predefined value if said one of said edges connects to one of said nodes which is representative of a vacant terminal;
- a2.4) determining said total rating by integrating said edge ratings;
- a2.5) selecting two of said nodes to be merged based on said total rating;
- and
- a3) assigning of trunks to said channel according to said resulting terminal vertical constraint graph.
Dependencies are inferred from the claim text.