The application discloses a
polar code construction method based on
genetic algorithm acceleration convergence, which comprises the following steps: step 1, setting parameters; step 2, initial
genetic algorithm population; step 3, selecting two parents from the
population by using a roulette
algorithm; step 4, crossing the two parent information bits to generate
offspring; step 5, mutating the unlocked information bits of the
offspring by using the non-locked frozen bits; step 6, adding the mutated
offspring to the
population, selecting the optimal one according to the fitness, updating the population and recording the population information; step 7, repeating steps 3 to 6 until the number of genetic iterations reaches a number of spans, judging whether the optimal fitness decreases to a limit or not, if yes, reducing the number of locked bits, temporarily releasing the channel, repeating steps 3 to 6 until the number of genetic iterations reaches a minimum number of spans, if the optimal fitness decreases and the temporarily released channel changes, updating the channel locking condition according to the temporarily released channel, if no, directly repeating steps 3 to 6; and step 8, ending when the genetic iteration stopping condition is met. The application can solve the problem of
slow convergence speed by dynamically locking the channel.