Efficient algorithms for identifying the minimum leakage states in CMOS combinational logic

Kaviraj Chopra, Sarma Vrudhula, Sarvesh Bhardwaj

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Power dissipation in CMOS circuits during inactive periods (static power) has become a significant part of the total power dissipation. This is particularly problematic for portable, battery powered systems, which are often in standby mode for long periods. It is well known that the major component of static power dissipation is due to subthreshold conduction. For individual gates, this leakage can vary by an order of magnitude over the gate 's input states. Consequently, one way to minimize the leakage is to drive the inputs of the circuit to a state at which the leakage is minimum. In this paper, we present a new approach to identify all minimum leakage states. The method performs implicit enumeration based on integer valued decision diagrams. Since the search space for minimum leakage vector is exponential in the number of primary inputs, the enumeration is done with respect to the minimum balanced cut of the digraph representation of the circuit. The algorithm was successfully tested on the ISCAS85 and MCNC91 benchmark circuits.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE International Conference on VLSI Design
Pages240-245
Number of pages6
Volume17
StatePublished - 2004
EventProceedings - 17th International Conference on VLSI Design, Concurrently with the 3rd International Conference on Embedded Systems Design - Mumbai, India
Duration: Jan 5 2004Jan 9 2004

Other

OtherProceedings - 17th International Conference on VLSI Design, Concurrently with the 3rd International Conference on Embedded Systems Design
CountryIndia
CityMumbai
Period1/5/041/9/04

Fingerprint

Energy dissipation
Networks (circuits)

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Chopra, K., Vrudhula, S., & Bhardwaj, S. (2004). Efficient algorithms for identifying the minimum leakage states in CMOS combinational logic. In Proceedings of the IEEE International Conference on VLSI Design (Vol. 17, pp. 240-245)

Efficient algorithms for identifying the minimum leakage states in CMOS combinational logic. / Chopra, Kaviraj; Vrudhula, Sarma; Bhardwaj, Sarvesh.

Proceedings of the IEEE International Conference on VLSI Design. Vol. 17 2004. p. 240-245.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chopra, K, Vrudhula, S & Bhardwaj, S 2004, Efficient algorithms for identifying the minimum leakage states in CMOS combinational logic. in Proceedings of the IEEE International Conference on VLSI Design. vol. 17, pp. 240-245, Proceedings - 17th International Conference on VLSI Design, Concurrently with the 3rd International Conference on Embedded Systems Design, Mumbai, India, 1/5/04.
Chopra K, Vrudhula S, Bhardwaj S. Efficient algorithms for identifying the minimum leakage states in CMOS combinational logic. In Proceedings of the IEEE International Conference on VLSI Design. Vol. 17. 2004. p. 240-245
Chopra, Kaviraj ; Vrudhula, Sarma ; Bhardwaj, Sarvesh. / Efficient algorithms for identifying the minimum leakage states in CMOS combinational logic. Proceedings of the IEEE International Conference on VLSI Design. Vol. 17 2004. pp. 240-245
@inproceedings{97081a14f8ca4d5f9b53f8d0aec1b159,
title = "Efficient algorithms for identifying the minimum leakage states in CMOS combinational logic",
abstract = "Power dissipation in CMOS circuits during inactive periods (static power) has become a significant part of the total power dissipation. This is particularly problematic for portable, battery powered systems, which are often in standby mode for long periods. It is well known that the major component of static power dissipation is due to subthreshold conduction. For individual gates, this leakage can vary by an order of magnitude over the gate 's input states. Consequently, one way to minimize the leakage is to drive the inputs of the circuit to a state at which the leakage is minimum. In this paper, we present a new approach to identify all minimum leakage states. The method performs implicit enumeration based on integer valued decision diagrams. Since the search space for minimum leakage vector is exponential in the number of primary inputs, the enumeration is done with respect to the minimum balanced cut of the digraph representation of the circuit. The algorithm was successfully tested on the ISCAS85 and MCNC91 benchmark circuits.",
author = "Kaviraj Chopra and Sarma Vrudhula and Sarvesh Bhardwaj",
year = "2004",
language = "English (US)",
volume = "17",
pages = "240--245",
booktitle = "Proceedings of the IEEE International Conference on VLSI Design",

}

TY - GEN

T1 - Efficient algorithms for identifying the minimum leakage states in CMOS combinational logic

AU - Chopra, Kaviraj

AU - Vrudhula, Sarma

AU - Bhardwaj, Sarvesh

PY - 2004

Y1 - 2004

N2 - Power dissipation in CMOS circuits during inactive periods (static power) has become a significant part of the total power dissipation. This is particularly problematic for portable, battery powered systems, which are often in standby mode for long periods. It is well known that the major component of static power dissipation is due to subthreshold conduction. For individual gates, this leakage can vary by an order of magnitude over the gate 's input states. Consequently, one way to minimize the leakage is to drive the inputs of the circuit to a state at which the leakage is minimum. In this paper, we present a new approach to identify all minimum leakage states. The method performs implicit enumeration based on integer valued decision diagrams. Since the search space for minimum leakage vector is exponential in the number of primary inputs, the enumeration is done with respect to the minimum balanced cut of the digraph representation of the circuit. The algorithm was successfully tested on the ISCAS85 and MCNC91 benchmark circuits.

AB - Power dissipation in CMOS circuits during inactive periods (static power) has become a significant part of the total power dissipation. This is particularly problematic for portable, battery powered systems, which are often in standby mode for long periods. It is well known that the major component of static power dissipation is due to subthreshold conduction. For individual gates, this leakage can vary by an order of magnitude over the gate 's input states. Consequently, one way to minimize the leakage is to drive the inputs of the circuit to a state at which the leakage is minimum. In this paper, we present a new approach to identify all minimum leakage states. The method performs implicit enumeration based on integer valued decision diagrams. Since the search space for minimum leakage vector is exponential in the number of primary inputs, the enumeration is done with respect to the minimum balanced cut of the digraph representation of the circuit. The algorithm was successfully tested on the ISCAS85 and MCNC91 benchmark circuits.

UR - http://www.scopus.com/inward/record.url?scp=2342640177&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=2342640177&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:2342640177

VL - 17

SP - 240

EP - 245

BT - Proceedings of the IEEE International Conference on VLSI Design

ER -