Quality of EDA CAD Tools: Definitions, Metrics and Directions
ISQED '00 Proceedings of the 1st International Symposium on Quality of Electronic Design
On minimum delay clustering without replication
Integration, the VLSI Journal
Delay optimal low-power circuit clustering for FPGAs with dual supply voltages
Proceedings of the 2004 international symposium on Low power electronics and design
Low-power clustering with minimum logic replication for coarse-grained, antifuse based FPGAs
GLSVLSI '06 Proceedings of the 16th ACM Great Lakes symposium on VLSI
Optimal simultaneous mapping and clustering for FPGA delay optimization
Proceedings of the 43rd annual Design Automation Conference
FPGA Design Automation: A Survey
Foundations and Trends in Electronic Design Automation
| Hi-index | 0.03 |
This paper presents a delay-optimal clustering algorithm for minimizing the power dissipation in a very large scale integration (VLSI) circuit. Traditional approaches for delay-optimal clustering are based on Lawler's clustering algorithm which makes no attempt to explore alternative clustering solutions that have the same delay but lower power implementations. Our algorithm implicitly enumerates alternate clusterings and selects a clustering solution which has the same delay, but the lowest power dissipation. For tree circuits, the proposed algorithm produces delay- and power-optimal clustering, whereas for nontree circuits it produces delay-optimal clustering with significantly reduced power dissipation. The proposed mechanism can be used to generate power minimized clusters for various applications such as preprocessing designs for partitioning, clustering logic during synthesis, etc. The mechanism can also be deployed hierarchically to generate circuit partitioning solutions directly