
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
K.C. Cheng, S.Z. Yao, T.C. Hu, "The Orientation of Modules Based on Graph Decomposition," IEEE Transactions on Computers, vol. 40, no. 6, pp. 774780, June, 1991.  
BibTex  x  
@article{ 10.1109/12.90255, author = {K.C. Cheng and S.Z. Yao and T.C. Hu}, title = {The Orientation of Modules Based on Graph Decomposition}, journal ={IEEE Transactions on Computers}, volume = {40}, number = {6}, issn = {00189340}, year = {1991}, pages = {774780}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.90255}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  The Orientation of Modules Based on Graph Decomposition IS  6 SN  00189340 SP774 EP780 EPD  774780 A1  K.C. Cheng, A1  S.Z. Yao, A1  T.C. Hu, PY  1991 KW  orientation; modules; graph decomposition; layout stage; VLSI; printed circuit board; graph problem; NPcomplete; minimum cut; total net length; routability; circuit layout CAD; computational complexity; graph theory; printed circuits; VLSI. VL  40 JA  IEEE Transactions on Computers ER   
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 NPcomplete. 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.
[1] J. A. Bondy and U. S. R. Murty,Graph Theory with Applications. New York: North Holland, 1979.
[2] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NPCompleteness. San Francisco, CA: Freeman, 1979.
[3] T. C. Hu,Combinatorial Algorithms, Reading, MA: AddisonWesley, 1982.
[4] T. C. Hu and E. S. Kuh,VLSI Circuit Layout Theory and Design. New York: IEEE Press, 1985.
[5] C. P. Hsu, private communication, 1987.
[6] B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning of electrical circuits,"Bell Syst. Tech. J., Feb. 1970.
[7] C. L. Liu,Introduction to Combinatorial Mathematics. New York: McGrawHill, 1968.
[8] G. Persky, D. N. Deutsch, and D. G. Schweikert, "LTXA minicomputerbased system for automatic LSI layout," inProc. 14th Design Automat. Conf., May 1977, pp. 217255.
[9] B. T. Preas and P. G. Karger, "Automaticplacement a review of current techniques," inProc. 23rd Design Automat. Conf., 1986, pp. 622629.
[10] C. Sechen, "Placement and global routing of integrated circuits using simulation annealing," Ph.D. dissertation, Univ. of California, Berkeley, 1986.
[11] J. Soukup, "Circuit layout,"Proc. IEEE, Oct. 1981.
[12] J. E. Stevens, "Fast heuristic techniques for placing and wiring printed circuit boards," Ph.D. dissertation, Dep. Comput. Sci., Univ. of Illinois, 1972.
[13] The TTL Data Book, Vol. 1, Texas Instruments 1984.
[14] A. Tucker,Applied Combinatorics. New York: Wiley, 1980, pp. 109112.
[15] X. Yao, M. Yamada, and C. L. Liu, "A new approach to the pin assignment problem,"IEEE Trans. ComputerAided Design, pp. 9991006, Sept. 1989.