Automated Synthesis of Computational Circuits Using Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.3973

@InProceedings{koza:1997:ascc,
  author =       "John R. Koza and Forrest H {Bennett III} and 
                 Jason Lohn and Frank Dunlap and Martin A. Keane and 
                 David Andre",
  title =        "Automated Synthesis of Computational Circuits Using
                 Genetic Programming",
  booktitle =    "Proceedings of the 1997 {IEEE} International
                 Conference on Evolutionary Computation",
  year =         "1997",
  pages =        "447--452",
  address =      "Indianapolis",
  publisher_address = "Piscataway, NJ, USA",
  month =        "13-16 " # apr,
  publisher =    "IEEE Press",
  keywords =     "genetic algorithms, genetic programming",
  URL =          "http://www.genetic-programming.com/jkpdf/icec1997.pdf",
  URL =          "http://citeseer.ist.psu.edu/524150.html",
  size =         "7 pages",
  abstract =     "Analog electrical circuits that perform mathematical
                 functions (e.g., cube root, square) are called
                 computational circuits. Computational circuits are of
                 special practical importance when the small number of
                 required mathematical functions does not warrant
                 converting an analog signal into a digital signal,
                 performing the mathematical function in the digital
                 domain, and then converting the result back to the
                 analog domain. The design of computational circuits is
                 difficult even for mundane mathematical functions and
                 often relies on the clever exploitation of some aspect
                 of the underlying device physics of the components.
                 Moreover, implementation of each different mathematical
                 function typically requires an entirely different
                 clever insight. This paper demonstrates that
                 computational circuits can be designed without such
                 problem-specific insights using a single uniform
                 approach involving genetic programming. Both the
                 circuit topology and the sizing of all circuit
                 components are created by genetic programming. This
                 uniform approach to the automated synthesis of
                 computational circuits is illustrated by evolving
                 circuits that perform the cube root function (for which
                 no circuit was found in the published literature) as
                 well as for the square root, square, and cube
                 functions.",
  notes =        "ICEC-97, cube root, square, embryonic circuit",
}

Genetic Programming entries for John Koza Forrest Bennett Jason Lohn Frank Dunlap Martin A Keane David Andre

Citations