Test Vector Decomposition-Based Static Compaction Algorithms for Combinational Circuits

Research output: Contribution to journalArticlepeer-review

48 Scopus citations

Abstract

Testing system-on-chips involves applying huge amounts of test data, which is stored in the tester memory and then transferred to the chip under test during test application. Therefore, practical techniques, such as test compression and compaction, are required to reduce the amount of test data in order to reduce both the total testing time and memory requirements for the tester. In this article, a new approach to static compaction for combinational circuits, referred to as test vector decomposition (TVD), is proposed. In addition, two new TVD based static compaction algorithms are presented. Experimental results for benchmark circuits demonstrate the effectiveness of the two new static compaction algorithms.

Original languageEnglish
Pages (from-to)430-459
Number of pages30
JournalACM Transactions on Design Automation of Electronic Systems
Volume8
Issue number4
DOIs
StatePublished - Oct 2003

Keywords

  • Class-based clustering
  • Combinational circuits
  • Independent fault clustering
  • Static compaction
  • Taxonomy
  • Test vector decomposition

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Test Vector Decomposition-Based Static Compaction Algorithms for Combinational Circuits'. Together they form a unique fingerprint.

Cite this