A quick generation method of sequence pair for block placement

Abstract

Sequence Pair (SP) is an elegant representation for the block placement of IC Design, and it is usually imperative to generate the SP from an existing placement. A quick generation method and one concise algorithm are proposed instead of the original unfeasible one. It is also shown that if the relations of any two blocks are either vertical or horizontal, the solution space size of a representation is (n!)2 if it is P*-admissible. The analytical and experimental results of the algorithm both show its superiority in running time. © Springer-Verlag Berlin Heidelberg 2005.