Wirelength-driven fast placement algorithm for island style FPGAs

Traditional FPGA placement algorithms take much time, which decreases the FPGA physical design efficiency. In order to speed up the placement time and still keep the quality, a fast placement method for island-style FPGAs is proposed, which includes recursive bi-partition with terminal propagation consideration, minimum-cost flow initial placement and low temperature simulated annealing optimization. It applies iterative binary partitioning in each level considering the terminal propagation. For each partitioned region, minimum-cost flow algorithm is used to determine the initial placement. And then the simulated annealing algorithm with low temperature is used to improve the initial placement result. Experimental results show the efficiency and effectiveness of our algorithm.