skip to main content
research-article

Wire Load Oriented Analog Routing with Matching Constraints

Authors Info & Claims
Published:25 August 2020Publication History
Skip Abstract Section

Abstract

As design complexity is increased exponentially, electronic design automation (EDA) tools are essential to reduce design efforts. However, the analog layout design has still been done manually for decades because it is a sensitive and error-prone task. Tool-generated layouts are still not well-accepted by analog designers due to the performance loss under non-ideal effects. Most previous works focus on adding more layout constraints on the analog placement. Routing the nets is thus considered as a trivial step that can be done by typical digital routing methodology, which is to use vias to connect every horizontal and vertical lines. Those extra vias will significantly increase the wire loads and degrade the circuit performance. Therefore, in this article, a wire load oriented analog routing methodology is proposed to reduce the number of layer changing of each routing net. Wire load is considered in the optimization goal as well as the wire length to keep the circuit performance after layout, while the analog layout constraints like symmetry and length matching are still satisfied during routing. As shown in the experimental results, this approach significantly reduces the wire load and performance loss after layout with little overhead on wire length.

References

  1. C.-C. Chang and J. J. S. Cong. 1999. An efficient approach to multilayer layer assignment with an application to via minimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 18, 5 (May 1999), 605--620.Google ScholarGoogle Scholar
  2. H.-Y. Chi, H.-Y. Tseng, C.-N. Jimmy Liu, and H.-M. Chen. 2018. Performance-preserved analog routing methodology via wire load reduction. In IEEE/ACM Proceedings of Asia and South Pacific Design Automation Conference.Google ScholarGoogle ScholarCross RefCross Ref
  3. P.-Y. Chou, H.-C. Ou, and Y.-W. Chang. 2011. Heterogeneous b*-trees for analog placement with symmetry and regularity considerations. In IEEE/ACM Proceedings of International Conference on Computer-Aided Design. 512--516.Google ScholarGoogle Scholar
  4. C. Chu and Y.-C. Wong. 2008. FLUTE: Fast lookup table based rectilinear steiner minimal tree algorithm for VLSI design. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 27, 1 (Jan 2008), 70--83.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J. M. Cohn, D. J. Garrod, R. A. Rutenbar, and L. R. Carley. 1991. KOAN/ANAGRAM II: New tools for device-level analog placement and routing. IEEE Journal of Solid-State Circuits 26, 3 (Mar 1991), 330--342.Google ScholarGoogle ScholarCross RefCross Ref
  6. C. Du, Y. Cai, and X. Hong. 2006. A novel analog routing algorithm with constraints of variable wire widths. In IEEE Proceedings of International Conference on Communications, Circuits and Systems.Google ScholarGoogle Scholar
  7. Q. Gao, H. Yao, Q. Zhou, and Y. Cai. 2011. A novel detailed routing algorithm with exact matching constraint for analog and mixed signal circuits. In IEEE Proceedings of International Symposium on Quality Electronic Design.Google ScholarGoogle Scholar
  8. H. E. Graeb. 2010. Analog Layout Synthesis: A Survey of Topological Approaches. Springer, Berlin.Google ScholarGoogle Scholar
  9. M.-K. Hsu, S. Chou, T.-H. Lin, and Y.-W. Chang. 2011. Routability-driven analytical placement for mixed-size circuit designs. In IEEE/ACM Proceedings of International Conference on Computer-Aided Design. 6.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Lee. 1961. An algorithm for path connection and its application. IRE Transactions on Electronic Computer (1961).Google ScholarGoogle Scholar
  11. C.-W. Lin, C.-C. Lu, J.-M. Lin, and S.-J. Chang. 2012. Routability-driven placement algorithm for analog integrated circuits. In ACM Proceedings of International Symposium on Physical Design. 71--78.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. P.-H. Lin, Y.-W. Chang, and S.-C. Lin. 2009. Analog placement based on symmetry-island formulation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 28, 6 (Jun 2009), 791--804.Google ScholarGoogle Scholar
  13. E. Malavasi, E. Charbon, E. Felt, and A. S.-Vincentelli. 1996. Automation of IC layout with analog constraints. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15, 8 (Aug 1996), 1186--1197.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. E. Malavasi, M. Chilanti, and R. Guerrieri. 1989. A general router for analog layout. In IEEE Proceedings of CompEuro Computers in Design Manufacturing and Production.Google ScholarGoogle Scholar
  15. E. Malavasi and A. S.-Vincentelli. 1993. Area routing for analog layout. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 12, 8 (Aug 1993), 1186--1197.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. H.-C. Ou, H.-C. C. Chien, and Y.-W. Chang. 2012. Non-uniform multilevel analog routing with matching constraints. In IEEE/ACM Proceedings of Design Automation Conference. 549--554.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. M. Ozdal and R. Hentschke. 2014. Algorithms for maze routing with exact matching constraints. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 33, 1 (Jan 2014), 101--112.Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. A. Patyal, P.-C. Pan, A. K A, H.-M. Chen, H.-Y. Chi, and C.-N. Jimmy Liu. 2018. Analog placement with current flow and symmetry constraints using PCP-CP. In IEEE/ACM Proceedings of Design Automation Conference.Google ScholarGoogle Scholar
  19. R. A. Rutenbar, G. G. E. Gielen, and J. Roychowdhury. 2007. Hierarchical modeling, optimization, and synthesis for system-level analog and RF designs. In IEEE Proceedings of IEEE. 640--669.Google ScholarGoogle Scholar
  20. K. Sajid, J. D. Carothers, J. J. Rodriguez, and W. T. Holman. 2001. Global routing methodology for analog and mixed-signal layout. In IEEE Proceedings of ASIC/SOC.Google ScholarGoogle Scholar
  21. M. Torabi and L. Zhang. 2018. Electromigration- and parasitic-aware ILP-based analog router. IEEE Transactions on Very Large Scale Integration (VLSI) System 26, 10 (June 2018), 1854--1867.Google ScholarGoogle ScholarCross RefCross Ref
  22. Y.-P. Weng, H.-M. Chen, T.-C. Chen, P.-C. Pan, C.-H. Chen, and W.-Z. Chen. 2011. Fast analog layout prototyping for nanometer design migration. In IEEE/ACM Proceedings of International Conference on Computer-Aided Design. 517--522.Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. C.-Y. Wu, H. Graeb, and J. Hu. 2015. A pre-search assisted ILP approach to analog integrated circuit routing. In IEEE/ACM Proceedings of International Conference on Computer Design.Google ScholarGoogle Scholar
  24. L. Xiao, E. F.-Y. Young, X. He, and K.-P. Pun. 2010. Practical placement and routing techniques for analog circuit designs. In IEEE/ACM Proceedings of International Conference on Computer-Aided Design. 675--679.Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. H. Yao, Y. Cai, and Q. Gao. 2012. LEMAR: A novel length matching routing algorithm for analog and mixed signal circuits. In IEEE/ACM Proceedings of Asia and South Pacific Design Automation Conference. 157--162.Google ScholarGoogle Scholar
  26. L. Zhang, U. Kleine, and Y. Jiang. 2006. An automated design tool for analog layouts. IEEE Transactions on Very Large Scale Integration Systems 14, 8 (Aug 2006), 881--894.Google ScholarGoogle Scholar
  27. V. M. zu Bexten, C. Moraga, R. Klinke, W. Brockherde, and K.-G. Hess. 1993. ALSYN: Flexible rule-based layout synthesis for analog ICs. IEEE Journal of Solid-State Circuits 28, 3 (Mar 1993), 261--168.Google ScholarGoogle Scholar

Index Terms

  1. Wire Load Oriented Analog Routing with Matching Constraints

    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

    Full Access

    • Published in

      cover image ACM Transactions on Design Automation of Electronic Systems
      ACM Transactions on Design Automation of Electronic Systems  Volume 25, Issue 6
      November 2020
      164 pages
      ISSN:1084-4309
      EISSN:1557-7309
      DOI:10.1145/3417499
      Issue’s Table of Contents

      Copyright © 2020 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: 25 August 2020
      • Revised: 1 May 2020
      • Accepted: 1 May 2020
      • Received: 1 October 2019
      Published in todaes Volume 25, Issue 6

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format .

    View HTML Format