{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:19:30Z","timestamp":1775067570846,"version":"3.50.1"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T00:00:00Z","timestamp":1678060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62090025"],"award-info":[{"award-number":["62090025"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2023,3,31]]},"abstract":"<jats:p>Designing high-performance adders and multiplier components for diverse specifications and constraints is of practical concern. However, selecting the best architecture for adder or multiplier, which largely affects the performance of synthesized circuits, is difficult. To tackle this difficulty, a machine-learning-driven approach is proposed for automatic architectural selection of adders and multipliers. It trains a machine learning model for classification through learning a number of existing design schemes and their performance data. Experimental results show that the proposed approach based on a multi-perception neural network achieves as high as 94% prediction accuracy with negligible inference time. On a CPU server, the proposed approach runs about 4\u00d7 faster than a brute-force approach trying four candidate architectures and consumes 10%~20% less runtime than the DesignWare datapath generator for obtaining the optimal adder\/multiplier circuit. The adder (multiplier) generated with the proposed approach achieves performance metrics close to the optimal and has 1.6% (5.2%) less area and 2.2% (7.1%) more worst negative slack averagely than that generated with the DesignWare datapath generator. Our experiment also shows that the proposed approach is not sensitive to the size of training subset.<\/jats:p>","DOI":"10.1145\/3560712","type":"journal-article","created":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T11:52:55Z","timestamp":1662465175000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Machine-learning-driven Architectural Selection of Adders and Multipliers in Logic Synthesis"],"prefix":"10.1145","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3421-1872","authenticated-orcid":false,"given":"Jiawen","family":"Cheng","sequence":"first","affiliation":[{"name":"Tsinghua University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8565-4457","authenticated-orcid":false,"given":"Yong","family":"Xiao","sequence":"additional","affiliation":[{"name":"Giga Design Automation Co., Ltd., Shenzhen, Guangdong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4414-3519","authenticated-orcid":false,"given":"Yun","family":"Shao","sequence":"additional","affiliation":[{"name":"Giga Design Automation Co., Ltd., Shenzhen, Guangdong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0859-9519","authenticated-orcid":false,"given":"Guanghai","family":"Dong","sequence":"additional","affiliation":[{"name":"Giga Design Automation Co., Ltd., Shenzhen, Guangdong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6036-7531","authenticated-orcid":false,"given":"Songlin","family":"Lyu","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4897-7251","authenticated-orcid":false,"given":"Wenjian","family":"Yu","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}]}],"member":"320","published-online":{"date-parts":[[2023,3,6]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1973.223648"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1093\/qjmam\/4.2.236"},{"key":"e_1_3_1_4_2","volume-title":"Classification and Regression Trees","author":"Breiman Leo","year":"1984","unstructured":"Leo Breiman, Jerome H. Friedman, Richard A. Olshen, and Charles J. Stone. 1984. Classification and Regression Trees. Chapman & Hall, Boca Raton, FL."},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1675982"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994018"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2019.8715086"},{"key":"e_1_3_1_8_2","first-page":"349","article-title":"Some schemes for parallel multipliers","volume":"34","author":"Dadda Luigi","year":"1965","unstructured":"Luigi Dadda. 1965. Some schemes for parallel multipliers. Alta Frequenza 34 (1965), 349\u2013356.","journal-title":"Alta Frequenza"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS51556.2021.9401664"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2021.3114262"},{"key":"e_1_3_1_11_2","first-page":"448","volume-title":"Proceedings of the International Conference on Machine Learning (ICML\u201915)","author":"Ioffe Sergey","year":"2015","unstructured":"Sergey Ioffe and Christian Szegedy. 2015. Batch normalization: Accelerating deep network training by reducing internal covariate shift. In Proceedings of the International Conference on Machine Learning (ICML\u201915). 448\u2013456."},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.5120\/1624-2185"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1412.6980"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1973.5009159"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2003.159758"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2007.358053"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2878129"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/1228784.1228886"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/DELTA.2004.10071"},{"key":"e_1_3_1_20_2","volume-title":"Computer Arithmetic: Algorithms and Hardware Designs","author":"Parhami Behrooz","year":"2010","unstructured":"Behrooz Parhami. 2010. Computer Arithmetic: Algorithms and Hardware Designs. Oxford University Press, New York, NY."},{"key":"e_1_3_1_21_2","unstructured":"Pytorch. 2022. PyTorch. Retrieved from https:\/\/pytorch.org\/."},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116251"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.5555\/152181"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.23919\/DATE51398.2021.9473972"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2481794"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISLPED.2017.8009168"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.21236\/ADA164453"},{"key":"e_1_3_1_28_2","unstructured":"Scikit-Learn. 2022. Scikit-learn: Machine Learning in Python. Retrieved from https:\/\/scikit-learn.org\/stable\/."},{"key":"e_1_3_1_29_2","unstructured":"Silicon Integration Initiative Inc. 2022. Open-Cell Library - Silicon Integration Initiative. Retrieved from https:\/\/si2.org\/open-cell-library\/."},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1960.5219822"},{"key":"e_1_3_1_31_2","unstructured":"Synopsys Inc. 2022. Design Compiler NXT. Retrieved from https:\/\/www.synopsys.com\/implementation-and-signoff\/rtl-synthesis-test\/design-compiler-nxt.html."},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1964.263830"},{"key":"e_1_3_1_33_2","first-page":"3","article-title":"A logic for high-speed addition","volume":"591","author":"Weinberger A.","year":"1958","unstructured":"A. Weinberger and J. L. Smith. 1958. A logic for high-speed addition. Nat. Bur. Stand. Circul. 591 (1958), 3\u201312.","journal-title":"Nat. Bur. Stand. Circul."},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD51958.2021.9643461"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009982220290"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2008.4483926"},{"key":"e_1_3_1_37_2","volume-title":"Proceedings of the International Workshop on Logic and Architecture Synthesis (IWLAS\u201996)","author":"Zimmermann Reto","year":"1996","unstructured":"Reto Zimmermann. 1996. Non-heuristic optimization and synthesis of parallel-prefix adders. In Proceedings of the International Workshop on Logic and Architecture Synthesis (IWLAS\u201996)."}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3560712","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3560712","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:34Z","timestamp":1750186834000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3560712"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,6]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3,31]]}},"alternative-id":["10.1145\/3560712"],"URL":"https:\/\/doi.org\/10.1145\/3560712","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"value":"1084-4309","type":"print"},{"value":"1557-7309","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,6]]},"assertion":[{"value":"2022-03-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-08-19","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-03-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}