Automatic routing system for circuit layout

• US 20010038612A1
• Filed: 03/01/2001
• Published: 11/08/2001
• Est. Priority Date: 09/30/1999
• Status: Abandoned Application

• Current Assignee: Routech Incorporated
• Original Assignee: Routech Incorporated
• Inventors: Vaughn, Darrell, Vaughn, Elizabeth Gurley, Karlow, Marvin
• Application Number:
  US09/797,172
• Publication Number:
  US 20010038612A1
• Time in Patent Office: Days
• US Class Current: 370/256
• CPC Class Codes: G06F 30/394 Routing G06F30/396 takes precedence

Abstract

A method is disclosed for automatically planning the routing of circuit paths on a routing surface by defining a topology of the circuit paths according to input data for connections to be routed and respective routing constraints associated with the connections to be routed; creating the circuit paths for connections to be routed having associated routing constraints iteratively according to the defined topology of the circuit paths within each unit zone; evaluating the circuit paths for compliance with the respective routing constraints during the step of creating the circuit paths; and saving data describing the circuit paths. In an alternate embodiment, a method is disclosed for planning the routing of circuit paths on at least one routing surface by creating a pattern of traces on a routing surface from input data for connections in accordance with the trace creating algorithm; after creating less than all of the pattern of traces, analyzing an operational characteristic of traces subject to predetermined routing constraints of the created portion of the pattern of traces in the operating environment of the trace; comparing results of the analyzing step to a specification for the operational characteristic of the created portion of the pattern of traces; modifying the trace creating algorithm if the operational characteristic fails to satisfy the specification; and repeating the foregoing steps until the operational characteristic satisfies the specification.

Claims

1. A method for planning the routing of circuit paths on at least one routing surface, comprising the steps of:

defining a topology of the circuit paths on the routing surface according to input data for connections to be routed and respective routing constraints associated with the connections to be routed;

creating the circuit paths for connections to be routed having associated routing constraints, iteratively within each one of a plurality of predetermined unit zones of the at least one routing surface wherein the plurality of predetermined unit zones are processed in a predetermined sequence, the circuit paths being created according to the defined topology of the circuit paths within each unit zone;

verifying the circuit paths created, by evaluating the circuit paths for compliance with the respective routing constraints associated with the connections to be routed, during the step of creating the circuit paths; and

saving data describing the circuit paths created for the at least one routing surface.

2. The method of

claim 1

, further comprising the step of:

providing results of verifying the circuit paths via feedback preceding the step of creating the circuit paths.

3. The method of

claim 1

, wherein the step of defining a topology comprises the step of:

selecting at least one of a rule for defining the topology from the group including user-defined rule, user-guided rule, standard pattern rule, minimum spanning tree (MST), daisy chain and node ordering;

computing densities of circuit paths to be routed from known obstacles and path patterns;

sorting the connections to be routed in order first for connections to be routed that are associated with a routing constraint and second for connections to be routed that are not associated with a routing constraint; and

planning circuit paths to be routed in order within each unit zone.

4. The method of

claim 1

, wherein the step of creating the circuit paths comprises the steps of:

reducing the circuit paths to orthogonal components;

defining a circuit path to comply with path density data and routing constraints;

performing a constraint verification on the defined circuit path; and

if the result of the constraint verification is negative, repeating the step of creating the circuit paths.

5. The method of

claim 1

, wherein the step of creating the circuit paths comprises the steps of:

reducing the circuit paths to orthogonal components;

defining a circuit path to comply with path density data and routing constraints;

performing a constraint verification on the defined circuit path; and

if the result of the constraint verification is affirmative, proceeding with a next connection to be routed.

6. The method of

claim 1

, further comprising the step of:

creating the circuit paths for connections to be routed that do not have associated routing constraints.

7. The method of

claim 1

, further comprising the step of:

determining whether homogenization of circuit paths routed in adequate.

8. The method of

claim 7

, wherein the step of determining comprises the step of:

iterating the connections previously routed in the unit zone if the homogenization is not adequate.

9. The method of

claim 7

, wherein the step of determining comprises the step of:

iterating the connections to be routed in the unit zone if the homogenization is adequate.

10. The method of

claim 1

, wherein the step of verifying the circuit paths comprises the step of:

accessing a dedicated processing module via an interface manager to perform a constraint verification according to the routing constraint associated with the connection to be routed that is being created.

11. The method of

claim 1

, wherein the step of verifying the circuit paths comprises the steps of:

accessing a processing module via an interface manager, the processing module configured for verifying the routing constraint associated with the connection to be routed; and

verifying the routing constraint is satisfied.

