An algorithm to reduce test application time in full scan designs
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
An algorithm for generating a test with fewer test clocks for full scan designs by using combinational and sequential test generation algorithms adaptively is presented. Heuristics combining tests measures and scan strategies are introduced. The algorithm, 'Test Application time Reduction for Full scan designs' (TARF), is implemented and tested on a set of ISCAS sequential benchmark circuits. The results show that TARF achieves the same test coverage as combinational test generators but with fewer test clocks.<>Keywords
This publication has 8 references indexed in Scilit:
- Selectable Length Partial Scan: A Method to Reduce Vector LengthPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- COMPACTEST: A METHOD TO GENERATE COMPACT TEST SETS FOR COMBINATIONAL CIRCUITSPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Combinational profiles of sequential benchmark circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A design for testability scheme to reduce test application time in full scanPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Ordering storage elements in a single scan chainPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An efficient algorithm for sequential circuit test generationIEEE Transactions on Computers, 1993
- Test compaction for sequential circuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- SMART And FAST: Test Generation for VLSI Scan-Design CircuitsIEEE Design & Test of Computers, 1986