Evolutionary Algorithms and Theirs Use in the Design of Sequential Logic Circuits

  • Authors:
  • B. Ali;A. E. A. Almaini;T. Kalganova

  • Affiliations:
  • School of Engineering, Napier University, 10 Colinton Road, Edinburgh, EH10 5DT, UK/ b.ali@napier.ac.uk;School of Engineering, Napier University, 10 Colinton Road, Edinburgh, EH10 5DT, UK/ a.almaini@napier.ac.uk;Electrical and Computer Engineering Department, Brunel University, Uxbridge, UB8 3PH, Middlesex, UK/ tatiana.kalganova@brunel.ac.uk

  • Venue:
  • Genetic Programming and Evolvable Machines
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper an approach based on an evolutionary algorithm to design synchronous sequential logic circuits with minimum number of logic gates is suggested. The proposed method consists of four main stages. The first stage is concerned with the use of genetic algorithms (GA) for the state assignment problem to compute optimal binary codes for each symbolic state and construct the state transition table of finite state machine (FSM). The second stage defines the subcircuits required to achieve the desired functionality. The third stage evaluates the subcircuits using extrinsic Evolvable Hardware (EHW). During the fourth stage, the final circuit is assembled. The obtained results compare favourably against those produced by manual methods and other methods based on heuristic techniques.