Graph-theory-based simplex algorithm for VLSI layout spacing problems with multiple variable constraints

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 20, Issue 8, 2001, Pages 967-979

  Wang, Lib Yang ^a   Lai, Yen Tai ^b  

^a SOUTHERN TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^b NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Graph theory; Layout compaction; Linear programming; VLSI physical design

Indexed keywords

ALGORITHMS; CALCULATIONS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; LINEAR PROGRAMMING; MATRIX ALGEBRA; THEOREM PROVING; VLSI CIRCUITS;

GRAPH-THEORY-BASED SIMPLEX ALGORITHM; LAYOUT COMPACTION; MULTIPLE VARIABLE CONSTRAINTS;

INTEGRATED CIRCUIT LAYOUT;

EID: 0035425111     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.936378     Document Type: Article

References (17)

1. An algorithm to compact VLSI symbolic layouts with mixed constraints
2. A graph theoretical compaction algorithm
3. Minplex-A compactor that minimizes the bounding rectangle and individual rectangles in a layout
4. A hierarchy preserving hierarchical compactor
5. Cloning techniques for hierarchical compaction
6. HIMALAYAS-A hierarchical compaction system with a minimized constraint set
7. Cell-based hierarchical pitch matching compaction using minimal LP
8. Layout compaction with minimized delay bound on timing critical paths
9. An efficient algorithm for layout compaction problem with symmetry constraints
10. A subjective review of compaction
11. Symbolic layout compaction review
12. Layout compaction with attractive and repulsive constraints
13. Performance-driven spacing algorithms using attractive and repulsive constraints for submicron LSIs
14. A graph-based simplex algorithm for minimizing the layout size and the delay on timing critical paths