Articles | Volume 1
https://doi.org/10.5194/ars-1-191-2003
https://doi.org/10.5194/ars-1-191-2003
05 May 2003
05 May 2003

A novel bottom-left packing genetic algorithm for analog module placement

L. Zhang and U. Kleine

Abstract. This paper presents a novel genetic algorithm for analog module placement. It is based on a generalization of the two-dimensional bin packing problem. The genetic encoding and operators assures that all constraints of the problem are always satisfied. Thus the potential problems of adding penalty terms to the cost function are eliminated, so that the search configuration space decreases drastically. The dedicated cost function covers the special requirements of analog integrated circuits. A fractional factorial experiment was conducted using an orthogonal array to study the algorithm parameters. A meta-GA was applied to determine the optimal parameter values. The algorithm has been tested with several local benchmark circuits. The experimental results show this promising algorithm makes the better performance than simulated annealing approach with the satisfactory results comparable to manual placement.