Analytical Clustering Score with Application to Post-Placement Multi-Bit Flip-Flop Merging
Authors:
Open Access
- 29 March 2015
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 93-100
Abstract
Circuit clustering is usually done through discrete optimizations, with the purpose of circuit size reduction or design-specific cluster formation. Specifically, we are interested in the multi-bit flip-flop (MBFF) design technique for clock power reduction, where all previous works rely on discrete clustering optimizations. For example, INTEGRA was the only existing post-placement MBFF clustering optimizer with a sub-quadratic time complexity. However, it degrades the wirelength severely, especially for realistic designs, which may cancel out the benefits of MBFF clustering. In this paper we enable the formulation of an analytical clustering score in nonlinear programming, where the wirelength objective can be seamlessly integrated. It has sub-quadratic time complexity, reduces the clock power by about 20% as the state-of-the-art techniques, and further reduces the wirelength by about 25%. In addition, the proposed method is promising to be integrated in an in-placement MBFF clustering solver and be applied in other problems which require formulating the clustering score in the objective function.Keywords
Funding Information
- Research Fund for the Doctoral Program of Higher Education of China(MoE/RFDP) (20120001120124)
- Beijing Natural Science Foundation(BJNSF) (4142022)
- National Natural Science Foundation of China(NSFC) (61202073)
This publication has 17 references indexed in Scilit:
- In-placement clock-tree aware multi-bit flip-flop generation for power optimization2013
- FF-bond2013
- Power-Driven Flip-Flop Merging and RelocationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2012
- Post-Placement Power Optimization With Multi-Bit Flip-FlopsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2011
- SafeChoice: A Novel Approach to Hypergraph Clustering for Wirelength-Driven PlacementIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2011
- TSV-aware analytical placement for 3D IC designs2011
- Placement-Proximity-Based Voltage Island Grouping Under Performance RequirementIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2007
- A semi-persistent clustering technique for VLSI circuit placement2005
- Fast Algorithms for Multiple Evaluations of the Riemann Zeta FunctionTransactions of the American Mathematical Society, 1988
- Fast algorithms for multiple evaluations of the Riemann zeta functionTransactions of the American Mathematical Society, 1988