SIMULATED ANNEALING ALGORITHM FOR MODERN VLSI FLOORPLANNING PROBLEM

Journal Title: ICTACT Journal on Microelectronics - Year 2016, Vol 2, Issue 1

Abstract

In floorplanning, our aim is to determine the relative locations of the blocks in the chip and the objective is to minimize the floorplan area, wirelength. Generally, there are so many strategies in VLSI floorplanning like area optimization, wirelength optimization, power optimization, temperature optimization and etc. This paper concentrates on area optimization. The goal of the physical design process is to design the VLSI chip with minimum area. The primary idea is to minimize the floorplan area by reshaping the blocks which are present inside the floorplan in order to attain the minimum area with less computational time. Proposed problem is redefined with an efficient meta-heuristic as Simulated Annealing algorithm which will provide optimal solution with less computation time. The proposed algorithm has been tested by using set of benchmarks of Microelectronics Centre of North Carolina (MCNC).The performance of the proposed algorithm is compared with other stochastic algorithms reported in the literature and is found to be efficient in producing floorplan with minimal area. The performance of the proposed algorithm seems to be better than the existing algorithms.

Authors and Affiliations

Jenifer J, Anand S, Levingstan Y

Keywords

Related Articles

WHALE OPTIMIZED PID CONTROLLERS FOR LFC OF TWO AREA INTERCONNECTED THERMAL POWER PLANTS

This paper elaborates the application of new nature inspired algorithm; ‘Whale Optimization Algorithm (WOA)’ in load frequency control of two area interconnected non-reheat thermal power plants. Two number of PID control...

IMPLEMENTATION OF SOFT PROCESSOR BASED SOC FOR JPEG COMPRESSION ON FPGA

With the advent of semiconductor process and EDA tools technology, IC designers can integrate more functions. However, to reduce the demand of time-to-market and tackle the increasing complexity of SoC, the need of fast...

SIMULATED ANNEALING ALGORITHM FOR MODERN VLSI FLOORPLANNING PROBLEM

In floorplanning, our aim is to determine the relative locations of the blocks in the chip and the objective is to minimize the floorplan area, wirelength. Generally, there are so many strategies in VLSI floorplanning li...

IMPROVING SYSTEM PERFORMANCE BY USING PREFIX ADDERS IN RNS

Over the past few decades, the intense growth of portable communication devices has led to stringent need of efficient system performance. The system performance is upgraded by reducing the computation time using the Res...

DESIGN AND ANALYSIS OF PERFORATED SI-DIAPHRAGM BASED MEMS PRESSURE SENSOR FOR ENVIRONMENTAL APPLICATIONS

The design is advanced which is an intelligent of calculating the output responses of perforated Si-diaphragm pressure sensor as a behavior of pressure and which compare them to piezoresistive Si-diaphragm. The systemati...

Download PDF file
  • EP ID EP198120
  • DOI 10.21917/ijme.2016.0030
  • Views 138
  • Downloads 0

How To Cite

Jenifer J, Anand S, Levingstan Y (2016). SIMULATED ANNEALING ALGORITHM FOR MODERN VLSI FLOORPLANNING PROBLEM. ICTACT Journal on Microelectronics, 2(1), 175-181. https://europub.co.uk/articles/-A-198120