Efficient Test Compaction for Combinational Circuits Based on Fault Detection Count-Directed Clustering

(2006) Efficient Test Compaction for Combinational Circuits Based on Fault Detection Count-Directed Clustering. IEEE Int. Design and Test Workshop.

[img]
Preview
PDF
Efficient_Test_Compaction_for_Combinational_Circuits_IDT2006.pdf

Download (64kB) | Preview

Abstract

Test compaction is an effective technique for reducing test data volume and test application time. In this paper, we present a new static test compaction algorithm based on test vector decomposition and clustering. Test vectors are decomposed and clustered in an increasing order of faults detection count. This clustering order gives more degree of freedom and results in better compaction. Experimental results demonstrate the effectiveness of the proposed approach in achieving higher compaction in a much more efficient CPU time than previous clustering-based test compaction approaches.

Item Type: Article
Subjects: Computer
Department: College of Computing and Mathematics > Computer Engineering
Depositing User: AIMAN HELMI EL-MALEH
Date Deposited: 29 Feb 2008 14:29
Last Modified: 01 Nov 2019 13:22
URI: http://eprints.kfupm.edu.sa/id/eprint/157