A Low Complexity Approximate Maximum Likelihood Decoding Method for Multivariate ldpc Codes

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 technical field of wireless communication, and further relates to a low-complexity approximate maximum likelihood multivariate 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 type communication, remote instruction 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 with binary LDPC LDPC codes, multivariate 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 multivariate LDPC codes, many studies have been done on encoding and decoding sche...

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

Images