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

Decoding method of ldpc code based on dynamic selection strategy with fixed message update range

A technology of LDPC code and selection strategy, which is applied in the field of LDPC code decoding, can solve problems such as greed and occupation of computing resources, and achieve the effects of suppressing propagation, improving decoding performance, and suppressing greed

Active Publication Date: 2021-01-26
SUN YAT SEN UNIV
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

There are thousands of rings in the LDPC code, which makes it easy for the update transfer trend to propagate along the edge loops on the ring, and eventually causes a small number of rings to occupy a large amount of computing resources, forming a greedy problem

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
  • Decoding method of ldpc code based on dynamic selection strategy with fixed message update range
  • Decoding method of ldpc code based on dynamic selection strategy with fixed message update range
  • Decoding method of ldpc code based on dynamic selection strategy with fixed message update range

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0038] RCP (Decoding algorithm based on random select of check nodes with apredefined update range, that is, a belief propagation decoding method based on a fixed message update range) represents the abbreviation of the method of the present invention.

[0039] according to figure 1 The overall flowchart of the RCP decoding algorithm shown, combined with figure 2 In the decoding update flow chart shown, the specific steps of the RCP decoding algorithm are as follows:

[0040] S101. Set the size n of the update range p . Among them, the specific steps are as follows:

[0041] S1011. Initialize the size n of the update range p = 1, the new average number of iterations I new = 0, the old average iteration number I old = I max , where I max The maximum number of iterations preset for the decode update method;

[0042] S1012. In size n p Decode 2000 frame test frames under the update range of , record the number of decoding iterations used in each frame of decoding, the ...

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 specifically relates to an LDPC code decoding method based on a dynamic selection strategy with a fixed message update range. Different from the traditional decoding method that uses all check nodes as the update range, the decoding method of the present invention first randomly selects a fixed number of check nodes to enter the update range before each update of the side message, and then from the update range Find the edge message with the largest edge residual in the check node for update. The present invention utilizes the average number of decoding iterations to estimate the decoding performance of the algorithm, and automatically sets an appropriate update range by comparing the average number of iterations of decoding in update ranges of different sizes, thereby effectively suppressing the greediness of the dynamic selection strategy and greatly reducing In order to find the search complexity of the maximum edge residual, excellent error correction performance, convergence performance and throughput performance are obtained.

Description

technical field [0001] The invention relates to the technical field of communication, in particular to an LDPC code decoding method based on a dynamic selection strategy with a fixed message update range. Background technique [0002] LDPC (Low Density Parity Check Codes) code is a linear block code with excellent performance, which was first proposed by Gallager in 1962. However, due to the hardware conditions at that time, LDPC codes did not attract enough attention. In 1981, Tanner proposed to use the Tanner diagram to describe the message passing process of LDPC codes, which greatly promoted the research process of LDPC codes. In 1995, MacKey rediscovered the LDPC code, and again made a comprehensive elaboration on the performance, construction method, encoding method, and decoding method of the code. Since then, LDPC codes have attracted extensive attention. LDPC codes have excellent performance close to the Shannon limit, which is mainly due to their unique sparsity...

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 Patents(China)
IPC IPC(8): H03M13/11
CPCH03M13/1111
Inventor 刘星成谢穗鹏梁硕
Owner SUN YAT SEN 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