An Improved Harmony Search Approach for Block Placement for VLSI Design Automation
نویسندگان
چکیده
Level of knowledge with the field for VLSI IC Design’s Placement and Routing in area Wireless Communication is rapidly evolving; Hence process designing above fields critical to assimilate a higher quantity computation elements or nodes into very compact size Area also same applicable Communications cover more number specific area. Prior completing placement, physical technical arranging chip planned, which nothing than step analogous coverage communication. Floorplanning must be done properly reduce given placement ICDie. The proposed work suggests an ImprovisedHarmonySearch-IHS Optimization Algorithm, Sequential combination HarmonySearch (HS) Algorithm most effective Particle Swarm (PSO) achieve major objective approach Communication. aim at this point gap between standard benchmark circuit obtained corresponding circuit. MATLAB code recreated, discoveries are tested better inspection using MCNC, North Carolina Microelectronics Center circuits suggest adopt results
منابع مشابه
Global Placement Techniques for VLSI Physical Design Automation
VLSI physical design automation plays a vital role as we move to deep sub-micron designs below 0.18 microns. Power dissipation, performance and area are dominated by interconnections between elements in the circuit under consideration. Global Placement followed by iterative improvement placement (detailed placement) is the most robust, simple and successful approach in solving the placement pro...
متن کاملEFFICIENCY OF IMPROVED HARMONY SEARCH ALGORITHM FOR SOLVING ENGINEERING OPTIMIZATION PROBLEMS
Many optimization techniques have been proposed since the inception of engineering optimization in 1960s. Traditional mathematical modeling-based approaches are incompetent to solve the engineering optimization problems, as these problems have complex system that involves large number of design variables as well as equality or inequality constraints. In order to overcome the various difficultie...
متن کاملAn improved opposition-based Crow Search Algorithm for Data Clustering
Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...
متن کاملAn Improved Harmony Search Algorithm for Constrained Multi-Objective Optimization
An improved harmony search algorithm for constrained multi-objective optimization problems is proposed in this paper. Inspired by Particle Swarm Optimization, an inductor particle is introduced to speed up the convergence rate of the CMOHS. Two populations are adopted to increase the opportunity of finding the optimal solutions. Numerical experiments are divided into two parts: the first one co...
متن کاملAn improved global-best harmony search algorithm for faster optimization
In this paper, an improved global-best harmony search algorithm, named IGHS, is proposed. In the IGHS algorithm, initialization based on opposition-based learning for improving the solution quality of the initial harmony memory, a new improvisation scheme based on differential evolution for enhancing the local search ability, a modified random consideration based on artificial bee colony algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Wireless Personal Communications
سال: 2022
ISSN: ['1572-834X', '0929-6212']
DOI: https://doi.org/10.1007/s11277-022-09909-2