Research Article
Accelerated and Highly Correlated ASIC Synthesis of AI Hardware Subsystems Using CGP
Algorithm 1
(μ + λ) evolutionary strategy.
forall i such that 0 ≤ i < (λ + 1) do | Randomly generate individual i | end | Select μ individuals, that are promoted as the parents. | while the generation limit is not reached do | forall i such that 0 ≤ i < λ do | Mutate the μ parents based on the mutation scheme to generate λ offsprings | end | Generate the fittest individual using the following rules: | if an offspring genotype ranks better in a selection scheme then | Offspring genotype is chosen as fittest | else | The parent chromosome remains the fittest | end | end |
|