Total views : 188
Computational Optimization of Placement and Routing using Genetic Algorithm
In the VLSI chip designing process, Floor-planning is one of the vital stages which in turn have Placement and Routing tasks. This paper concentrates on solving the problems which occur in VLSI floor planning and gives an overview of placement and routing problems in ICs. This approach depends on recursive optimization prototypes with redefined algorithm. The searching for best solutions is carried out by Genetic Algorithm (GA) on each iteration since these algorithms is already known and proven to solve similar type of problems. GA has been tested randomly and is simulated. By conducting experiments on GA we can realize optimized solutions for the above said problems.
Field Programmable Gate Arrays (FPGA) Placement, Genetic Algorithm (GA), VLSI Design.
- Guo PN, Takahashi T, Cheng C.-K, Yoshimura T. Floor Planning Using a Tree Representation, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.2001; 20:281–89.
- Setareh Shafaghi, Fardad Farokhi, Reza Sabbaghi- Nadooshan.New Ant Colony Algorithm Method based on
- Mutuation for FPGA Placement Problem, J. Smart Electrical Engineering. 2.1. Winter 2013; 2251-9246:F 53−60.
- Iztok Fister Jr, Xin-She Yang, Iztok Fister, Janez Brest, Dusan Fister. A Brief Review of Nature – Inspired Algorithms for Optimization, Elektrotehnisk Vestnik (Eng. ed.). 2013; 80(3):1−7.
- Manuel Rubio del Solar, Juan Manuel Sanchez Perez, Juan Antonio Gomez Pulido, Miguel Angel Vega Rodriguez. Genetic Algorithms for Solving the Placement and Routing Problem of an FPGA with Area Constraints, 31−32.
- Ednaldo Mariano, Vasconcelos de Lima, Antonio Carlos Cavalcanti, Lucidio dos Anjos Formiga Cabral. A New Approach to VPR Tool’s Placement. WCECS 2007, [C] ISBN:978-988-98671-6-4.
- Premalatha B, Umamaheswari S. Attractive and Repulsive PSO Algorithm based Wire Length Minimization in FPGA Placement, IJVSDCS, Jul 2015.
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.