CMOL Cell Assignment using Particle Swarm Optimization

نویسندگان

  • Tanvi Vaidya
  • Abhijeet Kumar
چکیده

–CMOL cell assignment Problem (BP) is a telecommunication problem. CMOL cell assignment problem is very complex due to its constraint. In CMOL cell digital circuits are mapped to the CMOL cell. Each component of digital circuit is assigned to a particular cell. For mapping a digital circuit to the CMOL cell we have to first convert the circuit in to NOR gate form. In this paper we have present a CMOL cell assignment using particle swarm optimization algorithm. Our method transforms any logically synthesized circuit based on AND/OR/NOT gates to a NOR gate circuit and maps the NOR gates to CMOL. Particle swarm optimization (PSO) is a very popular algorithm and solves many optimization problems very efficiently from the last decades. We have consider all the constraints of CMOL cell assignment problem and tested our method on ISCAS benchmark circuits. We have compared our method with the genetic algorithm method and found that our algorithm works better than the genetic algorithm. Keywords––Field programmable gate array (FPGA), nanodevice, reconfigurable computing, Particle swarm optimization(PSO), Genetic algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cell-to-switch assignment in cellular networks using barebones particle swarm optimization

Cell assignment is an important issue in the area of resource management in cellular networks. The problem is an NP-hard one and requires efficient search techniques for its solution in real-time. In this letter, in order to minimize the cabling and handoff costs, we use two novel discrete particle swarm optimization (PSO) algorithms, the barebones (BB) and the exploiting barebones (BBExp) PSO ...

متن کامل

An Hybrid Fuzzy Variable Neighborhood Particle Swarm Optimization Algorithm for Solving Quadratic Assignment Problems

Recently, Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems. A quick review of the literature reveals that research for solving the Quadratic Assignment Problem (QAP) using PSO approach has not much been investigated. In this paper, we design a hybrid meta-heuristic fuzzy scheme, called as variable neighborhood fuzzy particle ...

متن کامل

Particle Swarm Optimization For Quadratic Assignment Problems–A Forma Analysis Approach

Particle Swarm Optimization (PSO) is an innovative and competitive optimization technique for numerical optimization with real-parameter representation. This paper examines the working mechanism of PSO in a principled manner with forma analysis and investigates the applicability of PSO on the Quadratic Assignment Problem (QAP). Particularly, the derived PSO operator for QAP is empirically studi...

متن کامل

A Multi-Objective Particle Swarm Optimization for Mixed-Model Assembly Line Balancing with Different Skilled Workers

This paper presents a multi-objective Particle Swarm Optimization (PSO) algorithm for worker assignment and mixed-model assembly line balancing problem when task times depend on the worker’s skill level. The objectives of this model are minimization of the number of stations (equivalent to the maximization of the weighted line efficiency), minimization of the weighted smoothness index and minim...

متن کامل

Minimization of Mobile-network Channel Interference Using Particle Swarm Optimization

The global increase in the demand for mobile communication services has raised the need for efficient channel assignment within the limited available bandwidth available to wireless network operators hence one of the most important challenges faced by these operator is that of efficiently assigning available channels such that the utilization of available bandwidth is maximized while minimizing...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012