×

Routing algorithm method for standard-cell and gate-array integrated circuit design

  • US 5,483,461 A
  • Filed: 06/10/1993
  • Issued: 01/09/1996
  • Est. Priority Date: 06/10/1993
  • Status: Expired due to Term
First Claim
Patent Images

1. A computer-implemented method of providing an electronic design automation tool for the design of a chip with at least two metal interconnecting layers (metal-1 and metal-2), said chip design being introduced to a database in a computer workstation by a user in a set of top design files and extracted in exportable form by a utility package, the method comprising the steps of:

  • accessing said computer database for laying boundaries for a via-region on said chip for each pin-master in a plurality of pin-masters all in a cell-master, wherein placing a via connects a pin to a plurality of metal layers without causing a pre-defined design rule violation to any other pin-master;

    accessing said computer database for identifying all "via-spots" within each said via-region that violates none of said design rules if vias are placed at these points, wherein a first attempt at identification inspects points along metal-2-pitch lines and half metal-2-pitch lines in said via-region, and wherein said via-spots which have a maximum number of spots on metal-2-pitch lines and half metal-2-pitch lines are preferred;

    accessing said computer database for placing vias on each cell instance according to their via-spots, such that for each cell instance, a two via-spot combination associated with it'"'"'s cell-master is found where a first combination (c1) has a maximum number of via-spots (n1) on metal-2-pitch lines and a second combination (c2) has a maximum number of via-spots (n2) on half-metal-2-pitch lines, and if n1 is greater than or equal to n2, then vias are placed at said via-spots defined by c1, otherwise said cell instance is shifted, and said vias are placed at said via-spots defined by c2;

    accessing said computer database for maze-routing to connect said neighboring same net pins by metal-1; and

    accessing said computer database for removing said vias on said pins connected by the maze-routing, leaving only one via on a pin if a connection for a current net is not complete.

View all claims
  • 3 Assignments
Timeline View
Assignment View
    ×
    ×