Abstract
With the remarkable growth of portable application and the increasing frequency and integration density, power is being given comparable weight to speed and area in IC designs. In technology mapping, how decomposition is done can have a significant impact on the power dissipation of the final implementation. In the literature, only heuristic algorithms are given for the low-power gate decomposition problem. In this paper, we prove many properties an optimal decomposition tree must have. Based on these optimality properties, we design an efficient exact algorithm to solve the low-power gate decomposition problem. Moreover, the exact algorithm can be easily modified to a heuristic algorithm which performs much better than the known heuristics.
Original language | English |
---|---|
Title of host publication | 1997 IEEE International Conference on Computer Aided Design, ICCAD 1997 |
Publisher | IEEE |
Pages | 575-580 |
Number of pages | 6 |
ISBN (Print) | 0818682000 |
DOIs | |
Publication status | Published - Nov 1997 |
Event | 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1997 - San Jose, United States Duration: 9 Nov 1997 → 13 Nov 1997 https://ieeexplore.ieee.org/xpl/conhome/5191/proceeding (Link to conference proceedings) |
Publication series
Name | Proceedings of IEEE International Conference on Computer Aided Design |
---|---|
Publisher | IEEE |
Conference
Conference | 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1997 |
---|---|
Country/Territory | United States |
City | San Jose |
Period | 9/11/97 → 13/11/97 |
Internet address |
|
Scopus Subject Areas
- Software
- Computer Science Applications
- Computer Graphics and Computer-Aided Design