## Automated synthesis of computational circuits using genetic programming (1997)

Venue: | Proceedings of the 1997 IEEE Conference on Evolutionary Computation. Piscataway, NJ |

Citations: | 11 - 4 self |

### BibTeX

@INPROCEEDINGS{Koza97automatedsynthesis,

author = {John R. Koza and Frank Dunlap and Forrest H Bennett Iii and Martin A. Keane and Jason Lohn and David Andre},

title = {Automated synthesis of computational circuits using genetic programming},

booktitle = {Proceedings of the 1997 IEEE Conference on Evolutionary Computation. Piscataway, NJ},

year = {1997},

pages = {447--452},

publisher = {IEEE Press}

}

### Years of Citing Articles

### OpenURL

### Abstract

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. 1.

### Citations

2902 |
Genetic Programming: On the Programming of Computers by Means of Natural Selection
- Koza
- 1992
(Show Context)
Citation Context ...al circuits. 2. Evolution of Circuits Genetic programming is an extension of John Holland's genetic algorithm (1975) in which the populationsconsists of computer programs of varying sizes and shapes (=-=Koza 1992-=-, 1994a, 1994b; Koza and Rice 1992). Recent research on genetic programming is described in Kinnear (1994), Angeline and Kinnear (1996), and Koza, Goldberg, Fogel, and Riolo (1996). Genetic programmin... |

706 |
Genetic Programming II: Automatic Discovery of Reusable Programs
- Koza
- 1994
(Show Context)
Citation Context ...ve one constructioncontinuing subtree and typically have one arithmeticperforming subtree. This constrained syntactic structure is preserved by using structure-preserving crossover with point typing (=-=Koza 1994-=-a). Component-creating functions insert a component into the developing circuit and assign component value(s) to the component. Each component-creating function has a writing head that points to an as... |

101 |
Genetic Programming: The Movie
- Koza, Rice
- 1992
(Show Context)
Citation Context ... of Circuits Genetic programming is an extension of John Holland's genetic algorithm (1975) in which the populationsconsists of computer programs of varying sizes and shapes (Koza 1992, 1994a, 1994b; =-=Koza and Rice 1992-=-). Recent research on genetic programming is described in Kinnear (1994), Angeline and Kinnear (1996), and Koza, Goldberg, Fogel, and Riolo (1996). Genetic programming ordinarily evolves computer prog... |

82 |
J.R.: Parallel genetic programming: a scalable implementation using the transputer network architecture
- Andre, Koza
- 1996
(Show Context)
Citation Context ...emigrants, each consisting of B = 2% (the migration rate) of each node's subpopulation (selected on the basis of fitness) were dispatched to each of the four toroidally adjacent processing nodes. See =-=Andre and Koza 1996-=- for details. 4. Results 4.1. Cube Root Circuit The goal here is to evolve an analog electrical circuit whose output is the cube root of its input. The worst individual program trees from generation 0... |

82 |
Genetic Programming II Videotape: The Next Generation
- Koza
- 1994
(Show Context)
Citation Context ...ve one constructioncontinuing subtree and typically have one arithmeticperforming subtree. This constrained syntactic structure is preserved by using structure-preserving crossover with point typing (=-=Koza 1994-=-a). Component-creating functions insert a component into the developing circuit and assign component value(s) to the component. Each component-creating function has a writing head that points to an as... |

59 |
A precise four-quadrant multiplier with subnanosecond response
- Gilbert
- 1968
(Show Context)
Citation Context ... even for mundane mathematical functions and often relies on clever exploitation of some aspect of the underlying physics of the components. Each function usually requires a different clever insight (=-=Gilbert 1968-=-, Sheingold 1976, Babanezhad and Temes 1986). This paper demonstrates that computational circuits can be designed by means of a single uniform approach using genetic programming. Both the circuit topo... |

44 |
Darwin: Cmos opamp synthesis by means of a genetic algorithm
- Kruiskamp, Leenaerts
- 1995
(Show Context)
Citation Context ...a frequency discriminator on a Xilinx 6216 reconfigurable gate array in analog mode. CMOS operational amplifier (op amp) circuits have been designed using a modified version of the genetic algorithm (=-=Kruiskamp and Leenaerts 1995-=-); however, the topology of each op amp was one of 24 pre-selected topologies based on the conventional human-designed op amp stages. Evolvable digital hardware (Higuchi et al. 1993; Sanchez and Tomas... |

43 | Automated WYWIWYG Design of Both the Topology and Component Values of Analog Electrical Circuits Using Genetic - Koza, Andre, et al. - 1996 |

41 | Use of automatically defined functions and architecture-altering operations in automated circuit synthesis using genetic programming. Genetic Programming 1996 - Koza, Andre, et al. - 1996 |

37 | Automated design of both the topology and sizing of analog electrical circuits using genetic programming - Koza, H, et al. - 1996 |

31 | Four problems for which a computer program evolved by genetic programming is competitive with human performance - Koza, Bennett, et al. - 1996 |

29 | Gene Duplication to Enable Genetic Programming to Concurrently Evolve both the Architecture and Work-Performing Steps of a Computer Program - Koza - 1995 |

24 | Artificial cellular development in optimization and compilation - Gruau - 1996 |

24 |
Analog Design Automation: Where are We? Where are We Going
- Rutenbar
(Show Context)
Citation Context ...thesis involves designing an electrical circuit that satisfies user-specified design goals. The design of analog circuits and mixed analogdigital circuits has not proved to be amenable to automation (=-=Rutenbar 1993-=-). Thompson (1996) used a genetic algorithm to evolve a frequency discriminator on a Xilinx 6216 reconfigurable gate array in analog mode. CMOS operational amplifier (op amp) circuits have been design... |

18 | Reuse, parameterized reuse, and hierarchical reuse of substructures in evolving electrical circuits using genetic programming - Koza, Andre, et al. - 1996 |

16 | Evolution of a 60 decibel op amp using genetic programming - H, Koza, et al. - 1996 |

16 | Toward evolution of electronic animals using Genetic - Koza, Andre, et al. |

5 |
Analog MOS Computational Circuits
- Babanezhad, Temes
- 1986
(Show Context)
Citation Context ... functions and often relies on clever exploitation of some aspect of the underlying physics of the components. Each function usually requires a different clever insight (Gilbert 1968, Sheingold 1976, =-=Babanezhad and Temes 1986-=-). This paper demonstrates that computational circuits can be designed by means of a single uniform approach using genetic programming. Both the circuit topology and the sizing of all circuit componen... |

5 |
Nonlinear Circuits Handbook
- Sheingold
- 1976
(Show Context)
Citation Context ...ane mathematical functions and often relies on clever exploitation of some aspect of the underlying physics of the components. Each function usually requires a different clever insight (Gilbert 1968, =-=Sheingold 1976-=-, Babanezhad and Temes 1986). This paper demonstrates that computational circuits can be designed by means of a single uniform approach using genetic programming. Both the circuit topology and the siz... |