GENETIC ALGORITHM APPROACH TO SYNTHESIS OF 2, 2 FULL ADDER LOGIC NETWORK

Authors

  • I. A. Mowete University of Lagos, Akoka, Lagos State, Nigeria.
  • F. A. Semire Ladoke Akintola University of Technology, Ogbomoso, Oyo State, Nigeria
  • A. A. Yusuff Ladoke Akintola University of Technology, Ogbomoso, Oyo State, Nigeria

Abstract

The problem of synthesizing a minimum cost logic circuit is formulated via a genetic algorithm (GA). The synthesis proposes a scheme that “evolves” the minimized logic solution of a defined input function. A method employed combines the available logic gates in several of ways until a minimized and best result is achieved. The result obtained showed a considerable improvement over the existing methods.

Key words: genetic algorithm, logic synthesis, full adder network and sum of products form.

Author Biographies

I. A. Mowete, University of Lagos, Akoka, Lagos State, Nigeria.

Department of Electrical and Electronics

F. A. Semire, Ladoke Akintola University of Technology, Ogbomoso, Oyo State, Nigeria

Department of Electronics and Electrical Engineering

A. A. Yusuff, Ladoke Akintola University of Technology, Ogbomoso, Oyo State, Nigeria

Department of Electrical and Electronics Engineering

Downloads

Published

2007-02-07

How to Cite

Mowete, I. A., Semire, F. A., & Yusuff, A. A. (2007). GENETIC ALGORITHM APPROACH TO SYNTHESIS OF 2, 2 FULL ADDER LOGIC NETWORK. LAUTECH Journal of Engineering and Technology, 4(1), 16–20. Retrieved from https://laujet.com/index.php/laujet/article/view/180

Issue

Vol. 4 No. 1 (2007): Vol. 4 No. 1

Section

Articles