An improved algorithm for sequence pair generation

Authors:
Mingxu Huo;Koubao Ding
Affiliations:
Dept. of Information and Electronic Engineering, Zhejiang University, Hangzhou, P.R. China;Dept. of Information and Electronic Engineering, Zhejiang University, Hangzhou, P.R. China
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Year:
2006

Citing 13
Cited 0

Branch-and-bound placement for building block layout

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Rectangle-packing-based module placement

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Introspective sorting and selection algorithms

Software—Practice & Experience
NRG: global and detailed placement

ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
An O-tree representation of non-slicing floorplan and its applications

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Incremental physical design

ISPD '00 Proceedings of the 2000 international symposium on Physical design
FAST-SP: a fast algorithm for block placement based on sequence pair

Proceedings of the 2001 Asia and South Pacific Design Automation Conference
TCG: a transitive closure graph-based representation for non-slicing floorplans

Proceedings of the 38th annual Design Automation Conference
TCG-S: orthogonal coupling of P*-admissible representations for general floorplans

Proceedings of the 39th annual Design Automation Conference
Automatic floorplan design

DAC '82 Proceedings of the 19th Design Automation Conference
Fixed-Outline Floorplanning through Better Local Search

ICCD '01 Proceedings of the International Conference on Computer Design: VLSI in Computers & Processors
A quick generation method of sequence pair for block placement

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Module packing based on the BSG-structure and IC layout applications

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

Quantified Score

Hi-index	0.01

Visualization

Abstract

Sequence Pair is an elegant representation for block placement of IC design, and the procedure to generate the SP from an existing placement is necessary in most cases. An improved generation algorithm is proposed instead of the existing methods that are either difficult or inefficient to be implemented. The algorithm simplifies the definition of relation between blocks and avoids employing complicated graph operations. The time complexity of the algorithm is O (n2) and can be reduced to O (n log n), where n is the number of blocks. The experimental results of the algorithm show its superiority in running time.