An enhanced pertubing algorithm for floorplan design using the O-tree representation

Authors:
Y. Pang;C.-K. Cheng;T. Yoshimura
Affiliations:
-;-;-
Venue:
ICCAD '00 Proceedings of the 2000 international conference on Computer-aided design
Year:
2001

Citing 0
Cited 1

Fixed-outline floorplanning based on common subsequence

GLSVLSI '05 Proceedings of the 15th ACM Great Lakes symposium on VLSI

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, a deterministic algorithm based on the O-tree representation has been proposed. This method generates excellent layout results on MCNC test cases with O(n3) complexity, where n is the number of blocks. In this paper, we reduce the complexity of the deterministic algorithm to O(n2). Experimental results indicate our algorithm maintains the high quality of the deterministic algorithm at a fraction of the CPU time.