Patent ID: 8418015

Claim:
A method for coding of a LDPC code, comprising: A. constructing each layer of check matrix of the layered LDPC code used as an error correcting code; B. prior to initially sending data by a data transmitting terminal, performing first-layer-coding of the data to be sent by using a first layer of the check matrix of the LDPC code, sending the first-layer-coded data; C. prior to sending data for (n−1)th retransmission by the data transmitting terminal, performing nth-layer-coding of the data by using an nth layer of the check matrix of the LDPC code; D. sending the nth-layer-coded data, wherein n is an integer no less than 2, wherein the method for constructing each layer of check matrix of the layered LDPC code of step A is a method for constructing a quasi-cyclic LDPC code and the step A comprises: A1. setting parameters of a mother matrix; A2. constructing the mother matrix M 0 based on the set parameters; constructing a base check matrix H 0 based on the mother matrix M 0 by power method for constructing quasi-cyclic code, the base check matrix H 0 serving as the first layer of the check matrix; A3. setting an initial value of m to be 2; A4. constructing a mother matrix M m−1 of the mth layer of the check matrix; A5. generating a cyclic permutation matrix by power method to substitute a selected block in M m−1 , so that the mth layer of a check matrix H m−1 is obtained; A6. judging whether m reaches a predetermined value, terminating this procedure if so; else, increasing the value of m by 1 and returning back to step A4, and wherein the method for constructing each layer of the check matrix of the layered LDPC code is a bit-filling method or a progressive edge-growth algorithm, and wherein the data for the coding in step C are the coded data of all previous n−1 layers; the nth-layer-coding of the data by using the nth layer of the check matrix of the LDPC code in step C is specifically: determining structures of previous n layers of check matrix H m−1 in accordance with the formula: H m - 1 = ( A B T 0 0 0 C D E 0 0 0 Q 11 Q 12 Q 13 P 1 0 0 ⁢ ⋯ Q m - 1 , 1 Q m - 1 , 2 Q m - 1 , 3 ⋯ Q m - 1. ⁢ m + 1 P m - 1 ) , wherein m=n, and the nth layer of the check matrix is the last line of H m−1 ; and determining a coding result p m+1 T of the mth layer in accordance with the formula: p m+1 T =P m−1 −1 (Q m−1,1 s T +Q m−1,2 p 1 T +Q m−1,3 p 2 T + . . . +Q m−1,m +1 p m T ), wherein s is a known information bit, p 1 , p 1 , p 3 , . . . , p m are known coding results of coding of upper layers relative to the mth layer, the superscript T represents transpose, and the superscript −1 represents inversion, and the LDPC code of said each layer is a block-type LDPC code.