Hybrid LDPC codes and iterative decoding methods - i3s

ensea.fr

Hybrid LDPC codes and iterative decoding methods - i3s

108 Chapitre 3 : Machine Learning Methods for Code and Decoder Design

iteration t = 0

weights initialiazed to 1

initialization of alleles of the genetic algorithm

run genetic algorithm with cost function

f (C,t)

cost = x (F)

vc (t) − y (C)

vc (t)

best w (2t) and w (2t+1) found

t = t + 1

yes

t < N iter

no

Figure 3.7 : Flow chart of the optimization procedure using a genetic algorithm to find

the best weights minimizing the cost function, for each iteration. N iter is the number of

decoding iterations for which we look for the correcting weights.

More magazines by this user
Similar magazines