Advertisement
Published in:
2006 | OriginalPaper | Chapter
An Improved Algorithm for Sequence Pair Generation
Authors : Mingxu Huo, Koubao Ding
Published in: Computational Science – ICCS 2006
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.