By Topic

An efficient approach to pipeline scheme for concurrent testing of VLSI circuits

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chen, C.-I.H. ; Dept. of Electr. Eng., Wright State Univ., Dayton, OH, USA ; Yuen, J.

Presents a unifying procedure, called implicit tree search algorithm (ITSA), for automated allocation of test events in a pipeline scheme for concurrent testing of VLSI circuits. The procedure fully exploits the test parallelism where the test intervals of compatible test events are overlaid so that the system can test as many of them as possible concurrently. Moreover, the utilization of BIST (built-in self-test) resources is optimized. The operation of the ITSA is clearly demonstrated with the detailed examples provided. The simulation shows that ITSA is efficient and generates the scheduling results better than previous work

Published in:

Circuits and Systems, 1992. ISCAS '92. Proceedings., 1992 IEEE International Symposium on  (Volume:2 )

Date of Conference:

10-13 May 1992