An algorithm for placement of standard cells in integrated circuit

An algorithm for placement of standard cells in an integrated circuit is discussed. The algorithm for solving the problem is divided into two phases. In each, more than one method is combined to provide better results. In the first one, two methods are combined to define an initial placement of cells. A clustering method is implemented to solve the problem of relative placement, where cells with higher connectivity are placed closer together. A good initial placement, where cells are positioned in their initial locations in rows, is generated by the implemented cluster growth method. In the second phase, the initial placement is iteratively improved.