Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Polarization code belief propagation decoding method based on dynamic check matrix

A technology of belief propagation and dynamic verification, applied in the field of channel coding and communication, can solve the problems of no obvious improvement in decoding performance, too many decoding iterations, and high algorithm complexity, so as to reduce the complexity and overcome the iterative problems. Too many times, the effect of improving decoding performance

Active Publication Date: 2015-12-30
XIDIAN UNIV
View PDF4 Cites 18 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although this method improves the error correction capability of the communication system using polar codes as channel codecs, it still has shortcomings: after polarizing a limited number of channels, there are still some unpolarized channels
The disadvantages of this method are: under the improved algorithm, the frame error rate is still very high, and the decoding performance has not been significantly improved, and because of too many decoding iterations, the complexity of the algorithm is high

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
  • Polarization code belief propagation decoding method based on dynamic check matrix
  • Polarization code belief propagation decoding method based on dynamic check matrix
  • Polarization code belief propagation decoding method based on dynamic check matrix

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0044] The present invention will be further described below in conjunction with the accompanying drawings.

[0045] Refer to attached figure 1 , to further describe the specific steps of the present invention.

[0046] Step 1, setting parameters of the decoding module.

[0047] Set the maximum number of iterations for belief propagation decoding, and the maximum number of iterations is a positive integer within the allowable range of the decoding module. The larger the maximum number of iterations of belief propagation decoding is set, the better the decoding performance will be, but the longer the decoding time will be. Considering the time and performance of decoding comprehensively, the maximum number of iterations of belief propagation decoding generally ranges from [1, 50]. In the embodiment of the present invention, the maximum number of iterations of belief propagation decoding is set to 50.

[0048]Set the maximum number of check matrix adjustments, and its value ...

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 polarization code belief propagation decoding method based on a dynamic check matrix to solve the problems of the prior art that performance is low and time complexity is high when a traditional BP decoding algorithm is used. The method comprises the steps of 1, setting module parameters; 2, initializing parameters; 3, adjusting the check matrix to be in a low-density form; 4, executing belief propagation decoding; 5, judging whether a codon estimation vector is an effective vector; 6, calculating the minimum value of an absolute log likelihood; 7, calculating a threshold value; 8, judging whether decoding succeeds; 9, outputting a decoding result. By adjusting the polarization code check matrix and reducing the number of short loops of the check matrix, rapid convergence of the BP algorithm is achieved, and low time complexity is maintained while polarization code decoding performance is improved by means of the early-stage stop standard.

Description

technical field [0001] The invention belongs to the technical field of communication, and further relates to a dynamic parity check matrix-based polarization code belief propagation decoding method in the technical field of channel coding. The present invention can be used to solve the problem of low performance and low performance in traditional belief propagation decoding of polar codes with medium and short code lengths in various communication systems such as mobile communication, personal communication, deep space communication, satellite communication and third-generation mobile communication. problems with high time complexity. Background technique [0002] Polar code is a new channel coding method proposed by E. Arikan based on the phenomenon of channel polarization. It has been proved in theory that it can reach the Shannon limit and has low computational complexity of coding and decoding. It is a major issue in the field of wireless communication. Breakthroughs ha...

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/13
CPCH03M13/1128H03M13/1111H03M13/1191H03M13/13
Inventor 慕建君李桂萍焦晓鹏李晓恒
Owner XIDIAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products