A new method to find developmental descriptions for digital circuits

Authors:
Mohammad Ebne-Alian;Nawwaf Kharma
Affiliations:
Computational Intelligence Lab, Electrical and Computer Engineering Department, Concordia University, Montreal, Québec, Canada;Computational Intelligence Lab, Electrical and Computer Engineering Department, Concordia University, Montreal, Québec, Canada
Venue:
ICES'10 Proceedings of the 9th international conference on Evolvable systems: from biology to hardware
Year:
2010

Citing 6
Cited 0

Principles in the Evolutionary Design of Digital Circuits—Part I

Genetic Programming and Evolvable Machines
Cartesian Genetic Programming

Proceedings of the European Conference on Genetic Programming
Evolutionary Experiments with a Fine-Grained Reconfigurable Architecture for Analog and Digital CMOS Circuits

EH '99 Proceedings of the 1st NASA/DOD workshop on Evolvable Hardware
Evolving Redundant Structures for Reliable Circuits - Lessons Learned

AHS '07 Proceedings of the Second NASA/ESA Conference on Adaptive Hardware and Systems
Flexible learning of problem solving heuristics through adaptive search

IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
A developmental method for growing graphs and circuits

ICES'03 Proceedings of the 5th international conference on Evolvable systems: from biology to hardware

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a new method to find developmental descriptions for gate-level feed forward combinatorial circuits. In contrast to the traditional description of FPGA circuits in which an external bit stream explicitly describes the internal architecture and the connections of the circuit, developmental descriptions form the circuit by synchronously running an identical developmental program in each building block of the circuit. Unlike some previous works, the connections are all local here. Evolution is used to find the developmental code for the given problem. We use an innovative fitness function to increase the performance of evolution in search for the solutions, and also relax the position and order of the inputs and output(s) of the circuit to increase the density of the solutions in the search space. The results show that the chance of finding a solution can be increased up to 375% compared to the use of traditional fitness function. The preliminary studies show that this method is capable of describing basic circuits and is easily scalable for modular circuits.