Analytical approach to the placement problem in gate-arrays

A novel analytical algorithm for determining cell placement in gate-arrays is described. The placement problem is considered as a constrained optimization problem and is solved by a classical optimization method. The objective function and constraint functions of the problem are defined. At the same time, a novel shape model of the cells, a novel reflection function, and a novel row constraint function are introduced. Improvements in objective function definition are also given. One solved example is presented.<
>