A fast algorithm for rectilinear block packing based on selected sequence-pair

Authors:
Kunihiro Fujiyoshi;Chikaaki Kodama;Akira Ikeda
Affiliations:
Department of Electrical and Electronic Engineering, Tokyo University of Agriculture and Technology, Tokyo 184-8588, Japan;Department of Electrical and Electronic Engineering, Tokyo University of Agriculture and Technology, Tokyo 184-8588, Japan;Department of Electrical and Electronic Engineering, Tokyo University of Agriculture and Technology, Tokyo 184-8588, Japan
Venue:
Integration, the VLSI Journal
Year:
2007

Citing 12
Cited 2

Rectilinear block placement using sequence-pair

ISPD '98 Proceedings of the 1998 international symposium on Physical design
Topology constrained rectilinear block packing for layout reuse

ISPD '98 Proceedings of the 1998 international symposium on Physical design
Arbitrary rectilinear block packing based on sequence pair

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
B*-Trees: a new representation for non-slicing floorplans

Proceedings of the 37th Annual Design Automation Conference
Rectilinear block packing using O-tree representation

Proceedings of the 2001 international symposium on Physical design
Floorplanning with abutment constraints and L-shpaed/T-shaped blocks baed on corner block list

Proceedings of the 38th annual Design Automation Conference
VISI Physical Design Automation: Theory and Practice

VISI Physical Design Automation: Theory and Practice
Arbitrary Convex and Concave Rectilinear Module Packing Using TCG

Proceedings of the conference on Design, automation and test in Europe
On handling arbitrary rectilinear shape constraint

Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Selected sequence-pair: an efficient decodable packing representation in linear time using sequence-pair

ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
VLSI module placement based on rectangle-packing by the sequence-pair

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Fast evaluation of sequence pair in block placement by longest common subsequence computation

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

An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem

Computers and Operations Research
Hybrid algorithm for floorplanning using B*-tree representation

IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we present a method of rectilinear block packing using selected sequence-pair (SSP), a rectangle packing representation. We also propose a fast algorithm to obtain a rectilinear block packing in O((p+1)n) time keeping all the constraints imposed by a given SSP. Here, p is the number of rectilinear blocks excluding rectangles and n is that of rectangle sub-blocks obtained by partitioning each rectilinear block. So far, the fastest method based on a sequence-pair required O(n^2+@?^3) time, where @? is the number of rectilinear blocks. If p is constant, the proposed algorithm requires O(n) time, which is equal to the trivial lower bound of the time complexity for decoding. The effectiveness of the proposed method was confirmed by the experimental comparisons, especially when p is constant.