Automated Design Error Debugging of Digital VLSI Circuits

被引:1
作者
Moness, Mohammed [1 ]
Gaber, Lamya [1 ]
Hussein, Aziza, I [2 ]
Ali, Hanafy M. [1 ]
机构
[1] Minia Univ, Comp & Syst Eng Dept, Al Minya, Egypt
[2] Effat Univ, Elect & Comp Eng Dept, Jeddah, Saudi Arabia
来源
JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS | 2022年 / 38卷 / 04期
关键词
Fault diagnosis; Deep learning; Neural networks; Autoencoder; DIAGNOSIS; ALGORITHM;
D O I
10.1007/s10836-022-06020-z
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
As the complexity and scope of VLSI designs continue to grow, fault detection processes in the pre-silicon stage have become crucial to guaranteeing reliability in IC design. Most fault detection algorithms can be solved by transforming them into a satisfiability (SAT) problem decipherable by SAT solvers. However, SAT solvers consume significant computational time, as a result of the search space explosion problem. This ever- increasing amount of data can be handled via machine learning techniques known as deep learning algorithms. In this paper, we propose a new approach utilizing deep learning for fault detection (FD) of combinational and sequential circuits in a type of stuck-at-faults. The goal of the proposed semi-supervised FD model is to avoid the search space explosion problem by taking advantage of unsupervised and supervised learning processes. First, the unsupervised learning process attempts to extract underlying concepts of data using Deep sparse autoencoder. Then, the supervised process tends to describe rules of classification that are applied to the reduced features for detecting different stuck-at faults within circuits. The FD model proposes good performance in terms of running time about 187 x compared to other FD algorithm based on SAT solvers. In addition, it is compared to common classical machine learning models such as Decision Tree (DT), Random Forest (RF) and Gradient Boosting (GB) classifiers, in terms of validation accuracy. The results show a maximum validation accuracy of the feature extraction process at 99.93%, using Deep sparse autoencoder for combinational circuits. For sequential circuits, stacked sparse autoencoder presents 99.95% as average validation accuracy. The fault detection process delivers around 99.6% maximum validation accuracy for combinational circuits from ISCAS'85 and 99.8% for sequential circuits from ISCAS'89 benchmarks. Moreover, the proposed FD model has achieved a running time of about 1.7x, compared to DT classifier and around 1.6x, compared to RF classifier and GB machine learning classifiers, in terms of validation accuracy in detecting faults occurred in eight different digital circuits. Furthermore, the proposed model outperforms other FD models, based on Radial Basis Function Network (RBFN), achieving 97.8% maximum validation accuracy.
引用
收藏
页码:395 / 417
页数:23
相关论文
共 39 条
[1]  
Ali Lamya G., 2016, 2016 28th International Conference on Microelectronics (ICM), P184, DOI 10.1109/ICM.2016.7847940
[2]  
Baldi Pierre, 2011, P ICML WORKSHOP UNSU, P37
[3]  
Becker AJ, 2018, EPFL
[4]   MUST: Minimal Unsatisfiable Subsets Enumeration Tool [J].
Bendik, Jaroslav ;
Cerna, Ivana .
TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PT I, TACAS 2020, 2020, 12078 :135-152
[5]   Recursive Online Enumeration of All Minimal Unsatisfiable Subsets [J].
Bendik, Jaroslav ;
Cerna, Ivana ;
Benes, Nikola .
AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS (ATVA 2018), 2018, 11138 :143-159
[6]  
BRGLEZ F, 1989, 1989 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-3, P1929, DOI 10.1109/ISCAS.1989.100747
[7]  
Bryan D., 1985, The ISCAS'85 Benchmark Circuits and Netlist Format, V25, P39
[8]  
Chollet F., 2015, KERAS
[9]  
Cook S., 1971, Proceedings of the third annual ACM symposium on Theory of computing, P151
[10]   CUD@SAT: SAT solving on GPUs [J].
Dal Palu, Alessandro ;
Dovier, Agostino ;
Formisano, Andrea ;
Pontelli, Enrico .
JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 2015, 27 (03) :293-316