Optimal Synthesis of Finite State Machines with Universal Gates using Evolutionary Algorithm

Noor Ullah; Khawaja M. Yahya; Irfan Ahmed

Optimal Synthesis of Finite State Machines with Universal Gates using Evolutionary Algorithm

Neural and Evolutionary Computing 2024-01-03 v1 Artificial Intelligence

Authors: Noor Ullah , Khawaja M. Yahya , Irfan Ahmed

Abstract

This work presents an optimization method for the synthesis of finite state machines. The focus is on the reduction in the on-chip area and the cost of the circuit. A list of finite state machines from MCNC91 benchmark circuits have been evolved using Cartesian Genetic Programming. On the average, almost 30% of reduction in the total number of gates has been achieved. The effects of some parameters on the evolutionary process have also been discussed in the paper.

Keywords

genetic algorithm evolutionary algorithm reversible logic

Cite

@article{arxiv.2401.01265,
  title  = {Optimal Synthesis of Finite State Machines with Universal Gates using Evolutionary Algorithm},
  author = {Noor Ullah and Khawaja M. Yahya and Irfan Ahmed},
  journal= {arXiv preprint arXiv:2401.01265},
  year   = {2024}
}

Related papers

View all related →

Neural and Evolutionary Computing · Computer Science

Finite State Machine Synthesis for Evolutionary Hardware

Andrey Bereza, Maksim Lyashov, Luis Blanco

2013-08-06

Emerging Technologies · Computer Science

Synthesis and Optimization of Multi-Objective Multi-Output QCA Circuit using Genetic Algorithm

Mahabub Hasan Mahalat, Mrinal Goswami, Anindan Mondal, Bibhash Sen