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

Improved decoding algorithm for LDPC codes based on interlaced column row message passing

An LDPC code and message passing technology, applied in the field of signal processing, can solve problems such as slow convergence speed, achieve the effect of improving decoding error correction performance and speeding up decoding convergence speed

Inactive Publication Date: 2017-11-28
CHONGQING UNIV OF POSTS & TELECOMM
View PDF4 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The flood scheduling method uses a parallel scheduling method. The disadvantage of this scheduling method is that the convergence speed is slow

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
  • Improved decoding algorithm for LDPC codes based on interlaced column row message passing
  • Improved decoding algorithm for LDPC codes based on interlaced column row message passing
  • Improved decoding algorithm for LDPC codes based on interlaced column row message passing

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0017] The specific implementation manners and preferred simulation examples of the present invention will be described in detail below in conjunction with the accompanying drawings.

[0018] 1. Combine with attached figure 1 It shows that, in general, the BP algorithm performs message passing through the edges of the Tanner graph. Node messages generate new messages based on incoming node messages and deliver them to adjacent nodes. Let m denote the vector of all messages in the graph, m k Indicates the kth message in the vector. f k (m) is to generate m from m k The function.

[0019] LDPC codes can be represented by a Tanner graph, which includes N variable nodes v j , j∈{1,…,N} and M check nodes c i , i∈{1,...,M}. Message passing along the edges of the Tanner graph corresponds to the posterior probability (or LLR). The sign of the LLR shows the most likely value of the codeword bits, and the absolute value of the LLR indicates the reliability. In an LDPC graph fo...

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 relates to an improved decoding algorithm for low density parity check (LDPC) codes based on interlaced column row message passing. In order to further improve the error correcting performance of the LDPC code decoding algorithm and speed up decoding convergence, the invention presents an improved decoding algorithm based on interlaced column row message passing. As the residual value idea in a dynamic scheduling strategy decoding algorithm is introduced to a static serial scheduling decoding algorithm, the serial scheduling decoding algorithm carries out residual value ranking calculation once before message updating in each iteration, and reorders the node messages based on the original fixed update order. Simulation results show that when the error rate is 10<-4>, the improved decoding algorithm has 0.25dB and 0.24dB gain respectively compared with a row message passing algorithm and a column message passing algorithm; and when the error rate is 10<-5>, the improved decoding algorithm has 0.13dB gain compared with an interlaced column row message passing algorithm.

Description

technical field [0001] The invention belongs to the field of signal processing, and relates to a decoding algorithm of a Low Density Parity-Check (LDPC) code. The scheme proposes a New LDPC decoding algorithm. Background technique [0002] The performance of the Low Density Parity-Check (LDPC) code decoding algorithm plays an extremely important role in its comprehensive performance and practical application, and the scheduling mode of the LDPC code plays an important role in its decoding algorithm. Important role, the common belief propagation (belief propagation, BP) decoding algorithm and the log-likelihood ratio belief propagation (Log-Likelihood Ratio Belief Propagation, LLR-BP) algorithm use the flood scheduling method, that is, update the verification at the same time node or variable node. The flood scheduling method adopts the parallel scheduling method, and the disadvantage of this scheduling method is that the convergence speed is slow. In order to deliver the ...

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
CPCH03M13/1105
Inventor 袁建国曾磊孙雪敏王姣蹇红王晓蓉刘力塽袁素真
Owner CHONGQING UNIV OF POSTS & TELECOMM
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