Rapid polarization code construction method and device based on genetic algorithm and equipment

A genetic algorithm and construction method technology, which is applied in the field of fast polar code construction based on genetic algorithm, can solve the problem of time length of polar code construction method, and achieve the effects of saving running time, improving running efficiency and improving convergence speed.

Pending Publication Date: 2021-11-09
PURPLE MOUNTAIN LAB
View PDF6 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

b class="d_n">[0004] Purpose of the invention: Aiming at the problems existing in the prior art, the present invention discloses a method, device and equipment for co...

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Rapid polarization code construction method and device based on genetic algorithm and equipment
  • Rapid polarization code construction method and device based on genetic algorithm and equipment
  • Rapid polarization code construction method and device based on genetic algorithm and equipment

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0040] Such as figure 1 As shown, in one embodiment of the present application, a kind of fast polar code construction method based on genetic algorithm is provided, comprising steps:

[0041] Step S01, obtain the channel signal-to-noise ratio, set the code length and code rate of the polar code, use the information bit distribution result of the polar code as the individual of the genetic algorithm, and generate the initial individual according to the code length and code rate of the polar code as the first One-generation population; simulated channel according to the channel signal-to-noise ratio;

[0042]Step S02: Perform polar code encoding, channel transmission and polar code decoding simulations on all individuals in the contemporary population to obtain the bit error rate of each individual; select several individuals with low bit error rates in the contemporary population, respectively Carry out the first mutation operation and crossover decision, if the crossover ope...

Embodiment 2

[0063] Embodiment 2: as image 3 As shown, on the basis of Example 1, the process of weight judgment is added to further reduce the calculation time, that is, the step of performing individual weight judgment to directly obtain the bit error rate before each genetic iterative calculation includes:

[0064] Query whether the individual in the contemporary population exists from the pre-established individual bit error rate table used to store the individual and its bit error rate. If it exists, mark the individual and obtain the corresponding bit error rate of the individual. Annotated individuals are used for genetic iteration calculations.

[0065] The steps for genetic iterative calculation of unmarked individuals include:

[0066] For the unmarked individuals in the contemporary population, the simulation process of polar code encoding, channel transmission and polar code decoding is carried out to obtain the bit error rate of the unmarked individual, and store the unmarke...

Embodiment 3

[0074] Such as Figure 4 As shown, a fast polar code construction device based on genetic algorithm, including:

[0075] The acquisition and initialization module is used to obtain the channel signal-to-noise ratio, set the code length and code rate of the polar code, and use the information bit distribution result of the polar code as an individual of the genetic algorithm to generate according to the code length and code rate of the polar code The initial individual is used as the contemporary population; the channel is simulated according to the signal-to-noise ratio of the channel;

[0076] The genetic iteration module is used to simulate polar code encoding, channel transmission and polar code decoding for all individuals in the contemporary population to obtain the bit error rate of each individual; select several individuals with low bit error rates in the contemporary population Individuals perform the first mutation operation and crossover decision respectively. If t...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a rapid polarization code construction method and device based on a genetic algorithm and equipment. The method comprises the steps: acquiring a channel signal-to-noise ratio, setting a code length and a code rate, taking an information bit distribution result of a polar code as an individual of the genetic algorithm, and generating an initial individual as a current population according to the code length and the code rate of the polar code; simulating a channel according to the signal-to-noise ratio of the channel; performing polarization code coding, channel transmission and polarization code decoding simulation on all individuals in the current population to obtain a bit error rate; selecting a plurality of individuals with low bit error rate in the current population, respectively carrying out first mutation operation and crossover decision, if crossover operation conditions are met, carrying out crossover operation to form new individuals, and generating a next-generation population; and performing iterative calculation until the total number of iterations is reached, and selecting an individual with the lowest bit error rate as a final information bit distribution result of the polarization code, wherein in the crossover operation, the progeny firstly inherits the same parts of the two crossover individuals. The method improves the convergence speed of iteration and saves time.

Description

technical field [0001] The invention belongs to the technical field of channel coding and decoding, and in particular relates to a fast polar code construction method, device and equipment based on a genetic algorithm. Background technique [0002] Polar code is a channel coding method. Polar code has been widely concerned since it was proposed. Because polar code can theoretically reach the limit of channel capacity, and its coding and serial cancellation decoding (SC) have Low implementation complexity, it has been selected as the channel coding standard for control channels in 5G. The most primitive polar code decoder is serial cancellation decoding (SuccessiveCancellation, SC), that is, SC decoder, but SC decoder is a serial decoder, if the previous bit decoding error occurs, it will The decoding of the following bits has an impact, resulting in the phenomenon of bit error propagation. For the limited code length of the actual scene, the error correction performance of...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H03M13/13G06N3/12
CPCH03M13/13G06N3/126
Inventor 张川周华羿杨敏华黄永明尤肖虎
Owner PURPLE MOUNTAIN LAB
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap