Certain optimization techniques for Floorplanning in vlsi physical design

Abstract

newlineFloorplanning is an important stage in VLSI Very Large Scale newlineIntegrated Circuits physical design cycle as it determines the performance newlinesize and reliability of VLSI chips Given a set of circuit components or newline modules and a netlist specifying interconnections between the modules the newlinegoal of VLSI floorplanning is to find a floorplan for the modules such that no newlinemodule overlaps with another and the area of the floorplan and the newlineinterconnection between the modules are minimized The representation of newlinefloorplans determines the size of the search space and the complexity of newlinetransformation between a representation and its corresponding floorplan newlineThe objective of this thesis work entails evaluating the use of newlineParticle Swarm Optimization PSO to produce solutions for the VLSI newlinefloorplanning problems This work also demonstrates the successful newlineapplication of Differential Evolution DE an improved version of Genetic newlineAlgorithm GA to the VLSI floorplanning problems The important newlineadvantages of DE are its simplicity fast convergence and easy for newlineimplementation Sequence Pair SP representation with PSO HPSO and DE newlinealgorithms for VLSI floorplanning are proposed Hybrid Particle Swarm newlineOptimization HPSO utilizes the basic mechanism of PSO and the natural newlineselection mechanism which is usually utilized by GA newline newline