Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/67751
Title: Comparison of sampling techniques for a parametric yield optimization algorithm
Authors: Palvannan, K. 
Keywords: Center of gravity (cog) algorithm
Importance sampling
Monte carlo simulation
Yield optimization
Issue Date: 1999
Citation: Palvannan, K. (1999). Comparison of sampling techniques for a parametric yield optimization algorithm. International Journal of Reliability, Quality and Safety Engineering 6 (2) : 185-202. ScholarBank@NUS Repository.
Abstract: Tolerances in component values will affect a product manufacturing yield. The yield can be maximized by selecting component nominal values judiciously. Several yield optimization routines have been developed. A simple algorithm known as the center of gravity (CoG) method makes use of a simple Monte Carlo sampling to estimate the yield and to generate a search direction for the optimal nominal values. This technique is known to be able to identify the region of high yield in a small number of iterations. The use of the importance sampling technique is investigated. The objective is to reduce the number of samples needed to reach the optimal region. A uniform distribution centered at the mean is studied as the importance sampling density. The results show that a savings of about 40% as compared to Monte Carlo sampling can be achieved using importance sampling when the starting yield is low. The importance sampling density also helped the search process to identify the high yield region quickly and the region identified is generally better than that of Monte Carlo sampling. © World Scientific Publishing Company.
Source Title: International Journal of Reliability, Quality and Safety Engineering
URI: http://scholarbank.nus.edu.sg/handle/10635/67751
ISSN: 02185393
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.