DocumentCode :
3110056
Title :
Optimal scheduling of signature analysis for VLSI testing
Author :
Lee, Y.-H. ; Krishna, C.M.
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
fYear :
1988
fDate :
12-14 Sep 1988
Firstpage :
443
Lastpage :
451
Abstract :
A simple algorithm is presented which minimizes the mean testing time for VLSI circuits. By breaking up the testing process into subintervals, and analyzing the signature are the end of each subinterval, it is possible to abort future tests if the circuit is found to be faulty, thus saving test time. Subdivision of the test process also reduces the probability of aliasing, thus increasing the effective coverage of the signature analysis process. If the process is sufficiently subdivided, it may be possible to use the test results not only to determine if the circuit is faulty or not, but to diagnose the fault
Keywords :
VLSI; electronic engineering computing; integrated circuit testing; probability; scheduling; VLSI circuits; VLSI testing; aliasing; optimal scheduling; probability; signature analysis; Algorithm design and analysis; Circuit faults; Circuit testing; Exponential distribution; Interleaved codes; Optimal scheduling; Processor scheduling; Scheduling algorithm; System testing; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Test Conference, 1988. Proceedings. New Frontiers in Testing, International
Conference_Location :
Washington, DC
ISSN :
1089-3539
Print_ISBN :
0-8186-0870-6
Type :
conf
DOI :
10.1109/TEST.1988.207755
Filename :
207755
Link To Document :
بازگشت