DocumentCode :
2655564
Title :
An optimal algorithm for spiral floorplan designs
Author :
Chen, Cheng-Hsi ; Tollis, Ioannis G.
Author_Institution :
Dept. of Comput. Sci., Texas Univ. at Dallas, Richardson, TX, USA
fYear :
1991
fDate :
14-16 Oct 1991
Firstpage :
516
Lastpage :
519
Abstract :
An improved algorithm for solving the area optimization problem of spiral floorplans is presented. Each of the five basic rectangles of a spiral floorplan have O(n) implementations. The algorithm takes O(n2logn) time, and requires O(n2) space to solve the area optimization problem. The best previously known algorithm solved the problem in O(n3logn) time and O(n3) space
Keywords :
VLSI; circuit layout CAD; computational complexity; VLSI layout; area optimization; optimal algorithm; spiral floorplan designs; Algorithm design and analysis; Computer science; Design optimization; Optimization methods; Partitioning algorithms; Polynomials; Process design; Spirals; Very large scale integration;
fLanguage :
English
Publisher :
ieee
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
Type :
conf
DOI :
10.1109/ICCD.1991.139962
Filename :
139962
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2655564
بازگشت