Title
On Reduction of Deterministic Test Pattern Sets
Authors
[ 1 ] Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ 2 ] Instytut Radiokomunikacji, Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ D ] phd student | [ P ] employee
Scientific discipline (Law 2.0)
Year of publication
2021
Chapter type
chapter in monograph / paper
Publication language
english
Keywords
EN
- ATPG
- dimensionality reduction
- necessary assign-ments
- static test compaction
- scan-based designs
- test compression
Abstract
EN Test compaction and the associated test data compression are two key components of the post-production test as they reduce test pattern counts, the resultant test data volume, test application time, and hence the cost of testing. The paper describes a method that strives to reduce the number of ATPG-produced deterministic test patterns to deliver compact test sets. In principle, it is based on a dimensionality reduction paradigm by working with a meaningful representation of test patterns using external and internal necessary assignments to determine small groups of potentially compatible faults. These faults are subsequently retargeted by the robust SAT-based ATPG and its solvers producing a single test pattern for the entire group, thus making the resultant test set smaller in size. Experimental results obtained for several industrial designs and stuck-at faults confirm superiority of the proposed scheme over state-of-the-art test set compaction techniques and are reported herein.
Pages (from - to)
260 - 267
Ministry points / chapter
20
Ministry points / conference (CORE)
70
System created by Poznań University of Technology
and Poznan Supercomputing and Networking Center
Log in through eKonto to add to SIS