Back to results
US 8,291,366 B2Granted
Routing system and method using a routing tree rip-up
AssigneeSTMicroelectronics Pvt. Ltd.
InventorsHimanshu Srivastava, Jyoti Malhotra
Life of this patent
Estimating the term…
Abstract
A routing system is improved by performing three steps sequentially to complete an execution process. The first step estimates a normalized criticality score for each design net. The second step arranges the scores for each design net in descending order. Third step rips up and reroutes the design so as to make it more feasible.
Claims22
A routing method for computer-aided design comprising:
- estimating with a computer aided design system a routing order for all nets in a design;
- and
- ripping up with a computer aided design system most critical and obstructing net sets in the design;
- wherein ripping up the most critical and obstructing net sets in the design comprises:
- identifying with a bounding box identifier of the second module a bounding box region and overlapping bounding box region;
- determining with an obstructing net analyzer of the second module a list of obstructing net sets in said bounding box region;
- and
- ripping up with an obstructing net eliminator of the second module said obstructing net sets;
- and
- wherein obstructing net sets are ripped up by incremental rip up limited by a depth factor that is an absolute value of recursion reached at any given instance of time and which is a variable that is incremented by one during each recursive rip up call for an obstructing net until the list is completed.
7 more elements
A routing method for computer-aided design, comprising:
- estimating a routing order for nets in a design, said routing order identifying a criticality score for each net in the design;
- implementing routing trees for said nets in the design;
- identifying obstructing net sets comprised of nets in the design whose implemented routing trees obstruct each other;
- and
- ripping up the implemented routing trees for the identified obstructing net sets;
- wherein ripping up comprises performing an incremental rip up limited by a depth factor.
3 more elements
A routing method for computer-aided design, comprising:
- estimating a routing order for nets in a design, said routing order identifying a criticality score for each net in the design;
- implementing routing trees for said nets in the design;
- identifying obstructing net sets comprised of nets in the design whose implemented routing trees obstruct each other;
- and
- ripping up the implemented routing trees for the identified obstructing net sets;
- wherein ripping up comprises performing a recursive rip up of obstructing net sets, said recursive rip up limited by a depth factor.
3 more elements
A routing method for computer-aided design, comprising:
- estimating a routing order for nets in a design, said routing order identifying a criticality score for each net in the design;
- implementing routing trees for said nets in the design;
- identifying obstructing net sets comprised of nets in the design whose implemented routing trees obstruct each other;
- and
- ripping up the implemented routing trees for the identified obstructing net sets;
- wherein ripping up comprises:
- identifying with a bounding box identifier a bounding box region and overlapping bounding box region;
- determining a list of obstructing net sets in said bounding box region;
- and
- ripping up said obstructing net sets.
7 more elements
A routing method for computer-aided design, comprising:
- estimating a routing order for nets in a design, said routing order identifying a criticality score for each net in the design;
- implementing routing trees for said nets in the design;
- identifying obstructing net sets comprised of nets in the design whose implemented routing trees obstruct each other;
- and
- ripping up the implemented routing trees for the identified obstructing net sets;
- wherein estimating the routing order comprises:
- approximating a normalized criticality score of each net in the design;
- and
- sequencing said normalized criticality scores in descending order.
6 more elements
A routing method for computer-aided design comprising:
- estimating a routing order for nets in a design;
- implementing routing trees for said nets in the design;
- and
- ripping up the routing trees for obstructing net sets in the design;
- wherein ripping up comprises performing an incremental rip up limited by a depth factor that is an absolute value of recursion and which is a variable that is incremented by one during each recursive rip up of an obstructing net set.
2 more elements
Dependencies are inferred from the claim text.