skip to main content
10.1145/3394885.3431545acmconferencesArticle/Chapter ViewAbstractPublication PagesaspdacConference Proceedingsconference-collections
research-article

Layout Symmetry Annotation for Analog Circuits with Graph Neural Networks

Published:29 January 2021Publication History

ABSTRACT

The performance of analog circuits is susceptible to various layout constraints, such as symmetry, matching, etc. Modern analog placement and routing algorithms usually need to take these constraints as input for high quality solutions, while manually annotating such constraints is tedious and requires design expertise. Thus, automatic constraint annotation from circuit netlists is a critical step to analog layout automation. In this work, we propose a graph learning based framework to learn the general rules for annotation of the symmetry constraints with path-based feature extraction and label filtering techniques. Experimental results on the open-source analog circuit designs demonstrate that our framework is able to achieve significantly higher accuracy compared with the most recent works on symmetry constraint detection leveraging graph similarity and signal flow analysis techniques. The framework is general and can be extended to other pairwise constraints as well.

References

  1. B. Razavi, Design of Analog CMOS Integrated Circuits, 1st ed. New York, NY, USA: McGraw-Hill, Inc., 2001.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. K. Kunal, M. Madhusudan, A. K. Sharma, W. Xu, S. M. Burns, R. Harjani, J. Hu, D. A. Kirkpatrick, and S. S. Sapatnekar, "Align: Open-source analog layout automation from the ground up," in Proc. DAC, 2019, pp. 1--4.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. B. Xu, K. Zhu, M. Liu, Y. Lin, S. Li, X. Tang, N. Sun, and D. Z. Pan, "Magical:Toward fully automated analog ic layout leveraging human and machine intelligence," in Proc. ICCAD. IEEE, 2019, pp. 1--8.Google ScholarGoogle Scholar
  4. "DARPA IDEA program," https://www.darpa.mil/attachments/eri_design_proposers_day.pdf.Google ScholarGoogle Scholar
  5. K. Kunal, T. Dhar, M. Madhusudan, J. Poojary, A. Sharma, W. Xu, S. M. Burns, J. Hu, R. Harjani, and S. S. Sapatnekar, "GANA: Graph convolutional network based automated netlist annotation for analog circuits," in Proc. DATE, 2020.Google ScholarGoogle Scholar
  6. E. Charbon, E. Malavasi, and A. Sangiovanni-Vincentelli, "Generalized constraint generation for analog circuit design," in Proc. ICCAD, Nov 1993, pp. 408--414.Google ScholarGoogle Scholar
  7. M. Eick, M. Strasser, K. Lu, U. Schlichtmann, and H. E. Graeb, "Comprehensive generation of hierarchical placement rules for analog integrated circuits," IEEE TCAD, vol. 30, no. 2, pp. 180--193, Feb 2011.Google ScholarGoogle Scholar
  8. Q. Hao, S. Dong, S. Chen, X. Hong, Y. Su, and Z. Qu, "Constraints generation for analog circuits layout," in ICCCAS, vol. 2, June 2004, pp. 1339--1343 Vol.2.Google ScholarGoogle Scholar
  9. Z. Zhou, S. Dong, X. Hong, Q. Hao, and S. Chen, "Analog constraints extraction based on the signal flow analysis," in Proc. ASICON, vol. 2, Oct 2005, pp. 825--828.Google ScholarGoogle Scholar
  10. P. Wu, M. P. Lin, and T. Ho, "Analog layout synthesis with knowledge mining," in Proc. ECCTD, Aug 2015, pp. 1--4.Google ScholarGoogle Scholar
  11. M. Liu, W. Li, K. Zhu, B. Xu, Y. Lin, L. Shen, X. Tang, N. Sun, and D. Z. Pan, "S3DET: Detecting system symmetry constraints for analog circuits with graph similarity," in Proc. ASPDAC. IEEE, 2020, pp. 193--198.Google ScholarGoogle Scholar
  12. T. Massier, H. Graeb, and U. Schlichtmann, "The sizing rules method for cmos and bipolar analog integrated circuit synthesis," IEEE TCAD, vol. 27, no. 12, pp. 2209--2222, Dec 2008.Google ScholarGoogle Scholar
  13. R. Harjani, R. A. Rutenbar, and L. R. Carley, "A prototype framework for knowledge-based analog circuit synthesis," in Proc. DAC, 1987, pp. 42--49.Google ScholarGoogle Scholar
  14. T. Massier, H. Graeb, and U. Schlichtmann, "The sizing rules method for cmos and bipolar analog integrated circuit synthesis," IEEE TCAD, vol. 27, no. 12, pp. 2209--2222, 2008.Google ScholarGoogle Scholar
  15. M. Defferrard, X. Bresson, and P. Vandergheynst, "Convolutional neural networks on graphs with fast localized spectral filtering," in Proc. NeurIPS, 2016, pp. 3844--3852.Google ScholarGoogle Scholar
  16. T. N. Kipf and M. Welling, "Semi-supervised classification with graph convolutional networks," arXiv preprint arXiv:1609.02907, 2016.Google ScholarGoogle Scholar
  17. W. Hamilton, Z. Ying, and J. Leskovec, "Inductive representation learning on large graphs," in Proc. NeurIPS, 2017, pp. 1024--1034.Google ScholarGoogle Scholar
  18. A. v. d. Oord, Y. Li, and O. Vinyals, "Representation learning with contrastive predictive coding," arXiv preprint arXiv:1807.03748, 2018.Google ScholarGoogle Scholar
  19. P. Veličković, W. Fedus, W. L. Hamilton, P. Liò, Y. Bengio, and R. D. Hjelm, "Deep graph infomax," arXiv preprint arXiv:1809.10341, 2018.Google ScholarGoogle Scholar

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
    ASPDAC '21: Proceedings of the 26th Asia and South Pacific Design Automation Conference
    January 2021
    930 pages
    ISBN:9781450379991
    DOI:10.1145/3394885

    Copyright © 2021 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: 29 January 2021

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article
    • Research
    • Refereed limited

    Acceptance Rates

    ASPDAC '21 Paper Acceptance Rate111of368submissions,30%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