Discrete Multi Objective Particle Swarm Optimization Algorithm for FPGA Placement

Abstract

Placement process is one of the vital stages in physical design. In this stage, modules and elements of the circuit are placed in distinct locations based on optimizationp rocesses. Hence, each placement process influences one or more optimization factor. On the other hand, it can be statedunequiv ocally that FPGA is one of the most important and applicable devices in our electronic world. So, it is vital to spend time forbetter learning of its structure. VLSI science looks for new techniques for minimizing the expense of FPGA in order to gain better performance. Diverse algorithms are used for running FPGA placement procedures. It is known that particle swarm optimization (PSO) is one of the practical evolutionary algorithms for this kind of applications. So, this algorithm is used for solving placement problems. In this work, a novel method for optimized FPGA placement has been used. According to this process, the goal is to optimize two objectives defined as wire length and overlap removal functions. Consequently, we are forced to use multi-objective particle swarm optimization (MOPSO) in the algorithm. Structure of MOPSO is such that it introduces set of answers among which we have tried to find a unique answer with minimum overlap. Itis worth noting that discrete nature of FPGA blocks forced us to use a discrete version of PSO. In fact, we need a combination of multi-objecti ve PSO and discrete PSO for achieving our goals in optimization process. Tested on some of FPGA benchmark (MCNC benchmark) are shown in experimental results section, compared with popular method VPR. These show that proper selection of FPGA 's size and reasonable number of blocks can giveus good response.