Method for deriving an interconnection route between elements in an interconnection medium

• US 4,777,606 A
• Filed: 06/05/1986
• Issued: 10/11/1988
• Est. Priority Date: 06/05/1986
• Status: Expired due to Term

• Current Assignee: Nortel Networks Limited (Nortel Networks Corporation)
• Original Assignee: Northern Telecom Limited (Nortel Networks Corporation)
• Inventors: Fournier, Serge
• Primary Examiner(s): Lall, Parshotam S.
• Assistant Examiner(s): Mattson, Brian M.
• Application Number:
  US06/870,887
• Time in Patent Office: 859 Days
• Field of Search: 364/488-491, 357/45, 29/846, 174/68.5
• US Class Current: 716/126
• CPC Class Codes: G06F 30/394 Routing G06F30/396 takes precedence

Abstract

In a routing method for efficiently routing interconnections of a printed circuit board, an ordered list of interconnections to be made is first developed, each interconnection consisting of a source and a target. The interconnection medium is notionally divided into cells and, in a flooding routine for deriving the route between a particular source and target, cells at a progressively increasing distance from the source are considered. The progressive flooding is performed under a preset control by associating a respective cost with each of a number of possible flooding directions. At any time, flooding occurs from that cell to which the accummulated cost of flooding from the source is a minimum. Eventually a target cell is reached and by tracing backpointer directions associated with the intervening cells, the least cost route is derived as a series of contiguous line segments having position, length and orientation. The same sequence is performed for all interconnections and the line segments are subsequently implemented as circuit board conductors and vias.

Claims

1. A method for deriving an interconnection route between elements in a connection medium, comprising the steps of:

(i) defining;

(a) a cell map comprising a plurality of addressable cells representing grid positions in the connection medium,

(b) a plurality of flags including an empty cell flag, a seed cell flag, a target cell flag, an unavailable cell flag, and a plurality of pointer direction flags, each pointer direction flag having an associated pointer direction and an associated cost; and

(c) a plurality of cost bins, each cost bin Bn being associated with a cost n and having a plurality of locations for storing data items comprising a cell address and an associated flag;

(ii) writing in software;

(a) unavailable cell flags into cells associated with grid positions not available for routing of an interconnection;

(b) target cell flags into cells associated with grid positions occupied by a target element; and

(c) data items comprising addresses of cells associated with grid positions occupied by a seed element and associated seed cell flags into a cost bin B_O associated with zero cost;

(iii) and repeating the following steps until a data item containing a cell address corresponding to a cell containing a target cell flag is selected;

(a) scanning the cost bins in order of increasing associated cost until a cost bin B_n containing at least one data item is located;

(b) selecting a data item from said cost bin, and;

(I) if an empty cell flag is stored in the cell corresponding to the cell address contained in said selected data item, said cell being a correspondent cell, overwriting the empty cell flag with the flag of the selected data item, deleting the selected data item from the cost bin and, for each cell adjacent to the correspondent cell other than cells containing unavailable cell flags, writing a data item into cost bin B_n +_m, the data item comprising the address of the adjacent cell and an associated pointer direction flag, the associated pointer direction flag corresponding to a direction from the adjacent cell to the correspondent cell and m being the cost associated with said pointer direction flag; and

(II) if the flag stored in the cell corresponding to the cell address contained in said selected data item is a pointer direction flag, deleting said selected data item from the cost bin;

wherein the derived interconnection route comprises a path from the selected cell containing a target cell flag to a cell containing a seed cell flag through intermediate cells following directions corresponding to pointer direction flags stored in said intermediate cells.

2. A method as claimed in claim 1 wherein the cells are square.

3. A method as claimed in claim 2 wherein said pointer directions comprise compass pointer directions north, south, east, west, northeast, northwest, southeast, southwest, and the directions up and down, the compass pointer directions representing directions to the eight square cells which exist adjacent a square cell in a particular map layer occupied by the cell, all of the cells being of identical area and the up, down pointer directions representing directions from the map layer respectively occupied by the cell to an overlying and an underlying map layer.

4. A method as claimed in claim 3 wherein said plurality of flags further includes a flag for designating that a cell at one layer is occupied by a via to an overlying or underlying map layer.

5. A method as claimed in claim 3 wherein said plurality of flags further includes a flag for designating an edge cell on the map.

6. A method as defined in claim 2 wherein at least one pointer direction flag has one associated cost when associated with cells in one map layer and a different associated cost when associated with cells in a different map layer.

7. A method for deriving a plurality of interconnection routes, comprising performing the method according to claim 1 for each of the plurality of interconnection routes in succession, and writing unavailable cell flags into each cell associated with each previously derived route on each successive performance of the method until the plurality of interconnection routes is exhausted.

8. A method as claimed in claim 7 wherein each of the cells within the cell map has associated therewith an address, a permanent store and a temporary store said pointer direction flags being written into said temporary stores during each successive performance of the method, and unavailable cell flags being written into said permanent stores to define each successively derived route after each successive performance of the method according to claim 1.

9. A method as claimed in claim 8 wherein following derivation of each route, pointer direction flags for cells on the derived route are transferred from the temporary to the permanent store.

10. A method according to claim 7 wherein input data includes a list of functional interconnections to be made, the method comprising ordering members of the list by:

(i) counting the number of cells containing empty cell flags in each of a plurality of rows of cells and columns of cells to define a capacity for each row and each column;

(ii) counting the number of cells in each row and each column which would be crossed by an interconnection if each interconnection extended along a straight line linking elements to be interconnected to define an occupancy for each row and each column;

(iii) dividing each row and column occupancy by a corresponding capacity to define a MAOMIC product for each row and each column;

(iv) comparing the MAOMIC products of each row and each column crossed by a straight line interconnection and sorting the maximum MAOMIC product for each interconnection; and

(v) deriving routes for said interconnections in descending order of the MAOMIC products associated with said interconnections.

11. A method as claimed in claim 10 wherein following derivation of each route joining two elements, data representing the two elements are re-written to represent a single element comprising said two elements and the derived route extending between the two elements.

12. A method as claimed in claim 1 wherein a road map indicative of cells where certain pointer direction flags are not permitted is stored, the method further comprising looking up said road map at each data item selection and writing the pointer direction flag of the selected data item into the cell map at the cell corresponding to the cell address of the data item only if said pointer direction flag is permitted at said cell.

13. A method as claimed in claim 1 further comprising translating the derived interconnection route into a set of conductor line segments and vias in a multilayer printed circuit board.