A Novel High Speed Simulated Annealing Algorithm for Non-Slicing VLSI Floorplanning using B*-Tree Representation

Objective: To optimise area, interconnecting wirelength and dead space of very large scale integration non-slicing floorplan with high computation speed using evolutionary algorithm intelligently. Methods/Statistical Analysis: Floorplanning is one of the most important steps in physical design automation in very large scale integration (VLSI) and to solve the problem of VLSI floorplanning is an art. Parameters like chip performance, sizing of modules in a chip, yield and reliability of chip are determined using VLSI floorplanning. The Simulated algorithm and B*-tree structure have been implemented in C++ language and compiled in GCC compiler of Ubuntu14.04. Findings: Parameters like chip performance, sizing of modules in a chip, yield and reliability of chip are determined using VLSI floorplanning. Many computer-aided design algorithms are developed for the NP-hard problems like VLSI floorplanning. A simulated annealing (SA) algorithm for the hard module and non-slicing VLSI floorplanning problem is presented. The SA uses a new acquisitive method to construct an initial B*-tree and a new process to explore the search space. Application/Improvements: The SA has been implemented and experimental result with optimisation of area, dead space, wirelength and best timing constraints have been tested on Microelectronic Center of North Carolina (MCNC) benchmarks.