Granted Patent B2

US 10,432,219 · App. 16/205,186 · Granted Oct 1, 2019

Inventors: Chen Zheng (Shanghai, CN); Liang Ma (Shanghai, CN); Xiaojian Liu (Shenzhen, CN); Yuejun Wei (Shanghai, CN); Xin Zeng (Shenzhen, CN)

Assignee: HUAWEI TECHNOLOGIES CO., LTD.

H03M13/1102H03M13/116H03M13/616H03M13/6393H03M13/6516

Abstract

Claims (170)

1. A method for communicating information between communication devices, comprising:

receiving, by a communication device, an input sequence, wherein the input sequence comprises K bits of information, and K is a positive integer;

encoding, by the communication device, the input sequence using a matrix H, to obtain an encoded sequence; and

outputting, by the communication device, the encoded sequence for a transmission to another communication device;

wherein the matrix H is determined according to a base matrix and a lifting factor Z;

wherein the base matrix comprises m rows and n columns, m and n are integers, and 5≤m≤46, and 27≤n≤68;

wherein elements in the base matrix are represented by row index i and column index j, 0≤i≤m, 0≤j≤n;

wherein an element V i,j of the base matrix is a non-zero-element when

i=0, j=0, 1, 2, 3, 5, 6, 9, 10, 11, 12, 13, 15, 16, 18, 19, 20, 21, 22, or 23;

i=1, j=0, 2, 3, 4, 5, 7, 8, 9, 11, 12, 14, 15, 16, 17, 19, 21, 22, 23, or 24;

i=2, j=0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 17, 18, 19, 20, 24, or 25;

i=3, j=0, 1, 3, 4, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17, 18, 20, 21, 22, or 25;

i=4, j=0, 1, or 26.

2. The method according to claim 1 , wherein the lifting factor Z is a minimum of a plurality of lifting factors satisfying a relationship of 22*Z≥K.

3. The method according to claim 1 , wherein the matrix H is a low density parity check (LDPC) matrix.

4. The method according to claim 1 , wherein the input sequence is c={c 0 , c 1 , c 2 , . . . , c K−1 }, the encoded sequence is d={d 0 , d 1 , d 2 , . . . , d N−1 }, wherein c i (i=0, 1, . . . K−1) are information bits, d j (j=0, 1, . . . N−1) are encoded bits, N is a positive integer, and N=66*Z.

5. The method according to claim 4 , wherein the encoded sequence d comprises K 0 bits obtained from the input sequence c and N−K 0 parity bits in a parity sequence w={w 0 , w 1 , w 2 , . . . , w N−K 0 −1 }, K 0 is an integer greater than 0 and less than or equal to K,

wherein the parity sequence w and the input sequence c meet:

H

×

[

c

T

w

T

]

=

0

T

,

wherein c T =[c 0 , c 1 , c 2 , . . . , c K−1 ] T is a transposed vector including bits in the input sequence, w T =[w 0 , w 1 , w 2 , . . . , w N−K 0 −1 ] T is a transposed vector including bits in the parity sequence, 0 T is a column vector, and values of all elements of 0 T are zero.

6. The method according to claim 5 , wherein K 0 =K−2*Z.

7. The method according to claim 1 , wherein in the base matrix, all elements except the non-zero-elements are zero-elements;

wherein each zero-element corresponds to a Z*Z zero matrix in the matrix H,

wherein each non-zero-element V i,j corresponds to a Z*Z circular permutation matrix I(P i,j ) in the matrix H,

wherein P i,j is an integer shift value greater than or equal to zero, and P i,j =mod(V i,j ,Z).

8. The method according to claim 1 , wherein, further, an element V ij of the base matrix is a non-zero-element when:

i=5, j=0, 1, 3, 12, 16, 21, 22, or 27;

i=6, j=0, 6, 10, 11, 13, 17, 18, 20, or 28;

i=7, j=0, 1, 4, 7, 8, 14, or 29;

i=8, j=0, 1, 3, 12, 16, 19, 21, 22, 24, or 30;

i=9, j=0, 1, 10, 11, 13, 17, 18, 20, or 31;

i=10, j=1, 2, 4, 7, 8, 14, or 32;

i=11, j=0, 1, 12, 16, 21, 22, 23, or 33;

i=12, j=0, 1, 10, 11, 13, 18, or 34;

i=13, j=0, 3, 7, 20, 23, or 35;

i=14, j=0, 12, 15, 16, 17, 21, or 36;

