Separation and minimum wire length constrained maze routing method and system
First Claim
1. A computer implemented method for routing a first path in a circuit design, the method comprising:
- iteratively building, using the computer, a plurality of partial-paths to route the first path by adding an incremental length to a selected previously built partial-path when the computer is invoked to route the first path in the circuit design, the adding being performed in accordance with at least a first design rule, wherein the plurality of partial-paths start at a first location, wherein said iteratively building comprises;
comparing, using the computer, the plurality of partial-paths to each other when the plurality of partial-paths end on a common second location different from the first location;
saving, using the computer, one of the plurality of partial-paths that leads to a shortest first path; and
eliminating, using the computer, one of the plurality of partial-paths that is not selected to lead to the shortest first path.
2 Assignments
0 Petitions
Accused Products
Abstract
A computer implemented method for routing a first path in a circuit design is presented. The method includes iteratively building a multitude of partial-paths to route the first path by adding an incremental length to a selected previously built partial-path when the computer is invoked to route the first path in the circuit design, the adding being performed in accordance with at least a first design rule. The multitude of partial-paths start at a first location. The method further includes comparing each of the multitude of partial-paths to each other when the multitude of partial-paths end on a common second location different from the first location, and saving one of the multitude of partial-paths that leads to a shortest first path. The method further includes eliminating one of the multitude of partial-paths that are not selected to lead to the shortest first path.
58 Citations
17 Claims
-
1. A computer implemented method for routing a first path in a circuit design, the method comprising:
iteratively building, using the computer, a plurality of partial-paths to route the first path by adding an incremental length to a selected previously built partial-path when the computer is invoked to route the first path in the circuit design, the adding being performed in accordance with at least a first design rule, wherein the plurality of partial-paths start at a first location, wherein said iteratively building comprises; comparing, using the computer, the plurality of partial-paths to each other when the plurality of partial-paths end on a common second location different from the first location; saving, using the computer, one of the plurality of partial-paths that leads to a shortest first path; and eliminating, using the computer, one of the plurality of partial-paths that is not selected to lead to the shortest first path. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17)
Specification