VLSI concentric partitioning using interior point quadratic programming

This paper presents a novel approach for solving the standard cell placement problem. A relaxed quadratic formulation of the problem is solved iteratively incorporating techniques to increase the spreading of cells, including introducing attractors and dynamic first moment constraints. At each iteration, a percentage of the cells that are close to the boundary of the chip are fixed. This procedure is done recursively until at least eighty percent of the cells are fixed. Numerical simulation of the proposed approach is presented for test systems