Abstract
We consider in this paper the problem of slicing floorplan design with boundary-constrained modules. We develop a quadratic-time method that correctly transforms a slicing floorplan into one that satisfies all given boundary constraints. The transformation method is incorporated into our floorplanning algorithm which employs the simulated annealing technique to seek for a possibly best solution. Unlike any other existing algorithm such as the one in [10], our floorplanning algorithm is always able to generate solutions satisfying all given boundary constraints. Furthermore, the experimental results indicate that our floorplanning algorithm can also generate solutions with smaller area and interconnect wirelength than the algorithm in [10].