INTEGRA: Fast Multibit Flip-Flop Clustering for Clock Power Saving
Authors:
- 19 January 2012
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 31 (2) , 192-204
Abstract
Clock power is the major contributor to dynamic power for modern integrated circuit design. A conventional single-bit flip-flop cell uses an inverter chain with a high drive strength to drive the clock signal. Clustering several such cells and forming a multibit flip-flop can share the drive strength, dynamic power, and area of the inverter chain, and can even save the clock network power and facilitate the skew control. Hence, in this paper, we focus on postplacement multibit flip-flop clustering to gain these benefits. Utilizing the properties of Manhattan distance and coordinate transformation, we model the problem instance by two interval graphs and use a pair of linear-sized sequences as our representation. Without enumerating all possible combinations, we identify only partial sequences that are necessary to cluster flip-flops, thus leading to an efficient clustering scheme. Moreover, our fast coordinate transformation also makes the execution of our algorithm very efficient. The experiments are conducted on industrial circuits. Our results show that concise representation delivers superior efficiency and effectiveness. Even under timing and placement density constraints, clock power saving via multibit flip-flop clustering can still be substantial at postplacement.Keywords
This publication has 9 references indexed in Scilit:
- Power-driven flip-flop merging and relocation2011
- Post-placement power optimization with multi-bit flip-flops2010
- Construction of constrained multi-bit flip-flops for clock power reduction2010
- ITOP2010
- Automatic register banking for low-power clock trees2009
- Power-state-aware buffered tree construction2008
- Physical synthesis for performance optimization2003
- Randomized Data Structures for the Dynamic Closest-Pair ProblemSIAM Journal on Computing, 1998
- A unified approach to domination problems on interval graphsInformation Processing Letters, 1988