• DocumentCode
    1891490
  • Title

    A new voltage binning technique for yield improvement based on graph theory

  • Author

    Shen, Ruijing ; Tan, Sheldon X -D ; Liu, Xue-Xin

  • Author_Institution
    Dept. Electr. Eng., Univ. of California, Riverside, CA, USA
  • fYear
    2012
  • fDate
    19-21 March 2012
  • Firstpage
    243
  • Lastpage
    248
  • Abstract
    In this paper, we propose a new voltage binning technique to improve yield. Voltage binning technique tries to assign different supply voltages to different chips in order to improve the yield. A novel valid voltage segment concept is proposed, which is determined by the timing and power constraints of chips. Then we develop a formulation to predict the maximum number of bins required under the uniform binning scheme from the distribution of length of valid supply voltage segment. With the new concept, an optimal binning scheme can be modeled as a set-cover problem. A greedy algorithm is developed to solve the set-cover problem in an incremental way. The new method is also extendable to deal with a range of working supply voltages for dynamic voltage scaling under different operation modes (like lower power and high performance modes). Experimental results on some benchmarks in 45nm technology show that the proposed method can correctly predict the upper bound on the number of bins required. The optimal binning scheme can lead to significant saving for the number of bins compared to the uniform one to achieve the same yield with very small CPU cost.
  • Keywords
    graph theory; greedy algorithms; low-power electronics; microprocessor chips; set theory; graph theory; greedy algorithm; set-cover problem; supply voltages; voltage binning; yield improvement; Algorithm design and analysis; Optimization; Power demand; Testing; Timing; Upper bound; Voltage measurement;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Quality Electronic Design (ISQED), 2012 13th International Symposium on
  • Conference_Location
    Santa Clara, CA
  • ISSN
    1948-3287
  • Print_ISBN
    978-1-4673-1034-5
  • Type

    conf

  • DOI
    10.1109/ISQED.2012.6187501
  • Filename
    6187501