loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1999 IEEE International Conference on Computer Design (ICCD'99)
A New Weight Set Generation Algorithm for Weighted Random Pattern Generation
Austin, Texas
October 10-October 13
ISBN: 0-7695-0406-X
Hangkyu Lee, Yonsei University
Sungho Kang, Yonsei University
In weighted random pattern testing based on deterministic test patterns. If the number of the deterministic test patterns with a low sampling probability is reduced, the number of the weighted random patterns required to achieve a high fault coverage can be decreased. The weight set that makes the variance of sampling probabilities for deterministic test patterns very small, can reduce the number of the deterministic test patterns with a low sampling probability. In this paper, we present a new weight set generation algorithm which can generate high performance weight sets by reducing the variance of the sampling probabilities. Experimental results on ISCAS-85 benchmark circuits prove the effectiveness of the new weight set generation algorithm.
Citation:
Hangkyu Lee, Sungho Kang, "A New Weight Set Generation Algorithm for Weighted Random Pattern Generation," iccd, pp.160, 1999 IEEE International Conference on Computer Design (ICCD'99), 1999
Usage of this product signifies your acceptance of the Terms of Use.