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

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.

[1]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[2]  Neil Urquhart,et al.  State assignment for sequential circuits using multi-objective genetic algorithm , 2011, IET Comput. Digit. Tech..

[3]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[4]  Douglas B. Armstrong,et al.  A Programmed Algorithm for Assigning Internal Codes to Sequential Machines , 1962, IRE Trans. Electron. Comput..

[5]  Alexander Sudnitson,et al.  Low power state assignment using ILP techniques , 2010, Melecon 2010 - 2010 15th IEEE Mediterranean Electrotechnical Conference.

[6]  Faisal Nawaz Khan,et al.  FSM state-assignment for area, power and testability using non-deterministic evolutionary heuristics , 2005 .

[7]  P. R. Stephan,et al.  SIS : A System for Sequential Circuit Synthesis , 1992 .

[8]  Sadiq M. Sait,et al.  FSM State-Encoding for Area and Power Minimization Using Simulated Evolution Algorithm , 2012 .

[9]  Santanu Chattopadhyay,et al.  Genetic algorithm-based FSM synthesis with area-power trade-offs , 2009, Integr..

[10]  Tomasz Grzes,et al.  FSM State Assignment Methods for Low-Power Design , 2007, 6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07).

[11]  S. Chattopadhyay,et al.  State assignment and selection of types and polarities of flip-flops, for finite state machine synthesis , 2004, Proceedings of the IEEE INDICON 2004. First India Annual Conference, 2004..

[12]  Sadiq M. Sait,et al.  Iterative computer algorithms with applications in engineering - solving combinatorial optimization problems , 2000 .

[13]  Robert K. Brayton,et al.  Optimal State Assignment for Finite State Machines , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[14]  N. Nedjah,et al.  Evolutionary Synthesis of Synchronous Finite State Machines , 2006, 2006 International Conference on Computer Engineering and Systems.

[15]  P. Ashar,et al.  Sequential Logic Synthesis , 1991 .

[16]  A. E. A. Almaini,et al.  State assignment of finite state machines using a genetic algorithm , 1995 .

[17]  Santanu Chattopadhyay,et al.  Integrated Power-Gating and State Assignment for Low Power FSM Synthesis , 2008, 2008 IEEE Computer Society Annual Symposium on VLSI.

[18]  A. Richard Newton,et al.  MUSE: a multilevel symbolic encoding algorithm for state assignment , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[19]  Alberto L. Sangiovanni-Vincentelli,et al.  MUSTANG: state assignment of finite state machines targeting multilevel logic implementations , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[20]  Bernhard Eschermann,et al.  State assignment for hardwired VLSI control units , 1993, CSUR.

[21]  M. A. Khanesar,et al.  A novel binary particle swarm optimization , 2007, 2007 Mediterranean Conference on Control & Automation.

[22]  José Nelson Amaral,et al.  State assignment algorithm for incompletely specified finite state machines , 1990, Other Conferences.

[23]  Sadiq M. Sait,et al.  Finite state machine state assignment for area and power minimization , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[24]  Tiziano Villa,et al.  NOVA: State Assignment of Finite State Machines for Optimal Two-Level Logic Implementations , 1989, 26th ACM/IEEE Design Automation Conference.

[25]  Walid Mohamed Aly.  Solving the State Assignment Problem Using Stochastic Search Aided with Simulated Annealing , 2009 .

[26]  Yinshui Xia,et al.  Genetic algorithm based state assignment for power and area optimisation , 2002 .