Applied combinatorics (3rd ed.)
Applied combinatorics (3rd ed.)
Automatic placement a review of current techniques (tutorial session)
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Combinatorial Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fast heuristic techniques for placing and wiring printed circuit boards
Fast heuristic techniques for placing and wiring printed circuit boards
Graph Theory With Applications
Graph Theory With Applications
Wirelength optimization by optimal block orientation
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Optimal cell flipping in placement and floorplanning
Proceedings of the 43rd annual Design Automation Conference
Block flipping and white space distribution for wirelength minimization
Integration, the VLSI Journal
| Hi-index | 14.98 |
In the layout stage of VLSI and printed circuit board (PCB) design, after all circuit modules (rectangular) are placed, it is possible to flip the modules so as to reduce the total net length. The authors formulate the orientation of modules as a graph problem and prove it to be NP-complete. The orientation problem is shown to be equivalent to finding a minimum cut of a graph with some arcs of negative capacities. In many cases, the graph can be decomposed into subgraphs to reduce the search space for optimum orientation. Experiments with real cases show that module orientation reduces the total net length and improves the routability.