BP decoding method based on Tanner sheet margin scheduling strategy

A scheduling strategy and decoding technology, applied in the field of communication, can solve the problems of high implementation complexity and loss of bit error performance, and achieve the effects of accelerating iteration speed, improving bit error performance, and reducing computational complexity

Active Publication Date: 2018-01-09
GUILIN UNIV OF ELECTRONIC TECH
View PDF6 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the bit error performance of the NLBP decoding algorithm and the OLBP decoding algorithm still has a certain loss.
In order to further improve the bit error performance, Fan Yanan and others proposed an overlapping Shuffled-BP (Overlapped Shuffled-B

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
  • BP decoding method based on Tanner sheet margin scheduling strategy
  • BP decoding method based on Tanner sheet margin scheduling strategy
  • BP decoding method based on Tanner sheet margin scheduling strategy

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0041] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in combination with specific examples and with reference to the accompanying drawings.

[0042] The BP decoding method based on the Tanner graph edge scheduling strategy includes the following steps:

[0043]Step 1. Initialize the decoding parameters, that is, initialize the initialization message m passed from the variable node to the check node v→c =2y / σ 2 , y is the received sequence, σ 2 is the noise variance; the initialization information m passed from the check node to the variable node c→v =0; the number of edges k=0 for initializing information transfer, in the present invention, the number of edges k for transferring information is the number of edges that the variable node needs to update to the check node, and is also the number of edges that the check node passes to the variable node The number o...

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 BP decoding method based on the Tanner sheet margin scheduling strategy. The Tanner sheet margin scheduling is adopted in a decoding process, and parallel transmission is performed to accelerate the decoding iteration speed. On a check node updating part, a diversity processing mode is adopted, when a verification equation is not tenable after several iterations, and a check node transmits information with all neighbor nodes so as to improve the reliability of the check node; when the verification equation is tenable, and the reliability of the check node is smaller than a reliability threshold, the check node only needs to perform information transmission with the previous w nodes smaller than LLR information, thereby reducing the partial computation complexity;the rest check nodes do not perform information transmission, so that the computation complexity of the algorithm is further reduced, the transmission of the LLR information along the edge is inhibited, and the BER performance is improved. The simulation results show that when the signal to noise ratio is 3.0dB, the computation complexity of the EDBP algorithm is only 42% of the BP algorithm, andthe computation complexity is reduced, and the BER performance of the EDBP algorithm is better than that of the Flooding algorithm.

Description

technical field [0001] The present invention relates to the field of communication technology, in particular to a Tanner graph edge scheduling strategy-based BP decoding (Edge-based Dynamic Scheduling for BP, EDBP) method. Background technique [0002] LDPC code (Low Density Parity Check, LDPC) is a linear error correction code, which can be uniquely determined by its check matrix, and this matrix is ​​a sparse matrix, so its codewords have good distance characteristics, It is one of the closest good yards to the Shannon limit found so far. With the rapid development of computer technology and the improvement of hardware integration technology, and because LDPC codes have excellent error correction performance, small decoding error probability and low decoding complexity, scholars at home and abroad have carried out extensive research. Research, and the LDPC code is used as one of the forward error correction codes (Forward Error Correct, FEC) in many communication standard...

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/11
Inventor 陈紫强侯田田丁勇谢跃雷刘庆华晋良念欧阳缮李亚云蒋俊正
Owner GUILIN UNIV OF ELECTRONIC TECH
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