By Topic

Analysis and improvement of testability measure approximation algorithms

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

4 Author(s)
Bitner, J. ; Comput. Eng. Res. Center, Texas Univ., Austin, TX, USA ; Jain, J. ; Abraham, J.A. ; Fussell, D.S.

This paper presents a theoretical framework for the study of algorithms for approximating testability measures. To illustrate its application, we consider two well-known algorithms. It is shown empirically that both algorithms perform very poorly on several circuits of realistic size. For some circuits, an equally good approximation to the testability measure can be achieved by a random number generator or a “0th order” approximation algorithm that always returns a constant 1/2. Analytically, we present several circuits for which the performance of these algorithms is arbitrarily bad. The analysis is then used to identify their weaknesses, and procedures are suggested through which such unpredictable performances may be improved. One procedure is discussed in detail and an order of magnitude improvement in accuracy results

Published in:

Test Symposium, 1994., Proceedings of the Third Asian

Date of Conference:

15-17 Nov 1994