Low-complexity maximum likelihood approximate q-ary LDPC (Low-Density Parity-Check) code decoding method

A LDPC code, low-complexity technology, applied in the field of wireless communication, can solve the problem of non-convergence of iterative decoding algorithm, and achieve the effect of low-complexity

Active Publication Date: 2017-07-07
XIDIAN UNIV
View PDF3 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The purpose of the present invention is to address the deficiencies in the prior art above, to propose a low-complexity approximate maximum-likelihood multivariate low-density parity-check LDPC code decoding method, which solves the problem of iterative decoding algorithms falling into the trap set with relatively low complexity non-convergent 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
  • Low-complexity maximum likelihood approximate q-ary LDPC (Low-Density Parity-Check) code decoding method
  • Low-complexity maximum likelihood approximate q-ary LDPC (Low-Density Parity-Check) code decoding method
  • Low-complexity maximum likelihood approximate q-ary LDPC (Low-Density Parity-Check) code decoding method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0048] The present invention will be further described below in conjunction with the drawings.

[0049] Reference attached figure 1 , The implementation method of the present invention will be further described.

[0050] Step 1. Set the maximum number of decoding iterations I=100.

[0051] Step 2. Perform iterative decoding.

[0052] After binary phase shift keying BPSK modulation is performed on the multi-element low-density parity-check LDPC code, the modulated information is sent to the additive white Gaussian noise AWGN channel for noise processing to obtain the noise-added message.

[0053] The sum-product algorithm FFT-QSPA based on fast Fourier transform is used to iteratively decode the noise-added message.

[0054] Step 3. Determine whether a legal codeword is found within the maximum iteration times of the sum-product algorithm FFT-QSPA based on the fast Fourier transform, if yes, perform step (19), otherwise, perform step (4).

[0055] The legal codeword refers to a sequence t...

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 low-complexity maximum likelihood approximate q-ary LDPC (Low-Density Parity-Check) code decoding method. The problem that in the prior art, a trapping set of an iterative decoding method for q-ary LDPC codes is not converged and the problem that the complexity of the approximate maximum likelihood decoding method for the q-ary LDPC codes is relatively high are solved. The method provided by the invention comprises the steps of carrying out iterative decoding; converting a q-ary form into a binary form; selecting deletion bits; selecting additional deletion bits; carrying out bit deletion operation on a binary judgment sequence; carrying out binary list erasure decoder on a deletion sequence; establishing a candidate codon list; determining the current minimum Euclidean distance; and assigning the current minimum Euclidean distance to the current threshold Euclidean distance; and finishing decoding. According to the method, an FFT-QSPA (fast Fourier transform based q-ary sum-product algorithm) and a binary list erasure decoder LED method with relatively low complexity are cascaded, so the decoding performance is approximate to the maximum likelihood decoding performance, and the decoding complexity is relatively low.

Description

Technical field [0001] The invention belongs to the field of wireless communication technology, and further relates to a low-complexity approximate maximum likelihood multi-element low-density parity-check LDPC (Low-Density Parity-Check) code decoding method in the technical field of channel coding. The invention can be used for error control decoding in short frame length application fields such as machine communication, remote command link and intelligent measurement network. Background technique [0002] Multivariate low-density parity-check LDPC codes have attracted the attention of researchers since they were proposed. Existing research results show that, compared to binary low-density parity-check LDPC codes, multi-element low-density parity-check LDPC codes have better error correction performance, stronger resistance to burst errors and higher data transmission rate. [0003] In view of the above-mentioned advantages of multi-element low-density parity-check LDPC codes, m...

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/1105
Inventor 白宝明邓堤峡徐恒舟张冀
Owner XIDIAN UNIV
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