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

Method for improving BP (belief propagation) decoding by use of polarisation code based on early termination of iterative strategy

A technology of early termination and polar codes, applied in the field of computer decoding, can solve problems such as calculating large amounts of data and high computational complexity

Inactive Publication Date: 2015-04-22
XIDIAN UNIV
View PDF5 Cites 23 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, this algorithm requires a large number of iterations, which requires a large amount of data to be calculated during decoding, and has a high computational complexity.

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
  • Method for improving BP (belief propagation) decoding by use of polarisation code based on early termination of iterative strategy
  • Method for improving BP (belief propagation) decoding by use of polarisation code based on early termination of iterative strategy
  • Method for improving BP (belief propagation) decoding by use of polarisation code based on early termination of iterative strategy

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0082] Under the condition that the maximum number of iterations is 60 and the convergence threshold ε=0.01, the bit error rate curves of the improved BP decoding algorithm and the original BP decoding algorithm of the polar code with parameters (512, 256) and each signal-to-noise Compared with the curve of the average number of iterations; the results are as follows figure 2 shown; the curve in the figure shows that compared with the original BP decoding algorithm, the improved BP decoding algorithm of the polar code with parameters (512, 256) has no loss in performance, and the average number of iterations is greatly reduced. When the SNR is 3dB , the average number of iterations is reduced by approximately 80%, and as the SNR increases, the average number of iterations gradually decreases and eventually levels off.

Embodiment 2

[0084] Under the condition that the maximum number of iterations is 60 and the convergence threshold ε=0.01, the bit error rate curves of the improved BP decoding algorithm and the original BP decoding algorithm of the polar code with parameters (1024, 512) and each signal-to-noise Compared with the curve of the average number of iterations; the results are as follows image 3 shown; the curve in the figure shows that compared with the original BP decoding algorithm, the improved BP decoding algorithm with parameters (1024, 512) has no performance loss, and the average number of iterations is greatly reduced. When the signal-to-noise ratio is 3dB , the average number of iterations is reduced by approximately 80%, and as the SNR increases, the average number of iterations gradually decreases and eventually levels off.

Embodiment 3

[0086] Under the condition that the maximum number of iterations is 60 and the convergence threshold ε=0.01, the bit error rate curves of the improved BP decoding algorithm and the original BP decoding algorithm of the polar code with parameters (2048, 1024) and each signal-to-noise Compared with the curve of the average number of iterations; the results are as follows Figure 4 shown; the curve in the figure shows that compared with the original BP decoding algorithm, the improved BP decoding algorithm of the polar code with parameters (2048, 1024) has no loss in performance, and the average number of iterations is greatly reduced. When the signal-to-noise ratio is 3dB , the average number of iterations is reduced by approximately 80%, and as the SNR increases, the average number of iterations gradually decreases and eventually levels off.

[0087] Compared with the original BP decoding algorithm, the improved BP decoding algorithm has no performance loss and greatly reduces ...

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 method for improving BP (belief propagation) decoding by use of a polarisation code based on early termination of the iterative strategy. According to the method, the convergence condition of the likelihood ratio of the information bit of the polarisation code is used as the criterion for stopping iteration in the BP decoding algorithm, the iteration number is reduced, and the purpose of reducing the complexity of the BP decoding algorithm can be achieved; simulation results show that the strategy can greatly reduce the decoding iterations, when the maximum iteration number is 60 and the signal-to-noise ratio is 3.5dB, the average iteration number is reduced by 80% compared with the original BP decoding algorithm, and the method is better than the existing early termination method of the iterative strategy.

Description

technical field [0001] The invention belongs to the field of computer decoding, in particular to an improved BP decoding method of a polar code based on an early termination iteration strategy. Background technique [0002] Polar codes have attracted attention in recent years due to their ability to reach the Shannon limit with low encoding / decoding complexity. In order to illustrate the performance of polar codes, Arikan gave the first decoding algorithm - continuous elimination decoding algorithm, namely SC. Afterwards, some improved SC decoding algorithms were proposed. Due to the nature of the SC decoding algorithm, the algorithms proposed above have disadvantages such as high decoding delay and low output, so the application in real life is affected. [0003] As a parallel decoding algorithm, BP's application on Polar has attracted a lot of attention. However, this algorithm requires a large number of iterations, so that a large amount of data needs to be calculated ...

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
Patent Type & Authority Applications(China)
IPC IPC(8): H03M13/11
CPCH03M13/13H03M13/1128H03M13/1191
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

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