INTEGRA: Fast Multibit Flip-Flop Clustering for Clock Power Saving

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.

[1]  Wai-Kei Mak,et al.  Power-Driven Flip-Flop Merging and Relocation , 2012, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Yu-Ming Yang,et al.  INTEGRA: fast multi-bit flip-flop clustering for clock power saving based on interval graphs , 2011, ISPD '11.

[3]  Kwang-Ting Cheng,et al.  Electronic Design Automation: Synthesis, Verification, and Test , 2009 .

[4]  Chih-Cheng Hsu,et al.  Post-Placement Power Optimization With Multi-Bit Flip-Flops , 2011, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  R. W. McGuffin,et al.  Physical synthesis for performance optimization , 1992, [1992] Proceedings. Fifth Annual IEEE International ASIC Conference and Exhibit.

[6]  Wenting Hou,et al.  Automatic register banking for low-power clock trees , 2009, 2009 10th International Symposium on Quality Electronic Design.

[7]  C. P. Rangan,et al.  A Unified Approach to Domination Problems on Interval Graphs , 1988, Inf. Process. Lett..

[8]  Der-Tsai Lee,et al.  Maximum Clique Problem of Rectangle Graphs , 1983 .

[9]  Éva Tardos,et al.  Algorithm design , 2005 .

[10]  Chih-Cheng Hsu,et al.  Post-placement power optimization with multi-bit flip-flops , 2010, 2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[11]  Iris Hui-Ru Jiang,et al.  Power-state-aware buffered tree construction , 2008, 2008 IEEE International Conference on Computer Design.

[12]  Zhi-Wei Chen,et al.  Construction of constrained multi-bit flip-flops for clock power reduction , 2010, The 2010 International Conference on Green Circuits and Systems.

[13]  Michiel H. M. Smid,et al.  Randomized data structures for the dynamic closest-pair problem , 1998, SODA '93.

[14]  Yao-Wen Chang,et al.  ECO timing optimization using spare cells , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.

[15]  Jarrod A. Roy,et al.  ITOP: integrating timing optimization within placement , 2010, ISPD '10.