Hybrid memetic algorithm for FPGA placement and routing using parallel genetic tunneling

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Field programmable gate array (FPGA) is a programmable chip or flexible and reusable circuits that can be configured or reconfigured by the designer, which can be used to quickly implement any digital circuits. One of the major steps of FPGA design which determines the arrangement of logic blocks is the placement. In this step, the logic functions are assigned to specific cells of the circuit. The quality of the placement of the logic blocks determines the overall performance of the logic implemented in the circuits. In this paper, we proposed a combination of parallel genetic algorithm and stochastic tunneling technique to solve the placement problem. The parallel genetic algorithm treats every logic block as an active individual such that each logic block applies the genetic algorithm simultaneously and does the local hill climbing to reach toward its best solutions, and finally, simulated annealing is done for the local improvement of the best solution such that it converges to a global optimum.

Cite

CITATION STYLE

APA

Eswarawaka, R., Noor Mahammad, S. K., & Eswara Reddy, B. (2015). Hybrid memetic algorithm for FPGA placement and routing using parallel genetic tunneling. In Advances in Intelligent Systems and Computing (Vol. 336, pp. 359–371). Springer Verlag. https://doi.org/10.1007/978-81-322-2220-0_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free