Advertisement

An Improved Algorithm for Sequence Pair Generation

  • Mingxu Huo
  • Koubao Ding
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3991)

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.

Keywords

Time Complexity Sequence Pair Improve Algorithm Admissible Representation Integrate Circuit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Goto, S.: An efficient algorithm for the two-dimensional placement problem in electrical circuit layout. IEEE Trans. On Circuits and Systems 28(1), 12–18 (1998)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Murata, H., et al.: Rectangle-packing-based module placement. In: 1995 IEEE/ACM ICCAD. Digest of Technical Papers, pp. 472–479 (1995)Google Scholar
  3. 3.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: optimization by simulated annealing. Science 220(4598), 671–680 (1983)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Otten, R.H.J.M.: Automatic floorplan design. In: ACM IEEE 9th DAC Proceedings, pp. 261–267 (1982)Google Scholar
  5. 5.
    Hong, X.L., et al.: A non-slicing floorplanning algorithm using corner block list topological representation. In: 2000 IEEE Asia-Pacific Conference On Circuits And Systems - Electronic Communication Systems, pp. 833–836 (2000)Google Scholar
  6. 6.
    Pei-Ning, G., Chung-Kuan, C., Yoshimura, T.: An O-tree representation of non-slicing floorplan and its applications. In: Proceedings 1999 DAC, pp. 268–273 (1999)Google Scholar
  7. 7.
    Nakatake, S., et al.: Module packing based on the BSG-structure and IC layout applications. IEEE TCAD Of Integrated Circuits And Systems 17(6), 519–530 (1998)CrossRefGoogle Scholar
  8. 8.
    Jai-Ming, L., Yao-Wen, C.: TCG: a transitive closure graph-based representation for non-slicing floorplans. In: Proceedings of the 38th DAC, pp. 764–769 (2001)Google Scholar
  9. 9.
    Lin, J.M., Chang, Y.W.: TCG-S: Orthogonal coupling of P*-admissible representations for general floorplans. In: 39th DAC, Proceedings, pp. 842–847 (2002)Google Scholar
  10. 10.
    Sarrafzadeh, M., Wang, M.: NRG: Global and detailed placement. In: Proc. IEEE ICCAD, pp. 532–537 (1997)Google Scholar
  11. 11.
    Quinn, N., Breuer, M.: A force-directed component placement procedure for printed circuit boards. IEEE Trans. CAS CAS-26(6), 377–388 (1979)MATHCrossRefGoogle Scholar
  12. 12.
    Cong, J., Sarrafzadeh, M.: Incremental physical design. In: Proceedings International Symposium on Physical Design, ISPD-2000, pp. 84–92 (2000)Google Scholar
  13. 13.
    Adya, S.N., Markov, I.L.: Fixed-outline floorplanning through better local search. In: Proceedings 2001 IEEE ICCD: VLSI in Computers and Processors, pp. 328–334 (2001)Google Scholar
  14. 14.
    Huo, M.X., Ding, K.B.: A quick generation method of sequence pair for block placement. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2005. LNCS, vol. 3516, pp. 954–957. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  15. 15.
    Kodama, C., Fujiyoshi, K., Koga, T.: A novel encoding method into sequence-pair. In: Proceedings ISCAS 2004, vol. (5), pp. 329–332 (2004)Google Scholar
  16. 16.
    Onodera, H., Taniguchi, Y., Tamaru, K.: Branch-and-bound placement for building block layout. In: 28th ACM/IEEE DAC. Proceedings 1991, pp. 433–439 (1991)Google Scholar
  17. 17.
    Murata, H., et al.: A mapping from sequence-pair to rectangular dissection. In: Proceedings of the ASP-DAC 1997, pp. 625–633 (1997)Google Scholar
  18. 18.
    Xiaoping, T., Wong, D.F.: FAST-SP: a fast algorithm for block placement based on sequence pair. In: Proceedings of the ASP-DAC 2001, pp. 521–526 (2001)Google Scholar
  19. 19.
    Musser, D.R.: Introspective Sorting and Selection Algorithms. Software Practice and Experience 27(8), 983 (1997)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Mingxu Huo
    • 1
  • Koubao Ding
    • 1
  1. 1.Dept. of Information and Electronic EngineeringZhejiang UniversityHangzhouP.R. China

Personalised recommendations