Minimum sum decoding method of selective annealing of low density parity check code

A low-density parity, selective annealing technology, applied in the decoding field of channel error correction coding, which can solve the problems of robust channel estimation parameters, poor performance, and high complexity of the sum-product algorithm

Inactive Publication Date: 2010-08-18
PLA UNIV OF SCI & TECH
View PDF2 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] Technical problem: the purpose of this invention is to provide a kind of selective annealing minimum sum decoding method of low density parity check code, this method is a kind of improved minimum sum decoding method, solves existing simplified LDPC code soft decision decoding The performance of the method is poor when dealing with longer irregular codes, and the complexity of the existing sum-product algorithm is still high; at the same time, the method is more robust to the channel estimation parameters

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
  • Minimum sum decoding method of selective annealing of low density parity check code
  • Minimum sum decoding method of selective annealing of low density parity check code
  • Minimum sum decoding method of selective annealing of low density parity check code

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0049] The selective annealing minimum-sum decoding method of the present invention uses the variable node to merge the external information flowing into the check node and the information from the channel as the judgment soft information of this iteration, to test whether the judgment sequence satisfies the check equation, write down or update the check If the serial number set of the unsuccessful check node is empty, the decoding ends; if the serial number set of the unsuccessful check node is not empty, the check node sends the variable The node updates the output information, and multiplies the output information of the verification node whose verification is unsuccessful by a factor less than 1 for annealing processing, and transfers to the next iterative decoding.

[0050] The specific steps are as follows:

[0051] Step 1: Initialize the symbol variable s of the check node m = 1, sign k (c m )=1, the minimum min k (c m )=100 and sub-min k (c m )=100.

[0052] St...

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 a minimum sum decoding method of selective annealing of a low density parity check code, which is suitable for soft decision decoding of the low density parity check codes and replaces the traditional multiplicative revise minimum sum decoding method. Based on the minimum sum decoding method, the invention adopts a multiplicative factor smaller than 1 to revise output of check nodes with unsuccessful check. The method comprises the following implementation steps of: merging external information quantity input by the check nodes and information from a channel by a variable node as decision soft information of iteration; probing whether a decision sequence satisfies a check equation; taking down or updating a node sequence set U with unsuccessful check, if U is empty, finishing decoding, and if U is not empty, updating and outputting information to the variable node by the check nodes based on minimum sum regulations; carrying out annealing treatment on check node output information belonging to U plus a factor smaller than 1; and turning to next iterative decoding. In the method, the performance is obviously superior to other improved minimum sum decoding method, and the calculation complexity is far lower than a sum-product algorithm.

Description

technical field [0001] The invention relates to a simplified decoding method for soft-judgment iterative decoding of low-density parity check codes, and belongs to the technical field of channel error correction coding decoding. Background technique [0002] Among the decoding methods of Low-Density Parity-Check (LDPC) codes, the iterative soft-decision decoding method based on bipartite graph has good bit error rate performance. For longer irregular LDPC codes , performance close to the Shannon limit can be achieved. The standard soft-decision algorithm is called the sum product algorithm. When the algorithm calculates the information output of the check node, whether it is decoding in the probability domain or the log likelihood ratio domain, it always involves a large number of additions, multiplications, Logarithmic and exponential operations, plus a large number of nodes, make the operation more complex. The minimum-sum decoding method is a simplification of the algor...

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
Inventor 吴晓富赵春明姜明尤肖虎
Owner PLA UNIV OF SCI & 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