IP Library › Granted Patent US 11,611,356

Granted Patent B2

US 11,611,356 · App. 17/684,144 · Granted Mar 21, 2023

Method and apparatus for low density parity check channel coding in wireless communication system

Inventors: Jie Jin (Shenzhen, CN); Wen Tong (Ottawa, CA); Jun Wang (Hangzhou, CN); Aleksandr Aleksandrovich Petiushko (Moscow, RU); Ivan Leonidovich Mazurenko (Moscow, RU); Chaolong Zhang (Hangzhou, CN)

Assignee: Huawei Technologies Co., Ltd.

H03M13/1148 H03M13/616 H04L1/005 H04L1/0061

View Patent ↗

Loading inventors, assignments & file history…

Monitor This Case

Get email alerts when status or documents change.

Order Certified Copies

Most orders are placed with the USPTO same day — all within 24 business hours.

Order via The Patent Place →

Pre-filled with this patent's details

Quick Facts

Patent No.: US 11,611,356
App. No.: 17/684,144
Granted: Mar 21, 2023
Kind: B2

External Links

USPTO Patent Center↗ Full Patent PDF↗

Abstract

A low density parity check (LDPC) channel encoding method is used in a wireless communications system. A communication device encodes an input bit sequence by using an LDPC matrix, to obtain an encoded bit sequence for transmission. The LDPC matrix is obtained based on a lifting factor Z and a base matrix. The base matrix may be one of eight exemplary designs. The encoding method can be used in various communications systems including fifth generation (5G) telecommunication systems, and can support various encoding requirements for information bit sequences with different code lengths.

Claims (223)

1. A method for wireless communication, comprising:

obtaining, by a communication apparatus, an input sequence;

decoding, by the communication apparatus, the input sequence using a matrix H to obtain a decoded sequence; and

outputting, by the communication apparatus, the decoded sequence;

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

wherein the base matrix comprises m rows and n columns;

wherein each element in the base matrix has a respective row index i and a respective column index j, where 0≤i≤m and 0≤j≤n;

wherein each element in the base matrix is either a zero-element or a non-zero-element;

wherein the base matrix comprises at least one of the following rows:

a thirty-third row corresponding to row index i=32 having non-zero-elements at columns corresponding to column indexes j=0, 5, 12, 42;

a thirty-fourth row corresponding to row index i=33 having non-zero-elements at columns corresponding to column indexes j=2, 7, 10, 43;

a thirty-fifth row corresponding to row index i=34 having non-zero-elements at columns corresponding to column indexes j=0, 12, 13, 44;

a thirty-sixth row corresponding to row index i=35 having non-zero-elements at columns corresponding to column indexes j =1, 5, 11, 45;

a thirty-seventh row corresponding to row index i=36 having non-zero-elements at columns corresponding to column indexes j=0, 2, 7, 46;

a thirty-eighth row corresponding to row index i=37 having non-zero-elements at columns corresponding to column indexes j=10, 13, 47;

a thirty-ninth row corresponding to row index i=38 having non-zero-elements at columns corresponding to column indexes j=1, 5, 11, 48;

a fortieth row corresponding to row index i=39 having non-zero-elements at columns corresponding to column indexes j=0, 7, 12, 49;

a forty-first row corresponding to row index i=40 having non-zero-elements at columns corresponding to column indexes j=2, 10, 13, 50; or

a forty-second row corresponding to row index i=41 having non-zero-elements at columns corresponding to column indexes j=1, 5, 11, 51.

2. The method according to claim 1 , wherein each zero-element in the base matrix corresponds to an all-zero matrix of size Z×Z in the matrix H;

wherein a non-zero-element with a row index i and a column index j has a value and corresponds to a circular permutation matrix I(P i,j ) of size Z×Z in the matrix H; and

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

3. The method according to claim 1 , wherein the decoded sequence comprises K bits, where K=10×Z.

4. The method according to claim 1 , wherein the lifting factor Z satisfies Z=a× 2 j , where α∈{2, 3, 5, 7, 9, 11, 13, 15}, and

wherein:

in case of a=2, j=0, 1, 2, 3, 4, 5, 6 or 7;

in case of a=3, j=0, 1, 2, 3, 4, 5, 6 or 7;

in case of a=5, j=0, 1, 2, 3, 4, 5 or 6;

in case of a=7, j=0, 1, 2, 3, 4 or 5;

in case of a=9, j=0, 1, 2, 3, 4 or 5;

in case of a=11, j=0, 1, 2, 3, 4 or 5;

in case of a=13, j=0, 1, 2, 3 or 4; or

