Vlsi Floorplanning Using Sequence Pair and Differential Evolution Algorithm
ثبت نشده
چکیده
This chapter presents the application of Differential Evolution (DE) Algorithm for the VLSI floorplanning problems. DE Algorithm has been successfully applied to VLSI sequence pair representation. The important advantages of DE are its simplicity, fast convergence, and easy for implementation. DE algorithm is a population based algorithm like GA using similar operators such as crossover, mutation and selection. Simulation results on MCNC benchmark circuits show that, convergence speed of DE is significantly better than SA, PSO and HPSO algorithms. These results demonstrate that the DE offers a viable tool to VLSI floorplanning problems.
منابع مشابه
A Sequence Pair-Based Non-Slicing Floorplanner for Uncertain Designs
Floorplanning is an important step in an early phase of VLSI design. For faster design convergence, there is an urgent need to start floorplanning as early as possible, even when not all modules are designed. Therefore, it is desirable to consider floorplanning with uncertainty to obtain a compact and reliable floorplan when the dimensions and interconnections of modules are not fully determine...
متن کاملA Heuristic Approach for VLSI Floorplanning
Floorplanning is an essential step in VLSI chip design automation. The main objective of the floorplanning is to find a floorplan such that the cost is minimized. This is achieved by minimizing the chip area and interconnection cost. It determines the performance, size, yield and reliability of VLSI chips. We propose a Memetic Algorithm (MA) for non-slicing and hard module VLSI floorplanning pr...
متن کاملNon Slicing Floorplan Representations in VLSI Floorplanning: A Summary
Floorplan representation is a fundamental issue in designing a VLSI floorplanning algorithm as the representation has a great impact on the feasibility and complexity of floorplan designs. This survey paper gives an up-to-date account on various nonslicing floorplan representations in VLSI floorplanning.
متن کاملA Survey of Various Metaheuristic Algorithms Used to Solve VLSI Floorplanning Problem
---------------------------------------------------------------------***--------------------------------------------------------------------Abstract Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the computational point of view, VLSI floorplanning is an NP-ha...
متن کاملVariable-Order Ant System for VLSI multiobjective floorplanning
Floorplanning is crucial in VLSI chip design as it determines the time-to-market and the quality of the product. In this work, Variable-Order Ant System (VOAS) is developed and combined with a floorplan model namely Corner List (CL) to optimize the area and wirelength. CL is used to represent the floorplan layout. Although CL has proven to have the same search space and time complexity as Corne...
متن کامل