An improved algorithm for sequence pair generation

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 (n 2) 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. © Springer-Verlag Berlin Heidelberg 2006.