i=15, j=0, 1, 10, 13, 18, 25, or 37;

i=16, j=1, 3, 11, 20, 22, or 38;

i=17, j=0, 14, 16, 17, 21, or 39;

i=18, j=1, 12, 13, 18, 19, or 40;

i=19, j=0, 1, 7, 8, 10, or 41;

i=20, j=0, 3, 9, 11, 22, or 42;

i=21, j=1, 5, 16, 20, 21, or 43;

i=22, j=0, 12, 13, 17, or 44;

i=23, j=1, 2, 10, 18, or 45;

i=24, j=0, 3, 4, 11, 22, or 46;

i=25, j=1, 6, 7, 14, or 47;

i=26, j=0, 2, 4, 15, or 48;

i=27, j=1, 6, 8, or 49;

i=28, j=0, 4, 19, 21, or 50;

i=29, j=1, 14, 18, 25, or 51;

i=30, j=0, 10, 13, 24, or 52;

i=31, j=1, 7, 22, 25, or 53;

i=32, j=0, 12, 14, 24, or 54;

i=33, j=1, 2, 11, 21, or 55;

i=34, j=0, 7, 15, 17, or 56;

i=35, j=1, 6, 12, 22, or 57;

i=36, j=0, 14, 15, 18, or 58;

i=37, j=1, 13, 23, or 59;

i=38, j=0, 9, 10, 12, or 60;

i=39, j=1, 3, 7, 19, or 61;

i=40, j=0, 8, 17, or 62;

i=41, j=1, 3, 9, 18, or 63;

i=42, j=0, 4, 24, or 64;

i=43, j=1, 16, 18, 25, or 65;

i=44, j=0, 7, 9, 22, or 66;

i=45, j=1, 6, 10, or 67.

9. The method according to claim 8 , wherein in the base matrix, all elements except the non-zero-elements are zero-elements;

wherein each zero-element corresponds to a Z*Z zero matrix in the matrix H,

wherein each non-zero-element V i,j corresponds to a Z*Z circular permutation matrix I(P i,j ) in the matrix H,

wherein P i,j is an integer shift value greater than or equal to zero, and P i,j =mod(V i,j ,Z).

10. A communication apparatus, comprising:

a transceiver;

one or more memories configured to store program instructions; and

one or more processors coupled to the one or more memories and configured to execute the program instructions;

wherein the program instructions cause the apparatus to:

receive an input sequence, wherein the input sequence comprising K bits of information, and K is a positive integer;

encode the input sequence using a matrix H, to obtain an encoded sequence; and

output the encoded sequence for a transmission to another communication apparatus;

wherein the matrix H is determined according to a base matrix and a lifting factor Z;

wherein the base matrix comprises m rows and n columns, m and n are integers, and 5≤m≤46, and 27≤n≤68;

wherein elements in the base matrix are represented by row index i and column index j, 0≤i≤m, 0≤j≤n;

wherein an element V i,j of the base matrix is a non-zero-element when:

i=0, j=0, 1, 2, 3, 5, 6, 9, 10, 11, 12, 13, 15, 16, 18, 19, 20, 21, 22, or 23;

i=1, j=0, 2, 3, 4, 5, 7, 8, 9, 11, 12, 14, 15, 16, 17, 19, 21, 22, 23, or 24;

i=2, j=0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 17, 18, 19, 20, 24, or 25;

i=3, j=0, 1, 3, 4, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17, 18, 20, 21, 22, or 25;

i=4, j=0, 1, or 26.

11. The apparatus according to claim 10 , wherein the lifting factor Z is a minimum of a plurality of lifting factors satisfying a relationship 22*Z≥K.

12. The apparatus according to claim 10 , wherein the matrix H is a low density parity check (LDPC) matrix.

13. The apparatus according to claim 10 , wherein the input sequence is c={c 0 , c 1 , c 2 , . . . , c K−1 }, the encoded sequence d={d 0 , d 1 , d 2 , . . . , d N−1 }, wherein c i (i=0, 1, . . . K−1) are information bits, d j (j=0, 1, . . . N−1) are encoded bits, wherein N is a positive integer, and N=66*Z.

14. The apparatus according to claim 13 , wherein the encoded sequence d comprises K 0 bits obtained from the input sequence c and N−K 0 parity bits in a parity sequence w={w 0 , w 1 , w 2 , . . . , w N−K 0 −1 }), K 0 is an integer greater than 0 and less than or equal to K,

wherein the parity sequence w and the input sequence c meet:

