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

Bit inversion decoding method based on threshold value of polar code

A technology of bit inversion and polar code, which is applied in the field of communication, can solve the problems of small error probability of the first bit, increasing computational complexity of the algorithm, candidate inversion bit errors, etc.

Pending Publication Date: 2019-07-26
CHINA UNIV OF PETROLEUM (EAST CHINA)
View PDF5 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The SC-Flip algorithm selects candidate inverted bits according to the absolute value of the likelihood value corresponding to the non-frozen bit in the SC decoding process from small to large, so the SC-Flip algorithm needs to sort and select the likelihood value, which will increase Computational Complexity of the Algorithm
In addition, there are situations where the likelihood value is small but the corresponding first bit error probability is also small, which leads to errors in selecting candidate inversion bits according to the ordering of the likelihood value

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
  • Bit inversion decoding method based on threshold value of polar code
  • Bit inversion decoding method based on threshold value of polar code

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

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

[0035] Firstly, the calculation process of the threshold is explained. Suppose the code length of the polar code is N=8. According to the Gaussian approximation theory, the calculation process of the error probability of the 8 polar sub-channels is as follows: figure 1 shown. enter where σ 2 is the noise variance, then By analogy, it can be calculated Then the final error probability is So far, the basic threshold is T i =log(1-p i / p i), i=1,2,...,8. Finally, take k=1, scan the simulated FER at an interval of 0.1, and find the best klog(1-p i / p i ).

[0036] T-SC-Flip decoding such as figure 2 Shown: First initialize the key set Crtical and threshold Threshold, and then receive information according to the decoder and non-frozen bit positions Perform SC decoding, and the decoding result is right Perform CRC check, if the c...

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 provides a bit inversion decoding method based on a threshold value of a polar code, which comprises the following steps: when CRC of a decoding result of an SC algorithm fails, judginga likelihood value in a key set by using the pre-designed threshold value so as to screen out candidate inversion bits; and based on the candidate inversion bit set, sequentially inverting the candidate bits, and performing SC decoding again from the current position until the CRC check is passed or the remaining bits of the inversion set are null. According to the method, the offline channel information is fully utilized, the Gaussian approximation theory is used for calculating the basic threshold value, and then the Monte Carlo method is used for optimizing the parameter k, so that the complexity can be reduced, and meanwhile, the error correction performance of the polarization code can be effectively improved.

Description

technical field [0001] The invention belongs to the technical field of communication, and in particular relates to an improved algorithm of a continuous elimination decoding algorithm based on bit flipping in a polar code. Background technique [0002] Polar codes (Polar Codes) were first proposed by Turkish scientists at the 2008 International Information Theory Conference, and have attracted much attention because they have been theoretically proven to be able to achieve the channel capacity of a binary discrete symmetric channel. In 2015, at the 3GPP meeting, the polar code was designated as the coding scheme for the control channel in the fifth-generation mobile communication eMBB scenario. [0003] The proposal of polar codes comes from the phenomenon of channel polarization. When the polarization transformation is performed on N channels, the channel capacity of some polarized sub-channels tends to 1, and the channel capacity of other polarized sub-channels tends to 0....

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/11H03M13/09
CPCH03M13/1108H03M13/09
Inventor 李世宝邓云强高迅董振威刘建航
Owner CHINA UNIV OF PETROLEUM (EAST CHINA)
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

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com