Abstract
We illustrate a new method to characterize the energy dissipation of circuits by collapsing closely related input transition vectors and energy patterns into capacitive coefficients. Energy characterization needs to be done only once for each module (ALU, multiplier etc.,) in order to build a library of these capacitive coefficients. A direct high-level energy simulator or profiler can then use the library of pre-characterized modules and a sequence of input vectors to compute the total energy dissipation. A heuristic algorithm which performs energy clustering under objective constraints has been devised. The worst case running time of this algorithm is O(m3n), where m is the number of simulation points and n is the number of inputs of the circuit. The designer can experiment with the criterion function by setting the appropriate relative error norms to control the `goodness' of the clustering algorithm and the sampling error and confidence level to maintain the sufficiency of representation of each cluster. Experiments on circuits show a significant reduction of the energy table size under a specified criterion function, cluster sampling error and confidence levels.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 702-707 |
| Number of pages | 6 |
| Journal | Proceedings - Design Automation Conference |
| State | Published - Jan 1 1996 |
| Event | Proceedings of the 1996 33rd Annual Design Automation Conference - Las Vegas, NV, USA Duration: Jun 3 1996 → Jun 7 1996 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Control and Systems Engineering
Cite this
}
Energy characterization based on clustering. / Mehta, Huzefa; Owens, Robert Michael; Irwin, Mary Jane.
In: Proceedings - Design Automation Conference, 01.01.1996, p. 702-707.Research output: Contribution to journal › Conference article
TY - JOUR
T1 - Energy characterization based on clustering
AU - Mehta, Huzefa
AU - Owens, Robert Michael
AU - Irwin, Mary Jane
PY - 1996/1/1
Y1 - 1996/1/1
N2 - We illustrate a new method to characterize the energy dissipation of circuits by collapsing closely related input transition vectors and energy patterns into capacitive coefficients. Energy characterization needs to be done only once for each module (ALU, multiplier etc.,) in order to build a library of these capacitive coefficients. A direct high-level energy simulator or profiler can then use the library of pre-characterized modules and a sequence of input vectors to compute the total energy dissipation. A heuristic algorithm which performs energy clustering under objective constraints has been devised. The worst case running time of this algorithm is O(m3n), where m is the number of simulation points and n is the number of inputs of the circuit. The designer can experiment with the criterion function by setting the appropriate relative error norms to control the `goodness' of the clustering algorithm and the sampling error and confidence level to maintain the sufficiency of representation of each cluster. Experiments on circuits show a significant reduction of the energy table size under a specified criterion function, cluster sampling error and confidence levels.
AB - We illustrate a new method to characterize the energy dissipation of circuits by collapsing closely related input transition vectors and energy patterns into capacitive coefficients. Energy characterization needs to be done only once for each module (ALU, multiplier etc.,) in order to build a library of these capacitive coefficients. A direct high-level energy simulator or profiler can then use the library of pre-characterized modules and a sequence of input vectors to compute the total energy dissipation. A heuristic algorithm which performs energy clustering under objective constraints has been devised. The worst case running time of this algorithm is O(m3n), where m is the number of simulation points and n is the number of inputs of the circuit. The designer can experiment with the criterion function by setting the appropriate relative error norms to control the `goodness' of the clustering algorithm and the sampling error and confidence level to maintain the sufficiency of representation of each cluster. Experiments on circuits show a significant reduction of the energy table size under a specified criterion function, cluster sampling error and confidence levels.
UR - http://www.scopus.com/inward/record.url?scp=0029695157&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0029695157&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:0029695157
SP - 702
EP - 707
JO - Proceedings - Design Automation Conference
JF - Proceedings - Design Automation Conference
SN - 0738-100X
ER -