Floorplan representations: Complexity and connections

Authors:
Bo Yao;Hongyu Chen;Chung-Kuan Cheng;Ronald Graham
Affiliations:
University of California, San Diego, La Jolla, CA;University of California, San Diego, La Jolla, CA;University of California, San Diego, La Jolla, CA;University of California, San Diego, La Jolla, CA
Venue:
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Year:
2003

Citing 11
Cited 14

Rectangle-packing-based module placement

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Baxter permutations

Proceedings of the 7th conference on Formal power series and algebraic combinatorics
An O-tree representation of non-slicing floorplan and its applications

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
What is a floorplan?

ISPD '00 Proceedings of the 2000 international symposium on Physical design
B*-Trees: a new representation for non-slicing floorplans

Proceedings of the 37th Annual Design Automation Conference
FAST-SP: a fast algorithm for block placement based on sequence pair

Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Corner block list: an effective and efficient topological representation of non-slicing floorplan

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
The genealogical approach to the layout problem

DAC '80 Proceedings of the 17th Design Automation Conference
Automatic floorplan design

DAC '82 Proceedings of the 19th Design Automation Conference
Module packing based on the BSG-structure and IC layout applications

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

On the number of rectangular partitions

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Practical slicing and non-slicing block-packing without simulated annealing

Proceedings of the 14th ACM Great Lakes symposium on VLSI
Are floorplan representations important in digital design?

Proceedings of the 2005 international symposium on Physical design
The number of guillotine partitions in d dimensions

Information Processing Letters
A bijection between permutations and floorplans, and its applications

Discrete Applied Mathematics
On the number of rectangulations of a planar point set

Journal of Combinatorial Theory Series A
3-D floorplanning using labeled tree and dual sequences

Proceedings of the 2008 international symposium on Physical design
Constraint-driven floorplan repair

ACM Transactions on Design Automation of Electronic Systems (TODAES)
A (4n - 4)-Bit Representation of a Rectangular Drawing or Floorplan

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
The number of guillotine partitions in d dimensions

Information Processing Letters
The Hopf algebra of diagonal rectangulations

Journal of Combinatorial Theory Series A
An upper bound on the number of rectangulations of a point set

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Generic rectangulations

European Journal of Combinatorics
Optimal binary representation of mosaic floorplans and baxter permutations

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Floorplan representation is a fundamental issue in designing a floorplanning algorithm. In this paper, we first present a twin binary trees structure for mosaic floorplans. It is a nonredundant representation. We then derive the exact number of configurations for mosaic floorplans and slicing floorplans. Finally, the relationships between various state-of-the-art floorplan representations are discussed and explored.