Heuristic approach to optimize the number of test cases for simple circuits

Computer Science – Other Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

PDF 9 pages, 2 figures, 2 tables

Scientific paper

10.5121/vlsic.2010.1302

In this paper a new solution is proposed for testing simple stwo stage electronic circuits. It minimizes the number of tests to be performed to determine the genuinity of the circuit. The main idea behind the present research work is to identify the maximum number of indistinguishable faults present in the given circuit and minimize the number of test cases based on the number of faults that has been detected. Heuristic approach is used for test minimization part, which identifies the essential tests from overall test cases. From the results it is observed that, test minimization varies from 50% to 99% with the lowest one corresponding to a circuit with four gates .Test minimization is low in case of circuits with lesser input leads in gates compared to greater input leads in gates for the boolean expression with same number of symbols. Achievement of 99% reduction is due to the fact that the large number of tests find the same faults. The new approach is implemented for simple circuits. The results show potential for both smaller test sets and lower cpu times.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Heuristic approach to optimize the number of test cases for simple circuits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Heuristic approach to optimize the number of test cases for simple circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Heuristic approach to optimize the number of test cases for simple circuits will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-243611

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.