12. A method for automatically routing circuit paths on at least one routing surface, comprising the steps of:

planning the routing of the circuit paths on the at least one routing surface to produce a routing plan;

activating a routing engine to begin processing circuit path data retrieved from a routable segments file from an origin to an ultimate location and in incremental steps within each of a plurality of unit zones in sequence defined for the at least one routing surface to define an expanding virtual map of the routing plan such that all of the circuit paths defined by the routing plan between the origin and the extremities of the expanding virtual map are created;

verifying, upon the completion of routing the circuit paths of each unit zone, that any routing constraint associated with a connection to be routed in the present unit zone in the routing plan satisfies the associated routing constraint;

modifying the circuit path routing in the present unit zone if a routing constraint associated with a connection being verified in the previous step in the present unit zone does not satisfy the associated routing constraint; and

advancing to the next unit zone.

13. The method of

claim 12

, wherein the step of planning the routing of the circuit paths comprises the steps of:

defining a topology of the circuit paths on the routing surface according to input data for connections to be routed and respective routing constraints associated with the connections to be routed;

creating the circuit paths for connections to be routed having associated routing constraints, iteratively within each one of a plurality of predetermined unit zones of the at least one routing surface wherein the plurality of predetermined unit zones are processed in a predetermined sequence, the circuit paths being created according to the defined topology of the circuit paths within each unit zone;

verifying the circuit paths created, by evaluating the circuit paths for compliance with the respective routing constraints associated with the connections to be routed, during the step of creating the circuit paths, and

saving data describing the circuit paths created for the at least one routing surface.

14. The method of

claim 12

, further comprising the step of:

initiating a final verification, after routing of all of the circuit paths in all of the unit zones is completed, that all routing constraints associated with a connection to be routed are satisfied.

15. The method of

claim 12

, wherein the step of verifying comprises the steps of:

accessing a processing module via an interface manager, the processing module configured for verifying the routing constraint associated with the connection to be routed; and

verifying the routing constraint is satisfied.

16. A method for planning the routing of circuit paths on at least one defined routing surface to accommodate a predetermined circuit parameter affecting the routing, comprising the steps of:

converting the predetermined circuit parameter affecting the routing of circuit paths to a spatial parameter of the at least one defined routing surface to be routed;

estimating the spatial parameter value required to satisfy the predetermined circuit parameter;

performing an iterative routing path analysis within each one of a plurality of predetermined unit zones of the at least one routing surface, wherein the plurality of predetermined unit zones are analyzed in a predetermined sequence to create a routable circuit path according to a defined topology of the circuit paths with each unit zone, and according to the estimated spatial parameter value;

evaluating the routable circuit path in a processing module, the processing module being configured to determine the correct circuit parameter value for the routable circuit path in a present unit zone, and expressing it in terms o the spatial parameter, the processing module further being accessible via an interface manager;

feeding back information indicating whether the circuit path as created satisfies the required circuit parameter value; and

iterating the routing path analysis until the circuit parameter value is met.

17. A method for planning the routing of circuit paths on at least one routing surface, comprising the steps of:

creating a pattern of traces on a routing surface from input data for connections in accordance with a trace creating algorithm;

after creating less than all of the pattern of traces, analyzing an operational characteristic of the created portion of the pattern of traces in the operating environment of the trace including traces subject to predetermined routing constraints;

comparing results of the analyzing step to a specification for the 10 operational characteristic of the created portion of the pattern of traces;

modifying the trace creating algorithm if the operational characteristic fails to satisfy the specification; and

repeating the foregoing steps until the operational characteristic for the created traces in the portion of the pattern of traces created satisfies the specification.

18. The method of

claim 17

, wherein the step of creating comprises the steps of:

expressing the predetermined routing constraints as physical parameters of the routing surface;

defining the topology of the pattern of traces to be used during the planning of the routing of circuit paths; and

creating the pattern of traces utilizing the input data, predetermined routing constraints and the topology of the pattern of traces.

19. The method of

claim 17

, wherein the step of analyzing comprises the step of:

branching to an analysis routine to verify the operational characteristic of the created portion of the pattern of traces; and

running a verification analysis to produce a value of the operational characteristic for comparison.

20. The method of

claim 17

, wherein the step of comparing comprises the step of:

retrieving the specification for the operational characteristic; and

comparing the produced value of the operational characteristic with the specification.

21. The method of

claim 17

, further comprising the step of:

advancing to the connections for the next portion of the routing surface for which the routing of circuit paths is to be planned; and

repeating the steps of

claim 17

until the planning the routing for all portions of the routing surface is completed.