Design automation: automated full-custom VLSI layout using the ULYSSES design environment
Design automation: automated full-custom VLSI layout using the ULYSSES design environment
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Binary decision diagrams and applications for VLSI CAD
Binary decision diagrams and applications for VLSI CAD
A robust multiplexer-based FPGA inspired by biological systems
Journal of Systems Architecture: the EUROMICRO Journal - Special issue: dependable parallel computer systems
Evolutionary algorithms for VLSI CAD
Evolutionary algorithms for VLSI CAD
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Embryonics: A Bio-Inspired Cellular Architecture with Fault-Tolerant Properties
Genetic Programming and Evolvable Machines
MUXTREE Revisited: Embryonics as a Reconfiguration Strategy in Fault-Tolerant Processor Arrays
ICES '98 Proceedings of the Second International Conference on Evolvable Systems: From Biology to Hardware
An Embryonics Implementation of a Self-Replicating Universal Turing Machine
ICES '01 Proceedings of the 4th International Conference on Evolvable Systems: From Biology to Hardware
Reliability Analysis in Self-Repairing Embryonic Systems
EH '99 Proceedings of the 1st NASA/DOD workshop on Evolvable Hardware
The BioWall: An Electronic Tissue for Prototyping Bio-Inspired Systems
EH '02 Proceedings of the 2002 NASA/DoD Conference on Evolvable Hardware (EH'02)
Hi-index | 0.00 |
This paper presents a genetic algorithm (GA) that solves the problem of routing a multiplexer network into a MUXTREE embryonic array. The procedure to translate the multiplexer network into a form suitable for the GA-based router is explained. The genetic algorithm works on a population of configuration registers (genome) that define the functionality and connectivity of the array. Fitness of each individual is evaluated and those closer to solving the required routing are selected for the next generation. A matrix-based method to evaluate the routing defined by each individual is also explained. The output of the genetic router is a VHDL program describing a look-up table that receives the cell co-ordinates as inputs and returns the value of the corresponding configuration register. The routing of a module-10 counter is presented as an example of the capabilities of the genetic router. The genetic algorithm approach provides not one, but multiple solutions to the routing problem, opening the road to a new level of redundancy where a new "genome" can be downloaded to the array when the conventional reconfiguration strategy runs out of spare cells.