ABSTRACT
Modern circuit designs often contain standard cells of different row heights to meet various design requirements. Due to the higher interference among heterogeneous cell structures, the legalization problem for mixed-cell-height standard cells becomes more challenging. In this paper, we present an analytical legalization algorithm for mixed-cell-height standard cells to simultaneously minimize the average and the maximum cell movements. We formulate it as a mixed integer quadratic programming problem (MIQP), which allows cell spreading concurrently in both the horizontal and vertical directions. By relaxing its discrete constraints to linear ones, we convert the MIQP into a quadratic programming problem (QP). To solve the QP efficiently, we further reformulate it as a linear complementarity problem (LCP), and solve the LCP by a modulus-based matrix splitting iteration method (MMSIM). To guarantee the convergence of the MMSIM and the equivalence between the QP and the LCP, we use a series of operations to ensure that its induced objective matrix is symmetric positive definite and its constraint matrix is of full row rank. Experimental results demonstrate the effectiveness of our algorithm in reducing both the average and the maximum cell movements for mixed-cell-height legalization.
- CPLEX. (2018 May) {Online}. Available: http://www-01.ibm.com.Google Scholar
- S. H. Baek, H. Y. Kim, Y. K. Lee, D. Y. Jin, S. C. Park, and J. D. Cho. Ultra high density standard cell library using multi-height cell structure. In Proceedings of SPIE 7268, pages 72680C--72680C, 2008.Google ScholarCross Ref
- Z. Z. Bai. Modulus-based matrix splitting iteration methods for linear complementarity problems. Numerical Linear Algebra with Applications, 17(6):917--933, December 2010.Google ScholarCross Ref
- U. Brenner. Bonnplace legalization: Minimizing movement by iterative augmentation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 32(8):1215--1227, 2013. Google ScholarDigital Library
- J. Chen, Z. Zhu, W. Zhu, and Y.-W. Chang. Toward optimal legalization for mixed-cell-height circuit designs. In Proceedings of ACM/IEEE Design Automation Conference, 2017. Google ScholarDigital Library
- M. Cho, H. Ren, H. Xiang, and R. Puri. History-based VLSI legalization using network flow. In Proceedings of ACM/IEEE Design Automation Conference, pages 286--291, 2010. Google ScholarDigital Library
- W.-K. Chow, C.-W. Pui, and E. F. Y. Young. Legalization algorithm for multiplerow height standard cell design. In Proceedings of ACM/IEEE Design Automation Conference, 2016. Google ScholarDigital Library
- N. K. Darav, I. S. Bustany, A. Kennings, and L. Behjat. A fast, robust network flow-based standard-cell legalization method for minimizing maximum movement. In Proceedings of ACM International Symposium on Physical Design, 2017. Google ScholarDigital Library
- N. K. Darav, I. S. Bustany, A. Kennings, and R. Mamidi. ICCAD-2017 CAD Contest in multi-deck standard cell legalization and benchmarks suite. In Proceedings of IEEE/ACM International Conference on Computer-Aided Design, 2017. Google ScholarDigital Library
- N. K. Darav, A. Kennings, A. F. Tabrizi, D. Westwick, and L. Behjat. Eh?placer: A high-performance modern technology-driven placer. ACM Transactions on Design Automation of Electronic Systems, 21(3):37:1--37:27, April 2016. Google ScholarDigital Library
- S. Dobre, A. B. Kahng, and J. Li. Mixed cell-height implementation for improved design quality in advanced nodes. In Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pages 854--860, 2015. Google ScholarDigital Library
- C.-Y. Hung, P.-Y. Chou, and W.-K. Mak. Mixed-cell-height standard cell placement legalization. In Proceedings of Great Lakes Symposium on VLSI, 2017. Google ScholarDigital Library
- A. B. Kahng, I. L. Markov, and S. Reda. On legalization of row-based placements. In Proceedings of Great Lakes Symposium on VLSI, pages 214--219, 2004. Google ScholarDigital Library
- J. Munkres. Algorithms for the assignment and transportation problems. Journal of the Society for Industrial and Applied Mathematics, 5(1):32--38, March 1957.Google ScholarCross Ref
- J. Nocedal and S. J. Wright. Numerical optimization. New York: Springer, 2006.Google Scholar
- C.-H. Wang, Y.-Y. Wu, J. Chen, Y.-W. Chang, S.-Y. Kuo, W. Zhu, and G. Fan. An effective legalization algorithm for mixed-cell-height standard cells. In Proceedings of IEEE/ACM Asia and South Pacific Design Automation Conference, 2017.Google ScholarCross Ref
- G.Wu and C. Chu. Detailed placement algorithm for VLSI design with double-row height standard cells. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 35(9):1569--1573, 2015.Google ScholarCross Ref
Recommendations
Linear-time Mixed-Cell-Height Legalization for Minimizing Maximum Displacement
ISPD '22: Proceedings of the 2022 International Symposium on Physical DesignDue to the aggressive scaling of advanced technology nodes, multiple-row-height cells have become more and more common in VLSI design. Consequently, the placement of cells is no longer independent among different rows, which makes the traditional row-...
A Robust Modulus-Based Matrix Splitting Iteration Method for Mixed-Cell-Height Circuit Legalization
Modern circuits often contain standard cells of different row heights to meet various design requirements. Taller cells give larger drive strengths and higher speed at the cost of larger areas and power. Multi-row height standard cells incur challenging ...
Mixed-Cell-Height Standard Cell Placement Legalization
GLSVLSI '17: Proceedings of the on Great Lakes Symposium on VLSI 2017A traditional standard cell library consists of various functional cells with the same height, which could speed up VLSI design flow since designers could align cells to placement sites in rows. However, in advanced nodes, cells are designed with ...
Comments