skip to main content
10.1145/1120725.1120842acmconferencesArticle/Chapter ViewAbstractPublication PagesaspdacConference Proceedingsconference-collections
Article

Placement with symmetry constraints for analog layout design using TCG-S

Published:18 January 2005Publication History

ABSTRACT

In order to handle device matching for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis. In this paper, we deal with the module placement with symmetry constraints for analog design using the Transitive Closure Graph-Sequence (TCG-S) representation. Since the geometric relationships of modules are transparent to TCG-S and its induced operations, TCG-S has better flexibility than previous works in dealing with symmetry constraints. We first propose the necessary and sufficient conditions of TCG-S for symmetry modules. Then, we propose a polynomial-time packing algorithm for a TCG-S with symmetry constraints. Experimental results show that the TCG-S based algorithm results in the best area utilization.

References

  1. Y.-C. Chang, et al, "B*-trees: A New Representation for Non-Slicing Floorplans," Proc. DAC, pp. 458--463, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. F. Balasa and K. Lampaert, "Symmetry Within the Sequence-Pair Representation in the Context of Placement for Analog Design," IEEE TCAD, vol. 19, no. 7, 721--731, July 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. F. Balasa, "Modeling Non-Slicing Floorplans with Binary Trees," ICCAD, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. F. Balasa, et al, "Efficient solution space exploration based on segment trees in analog placement for analog placement with sysmetry constraints," ICCAD, pp. 497--502, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J. Cohn, et al, "KOAN/ANAGRAMII: New Tools for Device-Level Analog Layout," IEEE J. Solid-State Circuits, vol 26., PP. 330--342, Mar. 1991.Google ScholarGoogle ScholarCross RefCross Ref
  6. P.-N. Guo, et al, "An O-Tree Representation of Non-Slicing Floorplan and Its Applications," Proc. DAC, pp. 268--273, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. D. W. Jepsen and C. D. Gellat Jr., "Macro Placement by Monte Carlo Annealing," Proc. ICCD, pp. 495--485, Nov. 1983.Google ScholarGoogle Scholar
  8. S. Kirkpatrick, et al, "Optimization by Simulated Annealing," Science, vol. 220, no. 4598, May 13, 1983, pp. 671--680.Google ScholarGoogle ScholarCross RefCross Ref
  9. K. Lampaert, et al, "A Performance-Driven Placement Tool for Analog Integrated Circuits," IEEE J. Solid-State Circuits, vol. 30, pp. 773--780, July 1995.Google ScholarGoogle ScholarCross RefCross Ref
  10. E. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, and Winston, 1976.Google ScholarGoogle Scholar
  11. J.-M. Lin and Y.-W. Chang, "TCG-S: Orthogonal Coupling of P*-admissible Representations for General Floorplans," IEEE Trans. Computer-Aided Design, Vol. 24, No. 6, June 2004.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. E. Malavasi, et al, "Automation of IC Layout with Analog Constraints," IEEE TCAD, vol. 15, pp. 923--942, Aug. 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. H. Murata, et al, "Rectangle-Packing Based Module Placement," Proc. ICCAD, pp. 472--479, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Y. Pang, et al, "Block Placement with Symmetry Constraints based on thee O-tree Non-Slicing Representation," Proc. DAC, pp. 464--467, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    ASP-DAC '05: Proceedings of the 2005 Asia and South Pacific Design Automation Conference
    January 2005
    1495 pages
    ISBN:0780387376
    DOI:10.1145/1120725
    • General Chair:
    • Ting-Ao Tang

    Copyright © 2005 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 18 January 2005

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • Article

    Acceptance Rates

    Overall Acceptance Rate466of1,454submissions,32%

    Upcoming Conference

    ASPDAC '25

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader