FPGA placement using genetic algorithm with simulated annealing.

Yang, Meng; Almaini, A E A; Wang, Lun Yao; Wang, P

Abstract

A mixed Genetic Algorithm and Simulated Annealing (GASA) algorithm is used for the placement of symmetrical FPGA. The prpoposed algortithm includes 2 stage processes. In the first stage process it optimizes placement solutions globally using GA. In the second stage process it locally improves solution. GASA overcomes the slow convergence in the later phases of processing by a genetic algorithm. The results show that GASA consumes less CPU time than GA and could achieve performances as good as versatile placement and routing tools in terms of placement cost.

Citation

Yang, M., Almaini, A. E. A., Wang, L. Y., & Wang, P. (2005). FPGA placement using genetic algorithm with simulated annealing. ASICON, 2, 808-811. https://doi.org/10.1109/ICASIC.2005.1611450

• Journal Article Type: Article
• Publication Date: Oct 24, 2005
• Deposit Date: May 8, 2009
• Peer Reviewed: Peer Reviewed
• Volume: 2
• Pages: 808-811
• DOI: https://doi.org/10.1109/ICASIC.2005.1611450
• Keywords: Genetic algorithms; Deveopments; Simulated annealing; Computer programming; CPU time; Routing tools; Placement costs
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/2570
• Publisher URL: http://dx.doi.org/10.1109/ICASIC.2005.1611450