An non-slicing area prejudged algorithm for floorplanning without Simulated Annealing

Existing floorplanning algorithms can not get the target area after random perturbation until packing complete, but random perturbation will make the target area larger or less unpredictably. In this paper, an unified non-slicing area prejudged (TCG-AP) algorithm is proposed which can estimate the target area after random perturbation without packing. The prejudged result can indicate whether the perturbation is beneficial to the target area, if isn´t, we discard it and continue next permutation. This process always makes the target area less and less. Unlike most of the existing floorplanning algorithms, our algorithm is running without using SA(Simulated Annealing) process because of the convergence itself. The geometric relations among modules in our algorithm are horizontal/vertical transitive closure graphs based on TCG[1]. Inherited the nice properties from TCG, the solution space is finite (n!*n!) and every solution is feasible. The experimental results with MCNC and GSRC benchmarks, show that our algorithm is efficient and effective to get smaller area.