Back to results
US 10,769,343 B2Granted
High-speed shape-based router
AssigneePulsic Limited
InventorJeremy Birch
Life of this patent
Estimating the term…
Abstract
A high-speed shape-based router is applicable to standard-cell digital designs, chip-level-block assembly designs, and other styles of design. In a flow of the invention, the technique establishes an initial structure for each net to be routed. Nets or parts of them are ordered. Each part of the net may be routed using a spine routing search, depth first search, or a space flood search, or any combination of these. Where sections fail or an error occurs, conflicts are identified, and the technique tries routing again.
Claims22
A method comprising:
- providing a layout with at least three pins to be coupled together using a single net;
- adding a Steiner point to the layout;
- determining a path between the Steiner point and a first pin of the at least three pins by using a computer, wherein the determining comprises:
- determining a position of a spine segment between the Steiner point and the first pin;
- connecting the Steiner point to the spine segment using a first subspine segment;
- and
- connecting the first pin to the spine segment using a second subspine segment;
- determining a path between the Steiner point and a second pin of the at least three pins;
- and
- determining a path between the Steiner point and a third pin of the at least three pins,
- wherein the determining a path between the Steiner point and a first pin of the at least three pins comprises:
- ordering portions of the nets, wherein the ordering comprises:
- when n pins of a net are to be routed, where n is an integer two or greater, determining at least n−1 routing problems to be solved;
- determining an order of solving the at least n−1 routing problems;
- when an X-orientation section of a first one of the at least n−1 routing problems is longer than a second one of the at least n−1 routing problems, ordering the first one of the at least n−1 routing problems before the second one of the at least n−1 routing problems;
- and
- when an X-orientation section of a third one of the at least n−1 routing problems is longer than the second, but shorter than the first, ordering the third one of the at least n−1 routing problems after the first one of the at least n−1 routing problems, but before the second one of the at least n−1 routing problems.
14 more elements
A shape-based routing method comprising:
- providing n pins of a layout to be routing using a single net, where n is an integer two or greater;
- determining whether to add and adding at least one Steiner point to the layout;
- decomposing the net into at least n−1 routing problems to be solved by using a computer;
- determining an order to solve the routing problems;
- solving the routing problems in the order determined;
- and
- finding the net coupling the n pins together,
- wherein the decomposing the net into at least n−1 routing problems to be solved by using a computer comprises:
- ordering portions of the nets, wherein the ordering comprises:
- when n pins of a net are to be routed, where n is an integer two or greater, determining the at least n−1 routing problems to be solved;
- when an X-orientation section of a first one of the at least n−1 routing problems is longer than a second one of the at least n−1 routing problems, ordering the first one of the at least n−1 routing problems before the second one of the at least n−1 routing problems;
- and
- when an X-orientation section of a third one of the at least n−1 routing problems is longer than the second, but shorter than the first, ordering the third one of the at least n−1 routing problems after the first one of the at least n−1 routing problems, but before the second one of the at least n−1 routing problems.
10 more elements
A method comprising:
- providing n pins of a layout to be routing using a single net, where n is an integer two or greater;
- determining whether to add and adding at least one connection point to the layout;
- decomposing the net into at least n−1 routing problems to be solved by using a computer;
- determining an order to solve the routing problems;
- solving the routing problems in the order determined;
- and
- finding the net coupling the n pins together,
- wherein the decomposing the net into at least n−1 routing problems to be solved by using a computer comprises:
- ordering portions of the nets, wherein the ordering comprises:
- when n pins of a net are to be routed, where n is an integer two or greater, determining the at least n−1 routing problems to be solved;
- when an X-orientation section of a first one of the at least n−1 routing problems is longer than a second one of the at least n−1 routing problems, ordering the first one of the at least n−1 routing problems before the second one of the at least n−1 routing problems;
- and
- when an X-orientation section of a third one of the at least n−1 routing problems is longer than the second, but shorter than the first, ordering the third one of the at least n−1 routing problems after the first one of the at least n−1 routing problems, but before the second one of the at least n−1 routing problems.
10 more elements
Dependencies are inferred from the claim text.