An Efficient Selection Strategy for Digital Circuit Evolution

Gajda, Zbysek; Sekanina, Lukáš

doi:10.1007/978-3-642-15323-5_2

Cited by 10 publications

(7 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Vassilev et al [118] found that smaller three-bit multipliers were found by encoding a working multiplier with a small amount of redundancy. This is also supported in the work of Gajda and Sekanina [16] who discovered while optimising digital circuits that in long evolutionary runs strictly selecting circuits which had fewer gates did not produce as small circuits as merely choosing circuits that were functionally correct (that is with lower fitness). They showed that the frequency of occurrence of correct circuits was greater using the weaker fitness criterion.…”

Section: Mutationmentioning

confidence: 58%

Cartesian genetic programming: its status and future

Miller

2019

Genet Program Evolvable Mach

View full text Add to dashboard Cite

Cartesian genetic programming, a well-established method of genetic programming, is approximately 20 years old. It represents solutions to computational problems as graphs. Its genetic encoding includes explicitly redundant genes which are wellknown to assist in effective evolutionary search. In this article, we review and compare many of the important aspects of the method and findings discussed since its inception. In the process, we make many suggestions for further work which could improve the efficiency of the CGP for solving computational problems.

show abstract

Section: Mutationmentioning

confidence: 58%

Cartesian genetic programming: its status and future

Miller

2019

Genet Program Evolvable Mach

View full text Add to dashboard Cite

show abstract

“…[4] III. REDUCTION OF FITNESS CALCULATIONS The author of this paper published in [1] modifications of CGP that omit wasted fitness calculations.…”

Section: Cartesian Genetic Programmingmentioning

confidence: 99%

“…The end of each chromosome is constructed by integers which define the output cells. The total length of the chromosome is defined as [2,3,4]:…”

Section: Cartesian Genetic Programmingmentioning

confidence: 99%

See 1 more Smart Citation

Compact version of Cartesian Genetic Programming

Burian

2014

2014 International Conference on Applied Electronics

View full text Add to dashboard Cite

This paper deals with the design of the compact version of Cartesian Genetic Programming. The focus is given to the search algorithm of type (1+1). The paper presents the approach that detects changes in the phenotype and, based on that, the algorithm can omit the evaluation of a candidate solution. The author uses the evolutionary design of multipliers as benchmark to present the efficiency of the algorithm.

show abstract

“…And the EHW has also been applied to the design of combinational logic circuits nowadays [1]. Compared with traditional methods, the evolutionary method needs not too much specialized experience, but could design creative circuit structures [2].…”

Section: Introductionmentioning

confidence: 99%

An evolutionary algorithm based on novel hybrid repair strategy for combinational logic circuits

Huang

Zhang

et al. 2015

IEICE Electron. Express

View full text Add to dashboard Cite

Evolvable hardware has been applied to the design of combinational logic circuits. But it usually takes too much time using evolutionary algorithm directly, especially designing large scale circuits. In this paper, a novel hybrid repair strategy is proposed, which is a combination of evolutionary repair method and Quine_McCluskey repair technique. Based on the hybrid repair strategy, an evolutionary algorithm is presented for the designs of combinational logic circuits. The experiment results demonstrate that the evolutionary algorithm proposed in this paper can keep balance between the time cost and gates consumption very well, and consumes fewer gates than the previous works.

show abstract

An Efficient Selection Strategy for Digital Circuit Evolution

Cited by 10 publications

References 8 publications

Cartesian genetic programming: its status and future

Cartesian genetic programming: its status and future

Compact version of Cartesian Genetic Programming

An evolutionary algorithm based on novel hybrid repair strategy for combinational logic circuits

Contact Info

Product

Resources

About