Sequence-pair based placement with boundary constraints

Floorplanning is an important stage in the VLSI physical design. In this paper, we present a new algorithm for handling the module placement problem with the consideration of boundary constraints based on the representation of sequence-pair. We integrate the boundary constraints checking rules into the simulated annealing based sequence-pair module placement algorithm such that we can keep the feasibility of the solution in each pertubation. Experimental results on MCNC benchmarks show that our approach is quite promising.