{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T19:24:48Z","timestamp":1770751488216,"version":"3.50.0"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"3","funder":[{"name":"European Research Council"},{"name":"European Union\u2019s Horizon 2020","award":["101019982"],"award-info":[{"award-number":["101019982"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2026,5,31]]},"abstract":"<jats:p>Achieving efficient and effective automation in hierarchical analog\/mixed-signal (AMS) integrated circuit layout synthesis remains a significant challenge in the electronic design automation domain, due to the vast design space and diverse layout requirements. The state-of-the-art AMS layout automation tools, like ALIGN and MAGICAL-EDA, utilize constraints extracted by designers to address this challenge. This constraint extraction is, however, a problem on its own when the number of constraints gets larger and the designs become more complicated. Recently, graph neural network (GNN)-based methods have been explored to extract inter-symmetry constraints in analog circuits, although with limited accuracy and applicability for other constraint types on hierarchical AMS circuits. In this article, we propose a generalized constraint learning and transfer (CLT) framework that can address a generalized, wider range of constraints and offers a more accurate and robust CLT methodology for hierarchical AMS circuit layout synthesis. A generate-and-aggregate approach enhanced by net-first GNN (Nest-GNN) and selective topological search (SelecTS) algorithms is introduced to accurately and efficiently learn and transfer to a more generalized range of constraint, including symmetry, impedance matching, and grouping for both placement and routing (P&amp;R). This framework is the first one, to the best of our knowledge, to transfer constraint types such as grouping and impedance matching, for P&amp;R on hierarchical AMS circuits. Tested on hierarchical AMS circuits with up to 25 hierarchies, over 1,000 devices, and more than 500 nets, our framework achieves an average CLT F1 score of over 0.98 for all constraint types in an efficient way, outperforming the state-of-the-art CLT methods.<\/jats:p>","DOI":"10.1145\/3722556","type":"journal-article","created":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T06:44:41Z","timestamp":1741416281000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Generalized Constraint Learning and Transfer Methodology with Net-First Graph Neural Network and Selective Topological Search for Hierarchical Analog \/ Mixed-Signal Circuit Layout Synthesis"],"prefix":"10.1145","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8437-2594","authenticated-orcid":false,"given":"Kaichang","family":"Chen","sequence":"first","affiliation":[{"name":"ESAT-MICAS, KU Leuven","place":["Leuven, Belgium"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4061-9428","authenticated-orcid":false,"given":"Georges","family":"Gielen","sequence":"additional","affiliation":[{"name":"ESAT-MICAS, KU Leuven","place":["Leuven, Belgium"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,2,10]]},"reference":[{"key":"e_1_3_2_2_2","volume-title":"Handbook of Algorithms for Physical Design Automation","author":"Alpert Charles J.","year":"2009","unstructured":"Charles J. Alpert, Dinesh P. Mehta, and Sachin S. Sapatnekar (Eds.). 2009. Handbook of Algorithms for Physical Design Automation. CRC Press."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2024.3373553"},{"key":"e_1_3_2_4_2","volume-title":"CMOS: Circuit Design, Layout, and Simulation (4th ed.)","author":"Baker R. Jacob","year":"2019","unstructured":"R. Jacob Baker. 2019. CMOS: Circuit Design, Layout, and Simulation (4th ed.). Wiley-IEEE Press, Hoboken, NJ."},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.08.001"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/MDAT.2020.3024153"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3400302.3415660"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586211"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.23919\/DATE58400.2024.10546850"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/123186.123403"},{"key":"e_1_3_2_11_2","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"32","author":"Luc Passerini Andrea De Raedt,","year":"2018","unstructured":"Passerini Andrea De Raedt, Luc and Stefano Teso. 2018. Learning constraints from examples. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 32."},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICECS58634.2023.10382859"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/SMACD.2012.6339402"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/1735023.1735039"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394885.3431545"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/ESSDER.2006.307632"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/MLCAD58807.2023.10299830"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/5.899053"},{"key":"e_1_3_2_19_2","first-page":"1024","volume-title":"Advances in Neural Information Processing Systems","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Advances in Neural Information Processing Systems. 1024\u20131034."},{"key":"e_1_3_2_20_2","volume-title":"The Art of Analog Layout","author":"Hastings Alan","year":"2005","unstructured":"Alan Hastings. 2005. The Art of Analog Layout. Pearson Education."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3451179"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-96415-3"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASP-DAC58780.2024.10473957"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3323471"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3400302.3415685"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3670474.3685958"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.5555\/1457474"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3182169"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2008.4484055"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASP-DAC47756.2020.9045109"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASP-DAC58780.2024.10473840"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/43.511572"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3649329.3656232"},{"key":"e_1_3_2_34_2","volume-title":"Analog Design Essentials","author":"Sansen Willy","year":"2006","unstructured":"Willy Sansen. 2006. Analog Design Essentials. Springer, Dordrecht, The Netherlands."},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3626184.3635288"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/2717764.2717781"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-007-1926-2"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543853"},{"key":"e_1_3_2_39_2","volume-title":"Proceedings of AAAI 2023 Bridge on Constraint Programming and Machine Learning (CPML\u201923)","author":"Tsouros Dimosthenis C.","year":"2023","unstructured":"Dimosthenis C. Tsouros, Tias Guns, and Kostas Stergiou. 2023. Learning constraint models from data. In Proceedings of AAAI 2023 Bridge on Constraint Programming and Machine Learning (CPML\u201923)."},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/43.945301"},{"key":"e_1_3_2_41_2","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Veli\u010dkovi\u0107 Petar","year":"2018","unstructured":"Petar Veli\u010dkovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li\u00f2, and Yoshua Bengio. 2018. Graph attention networks. In Proceedings of the International Conference on Learning Representations."},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED60706.2024.10528749"},{"key":"e_1_3_2_43_2","volume-title":"Layout Automation for Analog and Mixed-Signal Integrated Circuits","author":"Xu Biying","year":"2019","unstructured":"Biying Xu. 2019. Layout Automation for Analog and Mixed-Signal Integrated Circuits. University of Texas at Austin."},{"key":"e_1_3_2_44_2","volume-title":"Proceedings of the International Conference on Learning Representations (ICLR\u201919)","author":"Xu Keyulu","year":"2019","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2019. How powerful are graph neural networks? In Proceedings of the International Conference on Learning Representations (ICLR\u201919)."},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASP-DAC58780.2024.10473859"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2024.3391187"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISEDA59274.2023.10218680"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.2009137"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330961"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.23919\/DATE58400.2024.10546542"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASP-DAC52403.2022.9712488"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/3508352.3549384"},{"key":"e_1_3_2_53_2","first-page":"18795","article-title":"AdaBelief optimizer: Adapting stepsizes by the belief in observed gradients","volume":"33","author":"Zhuang Juntang","year":"2020","unstructured":"Juntang Zhuang, Tommy Tang, Yifan Ding, Sekhar Tatikonda, Nicha Dvornek, Xenophon Papademetris, and James S. Duncan. 2020. AdaBelief optimizer: Adapting stepsizes by the belief in observed gradients. Advances in Neural Information Processing Systems 33 (2020), 18795\u201318806.","journal-title":"Advances in Neural Information Processing Systems"}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3722556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T13:55:34Z","timestamp":1770731734000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3722556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,10]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,5,31]]}},"alternative-id":["10.1145\/3722556"],"URL":"https:\/\/doi.org\/10.1145\/3722556","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"value":"1084-4309","type":"print"},{"value":"1557-7309","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,10]]},"assertion":[{"value":"2024-09-03","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-27","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}