General recursive coding method of spatially coupled low density parity check code

Abstract

The invention provides a general recursive coding method of a spatially coupled low density parity check code. The method comprises the following steps: building a check base matrix H-tilde<T> of a (d<v>, d<c>, L) spatially coupled low density parity check code SC-LDPC, wherein the check base matrix H-tilde<T> is a d<c>*(2*d<v>-1)-dimensional matrix each row of which comprises d<v> continuous sub matrices, first d<v> elements of the first row in the check base matrix H-tilde<T> are sub matrices, and d<v> elements of the last row in the check base matrix H-tilde<T> are sub matrices; and obtaining a check matrix H<T><0, L-1> of the SC-LDPC through the check base matrix H-tilde<T>, and performing recursive coding using the check matrix H<T><0, L-1>. The general recursive coding method, provided in the invention, of the spatially coupled low density parity check code can achieve the recursive coding of the (d<v>, d<c>, L) SC-LDPC when d<c> / d<v> is any value.

Description

technical field [0001] The invention relates to the technical field of digital communication, in particular to a universal recursive coding method of a space-coupled low-density parity-check code. Background technique [0002] Low Density Parity Check Code (LDPC for short) is a linear block code with a very "sparse" parity check matrix, and its decoding performance is close to the Shannon channel capacity. LDPC codes have multiple branches, for example: parity check The matrix has a quasi-cyclic low-density parity check code (Quasi Cyclic Low Density Check Code, QC-LDPC for short), a block LDPC code in which the parity check matrix is ​​composed of a series of matrix blocks, and so on. Among them, the spatially coupled Low Density Parity Check Code (Spatially coupled Low Density Parity Check Code, referred to as SC-LDPC code) is an extension of the block LDPC code. When the coupling length is long enough, the confidence propagation decoding performance of the SC-LDPC code c...

AI Technical Summary

Problems solved by technology

figure 2 is a typical protograph of the (4,6,L)SC-LDPC code in the prior art, such as figure 2 shown, d c / d v is a non-integer number, each coupling position contains 6 variable nodes and 4 check nodes, and each variable node includes 2 information bit sequences and 4 check bit sequences, figure 2 For the (4,6,L)SC-LDPC code shown, the parity bit sequence at the current coupling position cannot be obtained from the information bit sequence at the current coupling position and the coded information encoded at the previous coupling position, that is, the current coupling position The check bit sequence of cannot be uniquely determined recursively

[0006] In summary, in the prior art (d v , d c ,L) SC-LDPC code, when d c / d v Cannot implement recursive encoding when it is a non-integer

Images