H

×

[

c

T

w

T

]

=

0

T

,

wherein c T =[c 0 , c 1 , c 2 , . . . , c K−1 ] T is a transposed vector including bits in the input sequence, w T =[w 0 , w 1 , w 2 , . . . , w N−K 0 −1 ] T is a transposed vector including bits in the parity sequence, 0 T is a column vector, and values of all elements of 0 T are zero.

15. The apparatus according to claim 14 , wherein K 0 =K−2*Z.

16. The apparatus according to claim 12 , wherein in the base matrix, all elements except the non-zero-elements are zero-elements;

wherein each zero-element corresponds to a Z*Z zero matrix in the matrix H,

wherein each non-zero-element V i,j corresponds to a Z*Z circular permutation matrix I(P i,j ) in the matrix H,

wherein P i,j is an integer shift value greater than or equal to zero, and P i,j =mod(V i,j ,Z).

17. The apparatus according to claim 10 , wherein, further, an element V ij of the base matrix is a non-zero-element when:

i=5, j=0, 1, 3, 12, 16, 21, 22, or 27;

i=6, j=0, 6, 10, 11, 13, 17, 18, 20, or 28;

i=7, j=0, 1, 4, 7, 8, 14, or 29;

i=8, j=0, 1, 3, 12, 16, 19, 21, 22, 24, or 30;

i=9, j=0, 1, 10, 11, 13, 17, 18, 20, or 31;

i=10, j=1, 2, 4, 7, 8, 14, or 32;

i=11, j=0, 1, 12, 16, 21, 22, 23, or 33;

i=12, j=0, 1, 10, 11, 13, 18, or 34;

i=13, j=0, 3, 7, 20, 23, or 35;

i=14, j=0, 12, 15, 16, 17, 21, or 36;

i=15, j=0, 1, 10, 13, 18, 25, or 37;

i=16, j=1, 3, 11, 20, 22, or 38;

i=17, j=0, 14, 16, 17, 21, or 39;

i=18, j=1, 12, 13, 18, 19, or 40;

i=19, j=0, 1, 7, 8, 10, or 41;

i=20, j=0, 3, 9, 11, 22, or 42;

i=21, j=1, 5, 16, 20, 21, or 43;

i=22, j=0, 12, 13, 17, or 44;

i=23, j=1, 2, 10, 18, or 45;

i=24, j=0, 3, 4, 11, 22, or 46;

i=25, j=1, 6, 7, 14, or 47;

i=26, j=0, 2, 4, 15, or 48;

i=27, j=1, 6, 8, or 49;

i=28, j=0, 4, 19, 21, or 50;

i=29, j=1, 14, 18, 25, or 51;

i=30, j=0, 10, 13, 24, or 52;

i=31, j=1, 7, 22, 25, or 53;

i=32, j=0, 12, 14, 24, or 54;

i=33, j=1, 2, 11, 21, or 55;

i=34, j=0, 7, 15, 17, or 56;

i=35, j=1, 6, 12, 22, or 57;

i=36, j=0, 14, 15, 18, or 58;

i=37, j=1, 13, 23, or 59;

i=38, j=0, 9, 10, 12, or 60;

i=39, j=1, 3, 7, 19, or 61;

i=40, j=0, 8, 17, or 62;

i=41, j=1, 3, 9, 18, or 63;

i=42, j=0, 4, 24, or 64;

i=43, j=1, 16, 18, 25, or 65;

i=44, j=0, 7, 9, 22, or 66;

i=45, j=1, 6, 10, or 67.

18. The apparatus according to claim 10 , wherein in the base matrix, all elements except the non-zero-elements are zero-elements;

wherein each zero-element corresponds to a Z*Z zero matrix in the matrix H,

wherein each non-zero-element V i,j corresponds to a Z*Z circular permutation matrix I(P i,j ) in the matrix H,

wherein P i,j is an integer shift value greater than or equal to zero, and P i,j =mod(V i,j ,Z).

19. The apparatus according to claim 18 , wherein the one or more memories are further configured to store the base matrix, one or more lifting factors Z, or one or more circular permutation matrices.

20. The apparatus of claim 10 , wherein the apparatus is network device or a terminal device in a communication network.

Assignments (1)

Priority Claims (7)

Continuity (2)

Cited By (10)

US 50,437 US 51,040 US 12,191,883 US 12,261,693 US 12,301,255 US 12,323,162 US 12,476,733 US 12,640,842 US 12,659,073 US 12,726,217