in case of a=15, j=0, 1, 2, 3 or 4.

5. The method according to claim 1 , wherein the decoded sequence comprises K bits, wherein the lifting factor Z=Z 0 , wherein Z 0 is a minimum of a plurality of lifting factors satisfying a relationship of Kb×Z 0 ≥K, and wherein Kb is one of {6, 8, 9, 10}.

6. The method according to claim 5 , wherein:

in case of K>640, Kb is equal to 10;

in case of K>560 and K≤640, Kb is equal to 9;

in case of K>192 and K≤560, Kb is equal to 8; or

in case of K≤192, Kb is equal to 6.

7. The method according to claim 1 , wherein the base matrix further comprises at least one of the following rows:

a first row corresponding to row index i=0 having non-zero-elements at columns corresponding to column indexes j=0, 1, 2, 3, 6, 9, 10, 11;

a second row corresponding to row index i=1 having non-zero-elements at columns corresponding to column indexes j=0, 3, 4, 5, 6, 7, 8, 9, 11, 12;

a third row corresponding to row index i=2 having non-zero-elements at columns corresponding to column indexes j=0, 1, 3, 4, 8, 10, 12, 13;

a fourth row corresponding to row index i=3 having non-zero-elements at columns corresponding to column indexes j=1, 2, 4, 5, 6, 7, 8, 9, 10, 13;

a fifth row corresponding to row index i=4 having non-zero-elements at columns corresponding to column indexes j=0, 1, 11, 14;

a sixth row corresponding to row index i=5 having non-zero-elements at columns corresponding to column indexes j=0, 1, 5, 7, 11, 15;

a seventh row corresponding to row index i=6 having non-zero-elements at columns corresponding to column indexes j=0, 5, 7, 9, 11, 16;

an eighth row corresponding to row index i=7 having non-zero-elements at columns corresponding to column indexes j=1, 5, 7, 11, 13, 17;

a ninth row corresponding to row index i=8 having non-zero-elements at columns corresponding to column indexes j=0, 1, 12, 18;

a tenth row corresponding to row index i=9 having non-zero-elements at columns corresponding to column indexes j=1, 8, 10, 11, 19;

an eleventh row corresponding to row index i=10 having non-zero-elements at columns corresponding to column indexes j=0, 1, 6, 7, 20;

a twelfth row corresponding to row index i=11 having non-zero-elements at columns corresponding to column indexes j=0, 7, 9, 13, 21;

a thirteenth row corresponding to row index i=12 having non-zero-elements at columns corresponding to column indexes j=1, 3, 11, 22;

a fourteenth row corresponding to row index i=13 having non-zero-elements at columns corresponding to column indexes j=0, 1, 8, 13, 23;

a fifteenth row corresponding to row index i=14 having non-zero-elements at columns corresponding to column indexes j=1, 6, 11, 13, 24;

a sixteenth row corresponding to row index i=15 having non-zero-elements at columns corresponding to column indexes j=0, 10, 11, 25;

a seventeenth row corresponding to row index i=16 having non-zero-elements at columns corresponding to column indexes j=1, 9, 11, 12, 26;

an eighteenth row corresponding to row index i=17 having non-zero-elements at columns corresponding to column indexes j=1, 5, 11, 12, 27;

a nineteenth row corresponding to row index i=18 having non-zero-elements at columns corresponding to column indexes j=0, 6, 7, 28;

a twentieth row corresponding to row index i=19 having non-zero-elements at columns corresponding to column indexes j=0, 1, 10, 29;

a twenty-first row corresponding to row index i=20 having non-zero-elements at columns corresponding to column indexes j=1, 4, 11, 30;

a twenty-second row corresponding to row index i=21 having non-zero-elements at columns corresponding to column indexes j=0, 8, 13, 31;

a twenty-third row corresponding to row index i=22 having non-zero-elements at columns corresponding to column indexes j=1, 2, 32;

a twenty-fourth row corresponding to row index i=23 having non-zero-elements at columns corresponding to column indexes j=0, 3, 5, 33;

a twenty-fifth row corresponding to row index i=24 having non-zero-elements at columns corresponding to column indexes j=1, 2, 9, 34;

a twenty-sixth row corresponding to row index i=25 having non-zero-elements at columns corresponding to column indexes j=0, 5, 35;

a twenty-seventh row corresponding to row index i=26 having non-zero-elements at columns corresponding to column indexes j=2, 7, 12, 13, 36;

a twenty-eighth row corresponding to row index i=27 having non-zero-elements at columns corresponding to column indexes j=0, 6, 37;

