Results 1 
7 of
7
Principles in the Evolutionary Design of Digital Circuits  Part I
, 2000
"... An evolutionary algorithm is used as an engine for discovering new designs of digital circuits, particularly arithmetic functions. These designs are often radically different from those produced by topdown, human, rulebased approaches. It is argued that by studying evolved designs of gradually ..."
Abstract

Cited by 32 (4 self)
 Add to MetaCart
An evolutionary algorithm is used as an engine for discovering new designs of digital circuits, particularly arithmetic functions. These designs are often radically different from those produced by topdown, human, rulebased approaches. It is argued that by studying evolved designs of gradually increasing scale, one might be able to discern new, efficient, and generalisable principles of design. The ripplecarry adder principle is one such principle that can be inferred from evolved designs for one and twobit adders. Novel evolved designs for threebit binary multipliers are given that are 20% more efficient (in terms of number of twoinput gates used) than the most efficient known conventional design. 1 Introduction Traditionally physical systems (e.g. bridges, computers, mobile phones) have been designed by engineers using complex collections of rules and principles. The design process is topdown in nature and begins with a precise specification. This contrasts very stron...
Scalability Problems of Digital Circuit Evolution  Evolvability and Efficient Designs
 Proceedings of the 2nd NASA/DOD Workshop on Evolvable Hardware, pages 55–64, Los Alamitos, CA
, 2000
"... A major problem in the evolutionary design of combinational circuits is the problem of scale. This refers to the design of electronic circuits in which the number of gates required to implement the optimal circuit is too high to search the space of all designs in reasonable time, even by evolution. ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
A major problem in the evolutionary design of combinational circuits is the problem of scale. This refers to the design of electronic circuits in which the number of gates required to implement the optimal circuit is too high to search the space of all designs in reasonable time, even by evolution. The reason is twofold: firstly, the size of the search space becomes enormous as the number of gates required to implement the circuit is increased, and secondly, the time required to calculate the fitness of a circuit grows as the size of the truth table of the circuit. This paper studies the evolutionary design of combinational circuits, particularly the threebit multiplier circuit, in which the basic building blocks are small subcircuits, modules inferred from other evolved designs. The structure of the resulting fitness landscapes is studied and it is shown that in general the principles of evolving digital circuits are scalable. Thus to evolve digital circuits using modules is faster...
Towards the Automatic Design Of More Efficient Digital Circuits
 Proc. of the 2nd NASA/DoD Workshop on Evolvable Hardware
, 2000
"... This paper introduces a new methodology of evolving electronic circuits by which the process of evolutionary design is guaranteed to produce a functionally correct solution. The method employs a mapping to represent an electronic circuit on an array of logic cells that is further encoded within a ge ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
This paper introduces a new methodology of evolving electronic circuits by which the process of evolutionary design is guaranteed to produce a functionally correct solution. The method employs a mapping to represent an electronic circuit on an array of logic cells that is further encoded within a genotype. The mapping is manytoone and thus there are many genotypes that have equal fitness values. Genotypes with equal fitness values define subgraphs in the resulting fitness landscapes referred to as neutral networks. This is further used in the design of a neutral network that connects the conventional with other more efficient designs. To explore such a network a navigation strategy is defined by which the space of all functionally correct circuits can be explored. The paper shows that very efficient digital circuits can be obtained by evolving from the conventional designs. Results for several binary multiplier circuits such as the three and fourbit multipliers are reported. The evo...
Experiences of using Evolutionary Techniques in Logic Minimisation
 In ? [343
, 1996
"... : This paper reviews our work in recent years applying Evolutionary Techniques to the minimisation of logic functions. This work has primarily concerned ANDEXOR (ReedMuller Logic) networks, as distinct from the more traditional Boolean form (ANDOR). We have also applied these techniques to the mi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
: This paper reviews our work in recent years applying Evolutionary Techniques to the minimisation of logic functions. This work has primarily concerned ANDEXOR (ReedMuller Logic) networks, as distinct from the more traditional Boolean form (ANDOR). We have also applied these techniques to the minimisation of the logic required to realise sequential state machines (State Assignment Problem). Recently we have been more specifically targeting these minimised functions for Field Programmable Gate arrays (FPGAs). 1. Overview of ReedMuller Logic. Traditionally digital electronic logic circuits have been implemented using Boolean devices such as InclusiveOR gates, AND gates, NOT gates etc. However it has been known for some time that it is possible to implement logic functions using an alternative form of logic known as ReedMuller logic [Green86]. In this form of logic the InclusiveOR is replaced by the ExclusiveOR operation. This relatively unexplored form of logic implementation a...
Evolving communication in embodied agents: Theory, Methods, and Evaluation
"... Abstract. In this chapter we introduce the area of research that attempts to study the evolution of communication in embodied agents through adaptive techniques, such us artificial evolution. More specifically, we illustrate the theoretical assumptions behind this type of research, we present the me ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. In this chapter we introduce the area of research that attempts to study the evolution of communication in embodied agents through adaptive techniques, such us artificial evolution. More specifically, we illustrate the theoretical assumptions behind this type of research, we present the methods that can be used to realize embodied and communicating artificial agents, and we discuss the main research challenges and the criteria for evaluating progresses in this field. 1
unknown title
"... In this chapter we present a novel way of addressing the issue of variable complexity of evolved solutions and a revised interpretation of how Genetic Programming (GP) constructs solutions, based on the rootedtree schema concept. A rootedtree schema is a simple relation on the space of treeshaped ..."
Abstract
 Add to MetaCart
In this chapter we present a novel way of addressing the issue of variable complexity of evolved solutions and a revised interpretation of how Genetic Programming (GP) constructs solutions, based on the rootedtree schema concept. A rootedtree schema is a simple relation on the space of treeshaped structures which provides a quantifiable partitioning of the search space. Formal manipulation of rootedtree schemata allows: (1) The role of the size in the selection and survival of evolved expressions to be made explicit; (2) The interrelationship between parsimony penalty, size, and fitness of evolved expressions to be clarified and better understood; (3) The introduction of alternative approaches to evolving parsimonious solutions by preventing rootedtree schema from bloating. The rootedtree schema concept provides a topdown perspective of how program expressions are evolved, contrary to the common belief that small pieces of code, or building blocks, are gradually assembled to create solutions. Analysis shows that GP, while it improves solutions, combines both bottomup and topdown refinement strategies. Complexity (or the size or length) of evolved structures is a nonissue in most of the recent
Principles in the Evolutionary Design of Digital Circuits  Part I
, 2000
"... An evolutionary algorithm is used as an engine for discovering new designs of digital circuits, particularly arithmetic functions. These designs are often radically different from those produced by topdown, human, rulebased approaches. It is argued that by studying evolved designs of gradually ..."
Abstract
 Add to MetaCart
An evolutionary algorithm is used as an engine for discovering new designs of digital circuits, particularly arithmetic functions. These designs are often radically different from those produced by topdown, human, rulebased approaches. It is argued that by studying evolved designs of gradually increasing scale, one might be able to discern new, efficient, and generalisable principles of design. The ripplecarry adder principle is one such principle that can be inferred from evolved designs for one and twobit adders. Novel evolved designs for threebit binary multipliers are given that are 20% more efficient (in terms of number of twoinput gates used) than the most efficient known conventional design. 1 Introduction Traditionally physical systems (e.g. bridges, computers, mobile phones) have been designed by engineers using complex collections of rules and principles. The design process is topdown in nature and begins with a precise specification. This contrasts very stron...