Fast FPGA placement Algorithm using Quantum Genetic Algorithm with Simulated Annealing

Field-Programmable Gate Array (FPGA) attracts more and more attentions in the digital-design field for its excellent features such as reconfiguration and fast time to market. But the implementation of FPGA is restricted by its hardware framework and the CAD software. This paper proposes Quantum Genetic Algorithm with Simulated Annealing (QGASA) as a hybrid FPGA placement algorithm, which combined the advantage of the fast global search ability of QGA and local adjusting ability of Simulated Annealing (SA) algorithm. The experimental results are compared with the state-of-the-art placement tool Versatile Place and Route (VPR) by running the MCNC benchmark circuits. The results show that the path-timing driven cost of QGASA is similar to VPR, but the overall CPU time is reduced by 70%.