Issue No. 06 - June (1991 vol. 40)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.90255
<p>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.</p>
orientation; modules; graph decomposition; layout stage; VLSI; printed circuit board; graph problem; NP-complete; minimum cut; total net length; routability; circuit layout CAD; computational complexity; graph theory; printed circuits; VLSI.
T.C. Hu, K.C. Cheng, S.Z. Yao, "The Orientation of Modules Based on Graph Decomposition", IEEE Transactions on Computers, vol. 40, no. , pp. 774-780, June 1991, doi:10.1109/12.90255