Efficient Floorplanning by O-Tree with Genetic Algorithm

Module placement is an important phase for VLSI layout design. However, huge time is necessary to obtain the optimal layout. This paper proposes a block packing method using O-Tree with Genetic Algorithm. O-Tree can transform a code into a placement in linear time to the number of modules. Moreover, Genetic Algorithm is effective for searching a good layout because it can search two or more layouts concurrently. In experiment, we have confirmed to obtain nearly optimal packing results efficiently.