Evolutionary algorithms and their use in the design of sequential logic circuits.

Ali, Belgasem; Almaini, A E A; Kalganova, Tatiana

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 the finite state machine (FSM). The second stage defines the subcircuits required to achieve the desired functionality. The third stage evaluates the subcircuits using extrinisic 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.

Citation

Ali, B., Almaini, A. E. A., & Kalganova, T. (2004). Evolutionary algorithms and their use in the design of sequential logic circuits. Genetic Programming and Evolvable Machines, 5, 11-29. https://doi.org/10.1023/B%3AGENP.0000017009.11392.e2

• Journal Article Type: Article
• Publication Date: 2004-03
• Deposit Date: May 7, 2009
• Print ISSN: 1389-2576
• Electronic ISSN: 1573-7632
• Publisher: BMC
• Peer Reviewed: Peer Reviewed
• Volume: 5
• Pages: 11-29
• DOI: https://doi.org/10.1023/B%3AGENP.0000017009.11392.e2
• Keywords: Genetic algorithms; Computer programming; Logic circuits; Logic gates; State assignment; Circuit design; Finite State Machines
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/2569
• Publisher URL: http://dx.doi.org/10.1023/B:GENP.0000017009.11392.e2