• DocumentCode
    2539767
  • Title

    A probabilistic method to determine the minimum leakage vector for combinational designs

  • Author

    Gulati, Kanupriya ; Jayakumar, Nikhil ; Khatri, Sunil P.

  • Author_Institution
    Dept. of EE, Texas A&M Univ., College Station, TX
  • fYear
    2006
  • fDate
    21-24 May 2006
  • Lastpage
    2244
  • Abstract
    "Parking" a circuit in a minimum leakage state during its standby mode of operation is one of the techniques of reducing leakage power consumption in a circuit. However, the problem of finding this minimum leakage state is NP-hard. In this paper, we present a heuristic approach to determine the input vector which minimizes leakage for a combinational design. Our approach utilizes approximate signal probabilities of internal nodes to aid in finding the minimum leakage vector. We use a probabilistic heuristic to select the next gate to be processed, as well as to select the best state of the selected gate. A fast SAT solver is employed to ensure the consistency of the assignments that are made in this process. Experimental results indicate that our method has very low run-times, with excellent accuracy, compared to existing approaches
  • Keywords
    combinational circuits; computability; leakage currents; logic design; probability; NP-hard problem; SAT solver; combinational designs; leakage power consumption; minimum leakage vector; probabilistic heuristic; signal probabilities; Energy consumption; Equations; Intrusion detection; MOS devices; NP-hard problem; Power supplies; SPICE; Switching circuits; Threshold voltage; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 2006. ISCAS 2006. Proceedings. 2006 IEEE International Symposium on
  • Conference_Location
    Island of Kos
  • Print_ISBN
    0-7803-9389-9
  • Type

    conf

  • DOI
    10.1109/ISCAS.2006.1693066
  • Filename
    1693066