Adaptive random testing with total cartesian distance for black box circuit under test

Testing and verification of digital circuits is of vital importance in electronics industry. Moreover, key designs require preservation of their intellectual property that might restrict access to the internal structure of circuit under test. Random testing is a classical solution to black box testi...

Full description

Saved in:
Bibliographic Details
Main Authors: Alamgir, Arbab (Author), Khari A'ain, Abu (Author), Paraman, Norlina (Author), Ullah Sheikh, Usman (Author)
Other Authors: This work was supported by the Ministry of Education Malaysia and Universiti Teknologi Malaysia (UTM) (Contributor)
Format: EJournal Article
Published: Institute of Advanced Engineering and Science, 2020-11-01.
Subjects:
Online Access:Get fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 03126 am a22003253u 4500
001 ijeecs21904_14269
042 |a dc 
100 1 0 |a Alamgir, Arbab  |e author 
100 1 0 |a This work was supported by the Ministry of Education Malaysia and Universiti Teknologi Malaysia   |q  (UTM)   |e contributor 
700 1 0 |a Khari A'ain, Abu  |e author 
700 1 0 |a Paraman, Norlina  |e author 
700 1 0 |a Ullah Sheikh, Usman  |e author 
245 0 0 |a Adaptive random testing with total cartesian distance for black box circuit under test 
260 |b Institute of Advanced Engineering and Science,   |c 2020-11-01. 
500 |a https://ijeecs.iaescore.com/index.php/IJEECS/article/view/21904 
520 |a Testing and verification of digital circuits is of vital importance in electronics industry. Moreover, key designs require preservation of their intellectual property that might restrict access to the internal structure of circuit under test. Random testing is a classical solution to black box testing as it generates test patterns without using the structural implementation of the circuit under test. However, random testing ignores the importance of previously applied test patterns while generating subsequent test patterns. An improvement to random testing is Antirandom that diversifies every subsequent test pattern in the test sequence. Whereas, computational intensive process of distance calculation restricts its scalability for large input circuit under test. Fixed sized candidate set adaptive random testing uses predetermined number of patterns for distance calculations to avoid computational complexity. A combination of max-min distance with previously executed patterns is carried out for each test pattern candidate. However, the reduction in computational complexity reduces the effectiveness of test set in terms of fault coverage. This paper uses a total cartesian distance based approach on fixed sized candidate set to enhance diversity in test sequence. The proposed approach has a two way effect on the test pattern generation as it lowers the computational intensity along with enhancement in the fault coverage. Fault simulation results on ISCAS'85 and ISCAS'89 benchmark circuits show that fault coverage of the proposed method increases up to 20.22% compared to previous method. 
540 |a Copyright (c) 2020 Institute of Advanced Engineering and Science 
540 |a http://creativecommons.org/licenses/by-nc/4.0 
546 |a eng 
690 |a Circuit testing 
690 |a Blackbox testing; Random testing; Adaptive random; Fault coverage; Distance enhancement 
655 7 |a info:eu-repo/semantics/article  |2 local 
655 7 |a info:eu-repo/semantics/publishedVersion  |2 local 
655 7 |2 local 
786 0 |n Indonesian Journal of Electrical Engineering and Computer Science; Vol 20, No 2: November 2020; 720-726 
786 0 |n 2502-4760 
786 0 |n 2502-4752 
786 0 |n 10.11591/ijeecs.v20.i2 
787 0 |n https://ijeecs.iaescore.com/index.php/IJEECS/article/view/21904/14269 
856 4 1 |u https://ijeecs.iaescore.com/index.php/IJEECS/article/view/21904/14269  |z Get fulltext