Area minimization for hierarchical floorplans

Authors:
Peichen Pan;Weiping Shi;C. L. Liu
Affiliations:
Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL;Department of Computer Science, University of North Texas, Denton, TX;Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Year:
1994

Citing 7
Cited 5

Optimal orientations of cells in slicing floorplan designs

Information and Control
Efficient floorplan area optimization

DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Combinatorial algorithms for integrated circuit layout

Combinatorial algorithms for integrated circuit layout
A new area and shape function estimation technique for VLSI layouts

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Area minimization for general floorplans

ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Automatic floorplan design

DAC '82 Proceedings of the 19th Design Automation Conference

Rectangle-packing-based module placement

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
An optimal algorithm for area minimization of slicing floorplans

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
A unified approach to topology generation and area optimization of general floorplans

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Hybrid floorplanning based on partial clustering and module restructuring

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
On the use of flexible, rectilinear blocks to obtain minimum-area floorplans in mixed block and cell designs

ACM Transactions on Design Automation of Electronic Systems (TODAES)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Two results are presented in this paper. First we settle the open problem on the complexity of the area minimization problem for hierarchical floorplans by showing it to be N P-complete. We then present a pseudo-polynomial area minimization algorithm for hierarchical floorplans of order-5. The algorithm is based on a new algorithm for determining the set of nonredundant realizations of a wheel. The new algorithm for wheels has time cost O(k2logk) and space cost O(k2) if each of the (five) blocks in a wheel has at mostkrealizations—a reduction by a factor of k in both costs in comparison with previous algorithms. The area minimization algorithm was implemented. Our experimental results show that the algorithm is indeed very fast.