Journal article
Vector-restoration-based static compaction using random initial omission
IEEE transactions on computer-aided design of integrated circuits and systems, Vol.23(11), pp.1587-1592
11/2004
DOI: 10.1109/TCAD.2004.836720
Abstract
The restoration-based compaction procedures are the most computationally efficient static compaction procedures that reduce the length of a test sequence for a synchronous sequential circuit without reducing the fault coverage. We study one of the important components of the restoration-based compaction process, the initial omission process. This process selects test vectors that will be omitted from the test sequence initially, to start the restoration process. We also propose a specific procedure for the initial omission process. Experimental results for a variety of circuits and test sequences demonstrate that this procedure has a significant effect on the compacted test sequence length. Intuitively, the new procedure postpones the point at which the compaction procedure saturates, thus allowing smaller test lengths to be obtained before saturation is reached. The importance of continuing to explore this problem is related to the fact that static compaction procedures for synchronous sequential circuits are important for scan circuits as well.
Details
- Title: Subtitle
- Vector-restoration-based static compaction using random initial omission
- Creators
- Irith Pomeranz - Purdue University West LafayetteSudhakar M Reddy
- Resource Type
- Journal article
- Publication Details
- IEEE transactions on computer-aided design of integrated circuits and systems, Vol.23(11), pp.1587-1592
- DOI
- 10.1109/TCAD.2004.836720
- ISSN
- 0278-0070
- eISSN
- 1937-4151
- Publisher
- IEEE
- Language
- English
- Date published
- 11/2004
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984197060502771
Metrics
26 Record Views