Twin binary sequences: a nonredundant representation for general nonslicing floorplan

Twin binary sequences: a nonredundant representation for general nonslicing floorplan

The efficiency and effectiveness of many floorplanning methods depend very much on the representation of the geometrical relationship between the modules. A good representation can shorten the searching process so that more accurate estimations on area and interconnect costs can be performed. Nonsli...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computer-aided design of integrated circuits and systems 2003-04, Vol.22 (4), p.457-469
Main Authors: Young, E.F.Y., Chu, C.C.N., Shen, Z.C.
Format: Article
Language:eng
Subjects:
Binary sequences
Circuit optimization
Computer science
Costs
Delay
Design engineering
Design optimization
Floorplans
Insertion
Inserts
Integrated circuit interconnections
Minimization
Modules
Mosaics
Representations
Shape
Solution space
Studies
Very large scale integration
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The efficiency and effectiveness of many floorplanning methods depend very much on the representation of the geometrical relationship between the modules. A good representation can shorten the searching process so that more accurate estimations on area and interconnect costs can be performed. Nonslicing floorplan is the most general kind of floorplan that is commonly used. Unfortunately, there is not yet any complete and nonredundant topological representation for nonslicing structure. In this paper, we propose the first representation of this kind. Like some previous work (Zhou et al. 2001), we have also made use of a mosaic floorplan as an intermediate step. However, instead of including a more than sufficient number of extra dummy blocks in the set of modules (that will increase the size of the solution space significantly), our representation allows us to insert an exact number of irreducible empty rooms to a mosaic floorplan such that every nonslicing floorplan can be obtained uniquely from one and only one mosaic floorplan. The size of the solution space is only O(n!2/sup 3n//n/sup 1.5/), which is the size without empty room insertion, but every nonslicing floorplan can be generated uniquely and efficiently in linear time without any redundant representation.
ISSN:0278-0070
1937-4151