Ngai, John Y. (1984) The General Interconnect Problem of Integrated Circuits. California Institute of Technology . (Unpublished) http://resolver.caltech.edu/CaltechCSTR:1984.5143-tr-84
See Usage Policy.
Other (Adobe PDF (5.2MB))
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechCSTR:1984.5143-tr-84
This thesis is concerned with the interconnection problem of custom integrated circuits. It may be broadly defined as the transformation of circuit description represented by the notion of modules together with the circuit connectivity requirements, into wiring patterns which implement the required connectivities. Conventional approaches to its solution are presented. Issues such as partition to placement and routing and various layout optimization tradeoffs are discussed. A detail hierarchical routing model with timing considerations that extends naturally to multiple conducting layer environment is presented. Several of the implications of this extension are also discussed. The rest of this thesis deals with an experiment with the stepping approach to routing as an alternative to the conventional cellular approach empahasing simplicity rather than optimization. Algorithms for routing signals and power developed for the stepping router are presented. An implementation of this approach by the author together with some test examples and their results are also described, This thesis concludes with a few suggestions for further research work in this area which the author considers very important from the experience gained during the work on this thesis.
|Item Type:||Report or Paper (Technical Report)|
|Group:||Computer Science Technical Reports|
|Usage Policy:||You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.|
|Deposited By:||Imported from CaltechCSTR|
|Deposited On:||25 Jul 2002|
|Last Modified:||26 Dec 2012 14:11|
Repository Staff Only: item control page