By Topic

A Reduced Complexity Algorithm for Minimizing N-Detect Tests

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
$33 $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)
Kantipudi, K.R. ; Dept. of Electr. & Comput. Eng., Auburn Univ., AL ; Agrawal, V.D.

We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimization. This is a polynomial-time solution that closely approximates the exact but NP-hard integer linear programming (ILP) solution. In ILP, a test is represented by a [0,1] integer variable and the sum of those variables is minimized. Constraints ensure that each fault has at least N tests with non-zero variables. Traditionally, the problem has been transformed to less complex LP by treating the variables as real numbers, regarded as probabilities with which they can be rounded off to 0 or 1. This is known as the randomized rounding method. In the new method, the LP is recursively used, each time rounding the largest variable to 1 and reducing the size of the LP. The method is found to converge to a solution in just a few LP runs and the result is usually better than that of randomized rounding. Experimental results include ISCAS85 benchmarks and a set of multiplier circuits. N-detect tests for N = 1, 5 and 15 are considered. Also, a 10-vector single-detect sequence for c6288 is given

Published in:

VLSI Design, 2007. Held jointly with 6th International Conference on Embedded Systems., 20th International Conference on

Date of Conference:

Jan. 2007