An efficient solution space for floorplan of 3D-LSI

One of the methods to obtain good floorplans for 3D-LSI is, to search for good solutions by simulated annealing, a famous stochastic search algorithm, based on a representation of placement or rectangular dissection. Since we think that redundantly large variety of adjacent solutions for stochastic search degrades convergence of the searching, in this paper, we proposed Single-SP, which represents relative position of modules for each device layer by one sequence-pair and a sequence of numbers, and MOVE operations which have small variety of adjacent solutions. The effectiveness of the proposed representation and MOVE operations were confirmed by experimental comparisons.