a twenty-ninth row corresponding to row index i=28 having non-zero-elements at columns corresponding to column indexes j=1, 2, 5, 38;

a thirtieth row corresponding to row index i=29 having non-zero-elements at columns corresponding to column indexes j=0, 4, 39;

a thirty-first row corresponding to row index i=30 having non-zero-elements at columns corresponding to column indexes j=2, 5, 7, 9, 40; or

a thirty-second row corresponding to row index i=31 having non-zero-elements at columns corresponding to column indexes j=1, 13, 41.

8. The method according to claim 1 , wherein the matrix H is determined according to a permutated matrix of the base matrix, and wherein the permutated matrix is obtained by performing row permutation and/or column permutation on the base matrix.

9. The method according to claim 1 , wherein n=m+10.

10. The method according to claim 1 , wherein 33≤m≤42 and 43≤n≤52.

11. An apparatus for wireless communication, comprising:

at least one processor configured to:

obtain an input sequence;

decode the input sequence using a matrix H to obtain a decoded sequence; and output the decoded sequence;

wherein the matrix H is based on a base matrix and a lifting factor Z, wherein Z is a positive integer;

wherein the base matrix comprises m rows and n columns;

wherein each element in the base matrix has a respective row index i and a respective column index j, where 0≤i≤m and 0≤j<n;

wherein each element in the base matrix is either a zero-element or a non-zero-element;

wherein the base matrix comprises at least one of the following rows:

a thirty-third row corresponding to row index i=32 having non-zero-elements at columns corresponding to column indexes j=0, 5, 12, 42;

a thirty-fourth row corresponding to row index i=33 having non-zero-elements at columns corresponding to column indexes j=2, 7, 10, 43;

a thirty-fifth row corresponding to row index i=34 having non-zero-elements at columns corresponding to column indexes j=0, 12, 13, 44;

a thirty-sixth row corresponding to row index i=35 having non-zero-elements at columns corresponding to column indexes j=1, 5, 11, 45;

a thirty-seventh row corresponding to row index i=36 having non-zero-elements at columns corresponding to column indexes j=0, 2, 7, 46;

a thirty-eighth row corresponding to row index i=37 having non-zero-elements at columns corresponding to column indexes j=10, 13, 47;

a thirty-ninth row corresponding to row index i=38 having non-zero-elements at columns corresponding to column indexes j=1, 5, 11, 48;

a fortieth row corresponding to row index i=39 having non-zero-elements at columns corresponding to column indexes j=0, 7, 12, 49;

a forty-first row corresponding to row index i=40 having non-zero-elements at columns corresponding to column indexes j=2, 10, 13, 50; or

a forty-second row corresponding to row index i=41 having non-zero-elements at columns corresponding to column indexes j=1, 5, 11, 51.

12. The apparatus according to claim 11 , wherein each zero-element in the base matrix corresponds to an all-zero matrix of size Z×Z in the matrix H;

wherein a non-zero-element with a row index i and a column index j has a value V i,j and corresponds to a circular permutation matrix I(P i,j ) of size Z×Z in the matrix H; and

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

13. The apparatus according to claim 11 , wherein the decoded sequence comprises K bits, where K=10×Z.

14. The apparatus according to claim 11 , wherein the lifting factor Z satisfies Z=a×2 j , where α∈{2, 3, 5, 7, 9, 11, 13, 15}, wherein:

in case of a=2, j=0, 1, 2, 3, 4, 5, 6 or 7;

in case of a=3, j=0, 1, 2, 3, 4, 5, 6 or 7;

in case of a=5, j=0, 1, 2, 3, 4, 5 or 6;

in case of a=7, j=0, 1, 2, 3, 4 or 5;

in case of a=9, j=0, 1, 2, 3, 4 or 5;

in case of a=11, j=0, 1, 2, 3, 4 or 5;

in case of a=13, j=0, 1, 2, 3 or 4; or

in case of a=15, j=0, 1, 2, 3 or 4.

15. The apparatus according to claim 11 , wherein the decoded sequence comprises K bits, wherein the lifting factor Z=Z 0 , wherein Z 0 is a minimum of a plurality of lifting factors satisfying a relationship of Kb×Z 0 ≥K, and wherein Kb is one of {6, 8, 9, 10}.

16. The apparatus according to claim 15 , wherein:

in case of K>640, Kb is equal to 10;

in case of K>560 and K≤640, Kb is equal to 9;

in case of K>192 and K≤560, Kb is equal to 8; or

in case of K≤192, Kb is equal to 6.

17. The apparatus according to claim 11 , wherein the base matrix further comprises at least one of the following rows: