Linear programming decoding method for high-rate low-density parity check code

Abstract

The invention discloses a linear programming decoding method for a high-rate low-density parity check (LDPC) code, and solves a problem of low decoding rate of an LDPC decoding method in the prior art. The method comprises the following steps: initializing a decoding parameter; calculating an initial variable node message; calculating a residual check node message; updating a check node message; updating a variable node message; re-calculating the residual check node message; judging decoding termination; outputting a decoding result. The check node message of one check node with the best decoding convergence effect and the variable node message of a variable node adjacent to the check node are only updated in decoding iteration each time, so that the decoding rate is greatly increased.

Description

technical field [0001] The invention belongs to the technical field of communication, and further relates to a linear programming decoding method of a high-rate low-density parity check (Low-Density Parity-Check, LDPC) code in the technical field of channel coding. The invention can realize high-speed linear programming decoding of low density parity check LDPC code based on ADMM algorithm. Background technique [0002] Low-density parity check LDPC code has low decoding complexity and good performance close to the Shannon limit. It is widely used in modern communication fields, such as deep space communication, wireless communication, etc., and adopted by various modern communication standards, such as 802.11n , 802.16e, 10GBASE-T, etc., are the research hotspots in the field of channel coding in recent years. [0003] The decoding methods of low density parity check LDPC codes are divided into two categories: message passing methods and linear programming decoding methods...

AI Technical Summary

Problems solved by technology

Although this method solves the problem of low decoding rate of the linear programming decoding method of low-density parity-check LDPC codes, it still has the disadvantage that the standard linear programming problem solving method needs to be used to solve the linear programming problem multiple times in the decoding process. , so although this decoding method can increase the decoding rate, the improvement is limited

The disadvantage of this method is that: in each iteration of the ADMM-based low-density parity check LDPC code linear programming decoding method, the check node messages of all check nodes and the variable node messages of variable nodes need to be updated, and the updated check node The check node information needs to execute the Euclidean projection operation with high time complexity, the decoding speed is slow and the calculation amount is large, and the decoding efficiency is not high

Images