scispace - formally typeset
Journal ArticleDOI

Binary particle swarm optimization (BPSO) based state assignment for area minimization of sequential circuits

TLDR
An improved binary particle swarm optimization (BPSO) algorithm is proposed and its effectiveness in solving the state assignment problem in sequential circuit synthesis targeting area optimization is demonstrated.
Abstract
State assignment (SA) for finite state machines (FSMs) is one of the main optimization problems in the synthesis of sequential circuits It determines the complexity of its combinational circuit and thus area, delay, testability and power dissipation of its implementation Particle swarm optimization (PSO) is a non-deterministic heuristic that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality PSO optimizes a problem by having a population of candidate solutions called particles, and moving them around in the search-space according to a simple mathematical formulae In this paper, we propose an improved binary particle swarm optimization (BPSO) algorithm and demonstrate its effectiveness in solving the state assignment problem in sequential circuit synthesis targeting area optimization It will be an evident that the proposed BPSO algorithm overcomes the drawbacks of the original BPSO algorithm Experimental results demonstrate the effectiveness of the proposed BPSO algorithm in comparison to other BPSO variants reported in the literature and in comparison to Genetic Algorithm (GA), Simulated Evolution (SimE) and deterministic algorithms like Jedi and Nova

read more

Citations
More filters
Journal ArticleDOI

A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

TL;DR: This survey presented a comprehensive investigation of PSO, including its modifications, extensions, and applications to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology.
Journal ArticleDOI

An Analysis of the Inertia Weight Parameter for Binary Particle Swarm Optimization

TL;DR: The experimental results on 0/1 knapsack problems show that the BPSO with the new increasing inertia weight scheme performs significantly better than that with the conventional decreasing and constant inertia weight schemes.
Journal ArticleDOI

Particle Swarm Optimization: A Comprehensive Survey

- 01 Jan 2022 - 
TL;DR: Particle swarm optimization (PSO) is one of the most well-regarded swarm-based algorithms in the literature as mentioned in this paper , and many researchers have been modifying it resulting in a large number of PSO variants with either slightly or significantly better performance.
Journal ArticleDOI

Interactive search algorithm: A new hybrid metaheuristic optimization algorithm

TL;DR: The achieved numerical results demonstrate that the proposed method is competitive with other well-established metaheuristic methods.
Journal ArticleDOI

A New Binary Particle Swarm Optimization Approach: Momentum and Dynamic Balance Between Exploration and Exploitation

TL;DR: This article proposes a new algorithm called dynamic sticky binary PSO by developing a dynamic parameter control strategy based on an investigation of exploration and exploitation in the binary search spaces to evolve better solutions for binary problems.
References
More filters
Proceedings ArticleDOI

Particle swarm optimization

TL;DR: A concept for the optimization of nonlinear functions using particle swarm methodology is introduced, and the evolution of several paradigms is outlined, and an implementation of one of the paradigm is discussed.
Proceedings ArticleDOI

A discrete binary version of the particle swarm algorithm

TL;DR: The paper reports a reworking of the particle swarm algorithm to operate on discrete binary variables, where trajectories are changes in the probability that a coordinate will take on a zero or one value.
Journal Article

SIS : A System for Sequential Circuit Synthesis

TL;DR: This paper provides an overview of SIS and contains descriptions of the input specification, STG (state transition graph) manipulation, new logic optimization and verification algorithms, ASTG (asynchronous signal transition graph] manipulation, and synthesis for PGA’s (programmable gate arrays).
Proceedings ArticleDOI

A novel binary particle swarm optimization

TL;DR: This algorithm is shown to be a better interpretation of continuous PSO into discrete PSO than the older versions and a number of benchmark optimization problems are solved using this concept and quite satisfactory results are obtained.
Book

Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems

TL;DR: For each algorithm, the authors present the procedures of the algorithm, parameter selection criteria, convergence property analysis, and parallelization, and several real-world examples that illustrate various aspects of the algorithms.