Title :
Flipping modules to minimize maximum wire length
Author :
Chong, KyunRak ; Sahni, Sartaj
Author_Institution :
Hongik Univ., Seoul, South Korea
Abstract :
It is shown that obtaining the optimal orientations of modules to minimize the length of the longest wire is NP-hard. If each module is permitted only two possible orientations, this can be done in linear time. When all four orientations are permissible and wires are restricted to connect modules whose separation is bounded by some constant, then the problem can also be solved in linear time
Keywords :
circuit layout CAD; computational complexity; NP-hard; flipping modules; maximum wire length minimisation; optimal orientations; Circuit optimization; Euclidean distance; Neural networks; Polynomials; Simulated annealing; Wire;
Conference_Titel :
Computer Design: VLSI in Computers and Processors, 1991. ICCD '91. Proceedings, 1991 IEEE International Conference on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-8186-2270-9
DOI :
10.1109/ICCD.1991.139965
