Please use this identifier to cite or link to this item:
doi:10.22028/D291-26106
Title: | Efficient algorithms for the constraint generation for integrated circuit layout compaction |
Author(s): | Lengauer, Thomas |
Language: | English |
Year of Publication: | 1983 |
OPUS Source: | Saarbrücken, 1983 |
DDC notations: | 004 Computer science, internet |
Publikation type: | Report |
Abstract: | A compactor for VLSI layouts is an essential component in many CAD systems for VLSI design. It reduces the area of a given layout violating any of the design rules dictated by the fabrication process. In many CAD systems for VLSI design the compacter generates a number of linear inequalities from the circuit layout. These so-called constraints restrict the coordinates of the layout components. The resulting inequality system is then solved in some optimum way. The solution of such inequality system can be done efficiently. The generation of the constraints, however, is a problem for which no efficient algorithms have been devised so far. We define the graph problem underlying the constraint generation for VLSI circuit compaction. Furthermore we develop efficient, i.e., O(nlogn) time algorithms for the generation of constraint systems that allow to change the layout topology during the conpaction in order to yield good compaction results, but at the same time are sparse enough to be solved efficiently, i.e., of size O(n). These algorithms are simple enough to be implemented. |
Link to this record: | urn:nbn:de:bsz:291-scidok-41116 hdl:20.500.11880/26162 http://dx.doi.org/10.22028/D291-26106 |
Series name: | Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes |
Series volume: | 1983/06 |
Date of registration: | 23-Aug-2011 |
Faculty: | MI - Fakultät für Mathematik und Informatik |
Department: | MI - Informatik |
Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
File | Description | Size | Format | |
---|---|---|---|---|
fb14_1983_06ocr.pdf | 2,88 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.