Area routing for analog layout
- 1 January 1993
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 12 (8) , 1186-1197
- https://doi.org/10.1109/43.238611
Abstract
An area router specifically tailored for the layout of analog circuits is presented. It is based on the A* algorithm, which combines the flexibility of maze routing with computational efficiency. Parasitics are controlled by means of a programmable cost function based on a set of user-defined weights. The weights can be automatically defined based on high-level electrical performance specifications and determine the net scheduling. An algorithm for symmetric routing preserves symmetries in differential architectures. Different current paths can be dealt with in each wire by means of a net partitioning procedure driven by information on the current driven by terminals. Shields can be built between critically coupled wires, in order to guarantee an effective limitation of cross-coupling. The weight-driven programmable cost function makes this router particularly suitable for a performance-driven approach to analog routing. Automatic weight definition also makes the use of the tool independent of the user's expertise. The implemented algorithms are described and results are illustrated proving the effectiveness of this approach.This publication has 20 references indexed in Scilit:
- A general router for analog layoutPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- DAVE: an automatic mixed analog/digital IC layout compilerPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A technology-independent approach to custom analog cell generationIEEE Journal of Solid-State Circuits, 1991
- A New Symbolic Channel Router: YACR2IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- Fast Maze RouterPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- On Steiner Minimal Trees with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1976
- The Lee Path Connection AlgorithmIEEE Transactions on Computers, 1974
- An Algorithm for Path Connections and Its ApplicationsIEEE Transactions on Electronic Computers, 1961
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957