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

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Ullah, Noor, Yahya, Khawaja M., Ahmed, Irfan
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913183196774400
author Ullah, Noor
Yahya, Khawaja M.
Ahmed, Irfan
author_facet Ullah, Noor
Yahya, Khawaja M.
Ahmed, Irfan
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2401_01265
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Optimal Synthesis of Finite State Machines with Universal Gates using Evolutionary Algorithm
Ullah, Noor
Yahya, Khawaja M.
Ahmed, Irfan
Neural and Evolutionary Computing
Artificial Intelligence
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.
title Optimal Synthesis of Finite State Machines with Universal Gates using Evolutionary Algorithm
topic Neural and Evolutionary Computing
Artificial Intelligence
url https://arxiv.org/abs/2401.01265