Automated Design of Combinational Logic Circuits by Genetic Algorithms

  • C. A. Coello Coello
  • A. D. Christiansen
  • A. Hernández Aguirre


We introduce a method, based on a genetic algorithm (GA) approach, to design combinational logic circuits. This problem is quite difficult for a traditional GA, but we have overcome these difficulties and have implemented a computer program that can automatically generate high-quality circuit designs. We describe the important issues to consider when solving this circuit design problem: the importance of the representation scheme, the encoding function, and the definition of the fitness function. We present several circuits derived by our system under various assumed constraints, such as the maximum number of allowable gates and the types of available gates. We compare the solutions produced by our system against those generated by a human designer. We also show that our representation approach, when compared to a standard binary encoding, produces better performance both in terms of quality of solution and in terms of speed of convergence.


Genetic Algorithm Logic Circuit Human Designer Combinational Circuit Functional Circuit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R.K. Brayton, G.D. Hachtel, C.T. McMullen, and A.L. Sangiovanni-Vincentelli. Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers, 1984.Google Scholar
  2. [2]
    R.K. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A.R. Wang. Mis: A multiple-level logic optimization system. IEEE Transactions on Computer-Aided Design, CAD-6(6):1062–1081, November 1987.CrossRefGoogle Scholar
  3. [3]
    David E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Reading, Mass.: Addison-Wesley Publishing Co., 1989.MATHGoogle Scholar
  4. [4]
    J.H. Holland. Adaptation in Natural and Artificial Systems. An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence. MIT Press, Cambridge, Massachusetts, 1992.Google Scholar
  5. [5]
    M. Karnaugh. A map method for synthesis of combinational logic circuits. Transactions of the AIEE, Communications and Electronics, 72(I): 593–599, November 1953.MathSciNetGoogle Scholar
  6. [6]
    J.R. Koza. Genetic Programming. On the Programming of Computers by Means of Natural Selection. The MIT Press, 1992.Google Scholar
  7. [7]
    S.J. Louis and G.J. Rawlins. Using genetic algorithms to design structures. Technical Report 326, Computer Science Department, Indiana University, Bloomington, Indiana, feb 1991.Google Scholar
  8. [8]
    S.J. Louis. Genetic Algorithms as a Computational Tool for Design. PhD thesis, Department of Computer Science, Indiana University, aug 1993.Google Scholar
  9. [9]
    E.J. McCluskey. Minimization of boolean functions. Bell Systems Technical journal, 35(5):1417–1444, November 1956.MathSciNetGoogle Scholar
  10. [10]
    W.V. Quine. A way to simplify truth functions. American Mathematical Monthly, 62(9):627–631, 1955.MathSciNetMATHCrossRefGoogle Scholar
  11. [11]
    C.H. Roth, Jr. Fundamentals of Logic Design (4th Edition). West Publishing Company, 1992.Google Scholar
  12. [12]
    C.E. Shannon. A symbolic analysis of relay and switching circuits. Transactions of the AIEE, 57:713–723, 1938.Google Scholar
  13. [13]
    E.W. Veitch. A chart method for simplifying boolean functions. Proceedings of the ACM, pages 127–133, May 1952.Google Scholar

Copyright information

© Springer-Verlag Wien 1998

Authors and Affiliations

  • C. A. Coello Coello
    • 1
  • A. D. Christiansen
    • 2
  • A. Hernández Aguirre
    • 2
  1. 1.246 Julian Science Center, Department of Computer ScienceDePauw UniversityGreencastleUSA
  2. 2.301 Stanley Thomas Hall, Department of Computer ScienceTulane UniversityNew OrleansUSA

Personalised recommendations