Machine-learning-driven Architectural Selection of Adders and Multipliers in Logic Synthesis

被引:3
作者
Cheng, Jiawen [1 ]
Xiao, Yong [2 ]
Shao, Yun [2 ]
Dong, Guanghai [2 ]
Lyu, Songlin [1 ]
Yu, Wenjian [1 ]
机构
[1] Tsinghua Univ, Beijing 100084, Peoples R China
[2] Giga Design Automat Co Ltd, Shenzhen 518055, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
Logic synthesis; datapath; adder/multiplier; machine learning; architectural selection; ALGORITHM;
D O I
10.1145/3560712
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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 4x faster than a brute-force approach trying four candidate architectures and consumes 10%similar to 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.
引用
收藏
页数:16
相关论文
共 36 条
[1]  
[Anonymous], scikit-learn Machine Learning in Python
[2]   2 COMPLEMENT PARALLEL ARRAY MULTIPLICATION ALGORITHM [J].
BAUGH, CR .
IEEE TRANSACTIONS ON COMPUTERS, 1973, C 22 (12) :1045-1047
[3]   A SIGNED BINARY MULTIPLICATION TECHNIQUE [J].
BOOTH, AD .
QUARTERLY JOURNAL OF MECHANICS AND APPLIED MATHEMATICS, 1951, 4 (02) :236-240
[4]  
Breiman L., 1984, CLASSIFICATION REGRE, DOI DOI 10.1201/9781315139470
[5]   A REGULAR LAYOUT FOR PARALLEL ADDERS [J].
BRENT, RP ;
KUNG, HT .
IEEE TRANSACTIONS ON COMPUTERS, 1982, 31 (03) :260-264
[6]  
CORTES C, 1995, MACH LEARN, V20, P273, DOI 10.1023/A:1022627411411
[7]  
Cui GQ, 2019, DES AUT TEST EUROPE, P984, DOI [10.23919/DATE.2019.8715086, 10.23919/date.2019.8715086]
[8]  
Dadda L., 1965, ALTA FREQ, V34, P349
[9]   Fast Logic Optimization Using Decision Trees [J].
de Abreu, Brunno A. ;
Berndt, Augusto ;
Campos, Isac S. ;
Meinhardt, Cristina ;
Carvalho, Jonata T. ;
Grellert, Mateus ;
Bampi, Sergio .
2021 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2021,
[10]   High-Speed Adder Design Space Exploration via Graph Neural Processes [J].
Geng, Hao ;
Ma, Yuzhe ;
Xu, Qi ;
Miao, Jin ;
Roy, Subhendu ;
Yu, Bei .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2022, 41 (08) :2657-2670