This thesis describes a near-optimal standard cell layout strategy which consists of three consecutive steps; partition, placement, and routing.
In the partition step, a given network is torn apart into many subnetworks such that each subnetworks contains as many cells as possible with minimum interconnections between subnetworks. In the placement step, the convensional string placement algorithm was modified. In the routing step, use of a minimum number of via was intended. Also, bonding pads were placed such that their connections to the related cells are shortest.
As a result for the tested example, the placement time was saved by 60% and the total routing lengths were saved by more than 20% and substantial improvements in the number of feed-through cell and the track density were obtained.
The layout program is coded in PASCAL and implemented on a VX 11-750/UNIX computer.
