IP Library › Granted Patent US 12,301,255
Granted Patent B2
US 12,301,255 · App. 18/674,754 · Granted May 13, 2025

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/1148H03M13/616H04L1/005H04L1/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 12,301,255
App. No.
18/674,754
Granted
May 13, 2025
Kind
B2
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 (201)

1. A method, comprising:

determining, by an apparatus, a lifting factor Z and a base matrix, wherein Z is a positive integer; and

performing, by the apparatus, low-density parity-check (LDPC) encoding on an input sequence based on the lifting factor Z and the base matrix, to obtain an encoded sequence:

wherein the base matrix includes 42 rows and 52 columns, and each element in the base matrix is an element corresponding to a Z×Z circular permutation matrix or an element corresponding to a Z×Z all-zero matrix; and

wherein the number of elements corresponding to a Z×Z circular permutation matrix in each row of the 42 rows of the base matrix is, respectively: 8, 10, 8, 10, 4, 6, 6, 6, 4, 5, 5, 5, 4, 5, 5, 4, 5, 5, 4, 4, 4, 4, 3, 4, 4, 3, 5, 3, 4, 3, 5, 3, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4.

2. The method according to claim 1 , wherein:

for row i=0, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 2, 3, 6, 9, 10, 11;

for row i=1, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 3, 4, 5, 6, 7, 8, 9, 11, 12;

for row i=2, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 3, 4, 8, 10, 12, 13;

for row i=3, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 2, 4, 5, 6, 7, 8, 9, 10, 13;

for row i=4, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 11, 14;

for row i=5, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 5, 7, 11, 15;

for row i=6, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 5, 7, 9, 11, 16;

for row i=7, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 5, 7, 11, 13, 17;

for row i=8, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 12, 18;

for row i=9, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 8, 10, 11, 19;

for row i=10, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 6, 7, 20;

for row i=11, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 7, 9, 13, 21;

for row i=12, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 3, 11, 22;

for row i=13, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 8, 13, 23;

for row i=14, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 6, 11, 13, 24;

for row i=15, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 10, 11, 25;

for row i=16, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 9, 11, 12, 26;

for row i=17, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 5, 11, 12, 27;

for row i=18, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 6, 7, 28;

for row i=19, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 10, 29;

for row i=20, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 4, 11, 30;

for row i=21, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 8, 13, 31;

for row i=22, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 2, 32;

for row i=23, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 3, 5, 33;

for row i=24, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 2, 9, 34;

for row i=25, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 5, 35;

for row i=26, the elements corresponding to a Z×Z circular permutation matrix are at columns j=2, 7, 12, 13, 36;

for row i=27, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 6, 37;

for row i=28, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 2, 5, 38;

for row i=29, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 4, 39;

for row i=30, the elements corresponding to a Z×Z circular permutation matrix are at columns j=2, 5, 7, 9, 40;

for row i=31, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 13, 41;

for row i=32, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 5, 12, 42;

for row i=33, the elements corresponding to a Z×Z circular permutation matrix are at columns j=2, 7, 10, 43;

for row i=34, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 12, 13, 44;

for row i=35, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 5, 11, 45;

for row i=36, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 2, 7, 46;

for row i=37, the elements corresponding to a Z×Z circular permutation matrix are at columns j=10, 13, 47;

for row i=38, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 5, 11, 48;

for row i=39, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 7, 12, 49;

for row i=40, the elements corresponding to a Z×Z circular permutation matrix are at columns j=2, 10, 13, 50;

for row i=41, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 5, 11, 51;

wherein i represents a row index, j represents a column index, and 0≤i<42; and 0≤j<52.

3. The method according to claim 1 , wherein the lifting factor Z satisfies Z=a×2 j ′, where a ∈ {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.

4. The method according to claim 1 , wherein a respective element corresponding to a respective Z×Z circular permutation matrix has a value V i,j , where i is a row index, j is a column index, 0≤i<42, and 0≤j<52;

wherein the respective Z×Z circular permutation matrix corresponds to a Z×Z identity matrix circularly shifted to the right P i,j times, where P i,j =mod(V i,j ,Z).

5. The method according to claim 1 , wherein the input sequence is represented as c={c 0 , c 1 , c 2 , . . . , c K−1 }, and the encoded sequence is represented as d={d 0 , d 1 , d 2 , . . . , d N−1 }, where K is a length of the input sequence, N is a length of the encoded sequence, and N=50×Z.

6. The method according to claim 5 , wherein the encoded sequence d comprises K 0 bits in 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 }, where K 0 is an integer greater than 0 and less than or equal to K.

7. An apparatus, comprising:

at least one memory having processor-executable instructions stored thereon;

at least one processor configured to execute the processor-executable instructions to facilitate the following being performed by the apparatus;

determining a lifting factor Z and a base matrix, wherein Z is a positive integer; and

performing low-density parity-check (LDPC) encoding on an input sequence based on the lifting factor Z and the base matrix, to obtain an encoded sequence;

wherein the base matrix includes 42 rows and 52 columns, and each element in the base matrix is an element corresponding to a Z×Z circular permutation matrix or an element corresponding to a Z×Z all-zero matrix,

wherein the number of elements corresponding to a Z×Z circular permutation matrix in each row of the 42 rows of the base matrix is, respectively: 8, 10, 8, 10, 4, 6, 6, 6, 4, 5, 5, 5, 4, 5, 5, 4, 5, 5, 4, 4, 4, 4, 3, 4, 4, 3, 5, 3, 4, 3, 5, 3, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4.

8. The apparatus according to claim 7 , wherein the at least one memory is configured to store one or more of the following:

parameters associated with the base matrix;

the base matrix;

the lifting factor Z; or

a transformed matrix of the base matrix.

9. The apparatus according to claim 7 , wherein:

for row i=0, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 2, 3, 6, 9, 10, 11;

for row i=1, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 3, 4, 5, 6, 7, 8, 9, 11, 12;

for row i=2, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 3, 4, 8, 10, 12, 13;

for row i=3, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 2, 4, 5, 6, 7, 8, 9, 10, 13;

for row i=4, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 11, 14;

for row i=5, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 5, 7, 11, 15;

for row i=6, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 5, 7, 9, 11, 16;

for row i=7, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 5, 7, 11, 13, 17;

for row i=8, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 12, 18;

for row i=9, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 8, 10, 11, 19;

for row i=10, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 6, 7, 20;

for row i=11, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 7, 9, 13, 21;

for row i=12, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 3, 11, 22;

for row i=13, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 8, 13, 23;

for row i=14, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 6, 11, 13, 24;

for row i=15, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 10, 11, 25;

for row i=16, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 9, 11, 12, 26;

for row i=17, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 5, 11, 12, 27;

for row i=18, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 6, 7, 28;

for row i=19, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 10, 29;

for row i=20, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 4, 11, 30;

for row i=21, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 8, 13, 31;

for row i=22, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 2, 32;

for row i=23, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 3, 5, 33;

for row i=24, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 2, 9, 34;

for row i=25, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 5, 35;

for row i=26, the elements corresponding to a Z×Z circular permutation matrix are at columns j=2, 7, 12, 13, 36;

for row i=27, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 6, 37;

for row i=28, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 2, 5, 38;

for row i=29, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 4, 39;

for row i=30, the elements corresponding to a Z×Z circular permutation matrix are at columns j=2, 5, 7, 9, 40;

for row i=31, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 13, 41;

for row i=32, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 5, 12, 42;

for row i=33, the elements corresponding to a Z×Z circular permutation matrix are at columns j=2, 7, 10, 43;

for row i=34, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 12, 13, 44;

for row i=35, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 5, 11, 45;

for row i=36, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 2, 7, 46;

for row i=37, the elements corresponding to a Z×Z circular permutation matrix are at columns j=10, 13, 47;

for row i=38, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 5, 11, 48;

for row i=39, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 7, 12, 49;

for row i=40, the elements corresponding to a Z×Z circular permutation matrix are at columns j=2, 10, 13, 50;

for row i=41, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 5, 11, 51;

wherein i represents a row index, j represents a column index, and 0≤i<42; and 0≤j<52.

10. The apparatus according to claim 7 , wherein the lifting factor Z satisfies Z=a×2 j ′, where a ∈ {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.

11. The apparatus according to claim 7 , wherein a respective element corresponding to a respective Z×Z circular permutation matrix has a value V i,j , where i is a row index, j is a column index, 0≤i<42, and 0≤j<52;

wherein the respective circular permutation matrix corresponds to a Z×Z identity matrix circularly shifted to the right P i,j times, where P i,j =mod (V i,j ,Z).

12. The apparatus according to claim 7 , wherein the input sequence is represented as c={c 0 , c 1 , c 2 , . . . , c K−1 }, and the encoded sequence is represented as d={d 0 , d 1 , d 2 , . . . , d N−1 }, where K is a length of the input sequence, N is a length of the encoded sequence, and N=50×Z.

13. The apparatus according to claim 12 , wherein the encoded sequence d comprises K 0 bits in 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 }, where K 0 is an integer greater than 0 and less than or equal to K.

14. A non-transitory computer-readable storage medium having processor-executable instructions stored thereon, wherein the processor-executable instructions, when executed, facilitate:

determining a lifting factor Z and a base matrix, wherein Z is a positive integer; and

performing low-density parity-check (LDPC) encoding on an input sequence based on the lifting factor Z and the base matrix, to obtain an encoded sequence;

wherein the base matrix includes 42 rows and 52 columns, and each element in the base matrix is an element corresponding to a Z×Z circular permutation matrix or an element corresponding to a Z×Z all-zero matrix,

wherein the number of elements corresponding to a Z×Z circular permutation matrix in each row of the base matrix is: 8, 10, 8, 10, 4, 6, 6, 6, 4, 5, 5, 5, 4, 5, 5, 4, 5, 5, 4, 4, 4, 4, 3, 4, 4, 3, 5, 3, 4, 3, 5, 3, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4.

15. The non-transitory computer-readable storage medium according to claim 14 , wherein:

for row i=0, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 2, 3, 6, 9, 10, 11;

for row i=1, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 3, 4, 5, 6, 7, 8, 9, 11, 12;

for row i=2, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 3, 4, 8, 10, 12, 13;

for row i=3, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 2, 4, 5, 6, 7, 8, 9, 10, 13;

for row i=4, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 11, 14;

for row i=5, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 5, 7, 11, 15;

for row i=6, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 5, 7, 9, 11, 16;

for row i=7, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 5, 7, 11, 13, 17;

for row i=8, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 12, 18;

for row i=9, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 8, 10, 11, 19;

for row i=10, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 6, 7, 20;

for row i=11, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 7, 9, 13, 21;

for row i=12, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 3, 11, 22;

for row i=13, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 8, 13, 23;

for row i=14, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 6, 11, 13, 24;

for row i=15, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 10, 11, 25;

for row i=16, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 9, 11, 12, 26;

for row i=17, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 5, 11, 12, 27;

for row i=18, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 6, 7, 28;

for row i=19, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 1, 10, 29;

for row i=20, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 4, 11, 30;

for row i=21, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 8, 13, 31;

for row i=22, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 2, 32;

for row i=23, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 3, 5, 33;

for row i=24, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 2, 9, 34;

for row i=25, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 5, 35;

for row i=26, the elements corresponding to a Z×Z circular permutation matrix are at columns j=2, 7, 12, 13, 36;

for row i=27, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 6, 37;

for row i=28, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 2, 5, 38;

for row i=29, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 4, 39;

for row i=30, the elements corresponding to a Z×Z circular permutation matrix are at columns j=2, 5, 7, 9, 40;

for row i=31, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 13, 41;

for row i=32, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 5, 12, 42:

for row i=33, the elements corresponding to a Z×Z circular permutation matrix are at columns j=2, 7, 10, 43;

for row i=34, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 12, 13, 44;

for row i=35, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 5, 11, 45;

for row i=36, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 2, 7, 46;

for row i=37, the elements corresponding to a Z×Z circular permutation matrix are at columns j=10, 13, 47;

for row i=38, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 5, 11, 48;

for row i=39, the elements corresponding to a Z×Z circular permutation matrix are at columns j=0, 7, 12, 49;

for row i=40, the elements corresponding to a Z×Z circular permutation matrix are at columns j=2, 10, 13, 50;

for row i=41, the elements corresponding to a Z×Z circular permutation matrix are at columns j=1, 5, 11, 51;

wherein i represents a row index, j represents a column index, and 0≤i<42; and 0≤j<52.

16. The non-transitory computer-readable storage medium according to claim 14 , wherein the lifting factor Z satisfies Z=a×2 j ′, where a ∈ {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.

17. The non-transitory computer-readable storage medium according to claim 14 , wherein a respective element corresponding to a respective Z×Z circular permutation matrix has a value V i,j , where i is a row index, j is a column index, 0≤i<42, and 0≤j<52;

wherein the respective circular permutation matrix corresponds to a Z×Z identity matrix circularly shifted to the right P i,j times, where P i,j =mod(V i,j ,Z).

18. The non-transitory computer-readable storage medium according to claim 14 , wherein the input sequence is represented as c={c 0 , c 1 , c 2 , . . . , c K−1 }, and the encoded sequence is represented as d={d 0 , d 1 , d 2 , . . . , d N−1 }, where K is a length of the input sequence, N is a length of the encoded sequence, and N=50×Z.

19. The non-transitory computer-readable storage medium according to claim 18 , wherein the encoded sequence d comprises K 0 bits in 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 }, where K 0 is an integer greater than 0 and less than or equal to K.

20. The non-transitory computer-readable storage medium according to claim 14 , wherein one or more of the following are stored in the non-transitory computer-readable storage medium:

parameters associated with the base matrix;

the base matrix;

the lifting factor Z; or

a transformed matrix of the base matrix.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 24, 2024
From: JIN, JIE; TONG, WEN; WANG, JUN; PETIUSHKO, ALEKSANDR ALEKSANDROVICH; MAZURENKO, IVAN LEONIDOVICH; ZHANG, CHAOLONG
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 067525/0386 →
Priority Claims (2)
CN 201710454030.3 · Jun 15, 2017 · national
CN 201710503056.2 · Jun 27, 2017 · national
Continuity (6)
Continuation 18185998 · Mar 17, 2023
Continuation 17684144 · Mar 1, 2022
Continuation 16923841 · Jul 8, 2020
Continuation 16566331 · Sep 10, 2019
Continuation PCTCN2017092878 · Jul 13, 2017
Related Publication 20240396572A1 · Nov 28, 2024
References Cited (142)
US 6306601B1 · Barton et al. · 2001 [cited by applicant]
US 7178082B2 · Yu et al. · 2007 [cited by applicant]
US 7188297B2 · Blankenship et al. · 2007 [cited by applicant]
US 7191378B2 · Eroz et al. · 2007 [cited by applicant]
US 7600174B2 · Kyung et al. · 2009 [cited by applicant]
US 7774675B1 · Matache et al. · 2010 [cited by applicant]
US 8433984B2 · Khandekar et al. · 2013 [cited by applicant]
US 8578249B2 · Khandekar et al. · 2013 [cited by applicant]
US 9100052B2 · Pisek · 2015 [cited by applicant]
US 9306601B2 · Richardson · 2016 [cited by applicant]
US 9432052B2 · Korb et al. · 2016 [cited by applicant]
US 9559722B1 · Huang et al. · 2017 [cited by applicant]
US 9847794B2 · Kim et al. · 2017 [cited by applicant]
US 10432219B2 · Zheng et al. · 2019 [cited by applicant]
US 10742235B2 · Jin et al. · 2020 [cited by applicant]
US 10771092B2 · Jin et al. · 2020 [cited by applicant]
US 11277153B2 · Jin et al. · 2022 [cited by applicant]
US 11671116B2 · Jin et al. · 2023 [cited by applicant]
US 20040093549A1 · Song et al. · 2004 [cited by applicant]
US 20040186992A1 · Matsumoto · 2004 [cited by applicant]
US 20050283707A1 · Sharon et al. · 2005 [cited by applicant]
US 20060077947A1 · Kim et al. · 2006 [cited by applicant]
US 20060156183A1 · Kim et al. · 2006 [cited by applicant]
US 20070220395A1 · Nimbalker et al. · 2007 [cited by applicant]
US 20090106625A1 · Jun et al. · 2009 [cited by applicant]
US 20090204868A1 · Park et al. · 2009 [cited by applicant]
US 20100058139A1 · Wang et al. · 2010 [cited by applicant]
US 20100251062A1 · Chen et al. · 2010 [cited by applicant]
US 20100257425A1 · Yue et al. · 2010 [cited by applicant]
US 20110004811A1 · Mourad et al. · 2011 [cited by applicant]
US 20110289375A1 · Jiang et al. · 2011 [cited by applicant]
US 20120173949A1 · Liu et al. · 2012 [cited by applicant]
US 20120185746A1 · Oh · 2012 [cited by examiner]
US 20120240001A1 · Abu-Surra et al. · 2012 [cited by applicant]
US 20140223254A1 · Pisek · 2014 [cited by applicant]
US 20140229789A1 · Richardson · 2014 [cited by applicant]
US 20140344639A1 · Kyung et al. · 2014 [cited by applicant]
US 20160087648A1 · Korb et al. · 2016 [cited by applicant]
US 20160094246A1 · Vasista Srinivasan Ranganathan et al. · 2016 [cited by applicant]
US 20160173132A1 · Cho · 2016 [cited by applicant]
US 20160218750A1 · Ma · 2016 [cited by applicant]
US 20160345028A1 · Kim et al. · 2016 [cited by applicant]
US 20170149528A1 · Kim et al. · 2017 [cited by applicant]
US 20170222660A1 · Li et al. · 2017 [cited by applicant]
US 20170230058A1 · Xu et al. · 2017 [cited by applicant]
US 20180198466A1 · Chiu et al. · 2018 [cited by applicant]
US 20180294822A1 · Shinohara et al. · 2018 [cited by applicant]
US 20180323801A1 · Hsu et al. · 2018 [cited by applicant]
US 20190229751A1 · Kim et al. · 2019 [cited by applicant]
US 20190245654A1 · Richardson et al. · 2019 [cited by applicant]
US 20190288708A1 · Ma et al. · 2019 [cited by applicant]
US 20190393890A1 · Montorsi et al. · 2019 [cited by applicant]
US 20200136752A1 · Kim · 2020 [cited by examiner]
AU 2010313884A1 · 2012 [cited by applicant]
CN 1845482A · 2006 [cited by applicant]
CN 1960188A · 2007 [cited by applicant]
CN 1973440A · 2007 [cited by applicant]
CN 101036301A · 2007 [cited by applicant]
CN 101162907A · 2008 [cited by applicant]
CN 101217337A · 2008 [cited by applicant]
CN 101515839A · 2009 [cited by applicant]
CN 100539442C · 2009 [cited by applicant]
CN 101662290A · 2010 [cited by applicant]
CN 101741396A · 2010 [cited by applicant]
CN 101834613A · 2010 [cited by applicant]
CN 102315911A · 2012 [cited by applicant]
CN 102412842A · 2012 [cited by applicant]
CN 104333390A · 2015 [cited by applicant]
CN 104518847A · 2015 [cited by applicant]
CN 104521147A · 2015 [cited by applicant]
CN 104821831A · 2015 [cited by applicant]
CN 104868925A · 2015 [cited by applicant]
CN 104917536A · 2015 [cited by applicant]
CN 105075128A · 2015 [cited by applicant]
CN 105827251A · 2016 [cited by applicant]
CN 106685586A · 2017 [cited by applicant]
CN 106849958A · 2017 [cited by applicant]
CN 104168030B · 2017 [cited by applicant]
CN 108173621A · 2018 [cited by applicant]
EP 1596501B1 · 2009 [cited by applicant]
JP 2006157926A · 2006 [cited by applicant]
JP 2010517444A · 2010 [cited by applicant]
JP 6820438B2 · 2021 [cited by applicant]
KR 20090087386A · 2009 [cited by applicant]
KR 20150118992A · 2015 [cited by applicant]
RU 2310274C1 · 2007 [cited by applicant]
RU 2443053C2 · 2012 [cited by applicant]
WO 2010022602A1 · 2010 [cited by applicant]
WO 2010057407A1 · 2010 [cited by applicant]
WO 2011029362A1 · 2011 [cited by applicant]
WO 2012037749A1 · 2012 [cited by applicant]
WO 2014127140A1 · 2014 [cited by applicant]
WO 2016126202A1 · 2016 [cited by applicant]
WO 2018082290A1 · 2018 [cited by applicant]
“Further consideration on compact LDPC design for eMBB,” 3GPP TSG RAN WG1 Meeting #88, Athens, Greece, R1-1701600, pp. 1-14, 3rd Generation Partnership Project—Valbonne, France (Feb. 13-17, 2017). [cited by applicant]
Gallager, “Low-Density Parity-Check Codes,” IRE Transactions on Information Theory, vol. 8, No. 1, pp. 21-28, Institute of Electrical and Electronics Engineers—New York, New York (Jan. 1962). [cited by applicant]
“Performance of LDPC design for eMBB,” 3GPP TSG RAN WG1 Meeting #89, Hangzhou, P.R. China, R1-1709189, pp. 1-4, 3rd Generation Partnership Project—Valbonne, France (May 15-19, 2017). [cited by applicant]
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NR; Multiplexing and channel coding (Release 15),” 3GPP TS 38.212 V0.0.0, pp. 1-10, 3rd Generation Partnership Project—Valbonne, F… [cited by applicant]
Joo et al., “LDPC coding for OFDMA PHY,” IEEE 802.16 Broadband Wireless Access Working Group, IEEE C802. 16d-04/86r1, pp. 1-12, Institute of Electrical and Electronics Engineers, New York, New York (May 1, 2004). [cited by applicant]
“Summary of [89-24] Email discussion on LDPC code base graph #1 for NR,” 3GPP TSG RAN WG1 NR Ad-Hoc #2, Qingdao, P.R. China, R1-1711545, pp. 1-4, 3rd Generation Partnership Project, Valbonne, France (Jun. 27-30, 2017). [cited by applicant]
“Summary of [89-25] Email discussion on LDPC code base graph #2 for NR,” 3GPP TSG RAN WG1 NR Ad-Hoc #2, Qingdao, P.R. China, R1-1711546, pp. 1-3, 3rd Generation Partnership Project, Valbonne, France (Jun. 27-30, 2017). [cited by applicant]
Chen, “Elementary Transformation of Matrix and Its Application,” with English Translation, vol. 25, No. 2, pp. 71-74, Journal of Higher Correspondence Education (2012). [cited by applicant]
“WF on LDPC parity check matrices,” 3GPP TSG RAN WG1 NR AH #2, Qingdao, China, R1-1711982, pp. 1-2, 3rd Generation Partnership Project, Valbonne, France (Jun. 27-30, 2017). [cited by applicant]
“LDPC design for eMBB data,” 3GPP TSG RAN WG1 Meeting #89, Hangzhou, China, R1-1706970, pp. 1-11, 3rd Generation Partnership Project, Valbonne, France (May 15-19, 2017). [cited by applicant]
“Performance evaluation of LDPC codes,” 3GPP TSG RAN WG1 Meeting #89, Hangzhou, China, R1-1706971, pp. 1-12, 3rd Generation Partnership Project, Valbonne, France (May 15-19, 2017). [cited by applicant]
“Throughput of LDPC codes,” 3GPP TSG RAN WG1 Meeting #89, Hangzhou, China, R1-1706972, pp. 1-7, 3rd Generation Partnership Project, Valbonne, France (May 15-19, 2017). [cited by applicant]
“Rate matching for LDPC codes,” 3GPP TSG RAN WG1 Meeting #89, Hangzhou, China, pp. 1-4, R1-1706973, 3rd Generation Partnership Project, Valbonne, France (May 15-19, 2017). [cited by applicant]
“WF on Candidate LDPC Base Matrices” with “Simulation results for LDPC codes,” 3GPP TSG RAN WG1 Meeting #89, Hangzhou, China, R1-1709751, pp. 1-33, 3rd Generation Partnership Project, Valbonne, France (May 15-19, 2017). [cited by applicant]
“LDPC design for base graph 1,” 3GPP TSG RAN WG1 Meeting AH#2, Qingdao, P.R. China, R1-1711436, pp. 1-4, 3rd Generation Partnership Project, Valbonne, France (Jun. 27-30, 2017). [cited by applicant]
“LDPC design for base graph 2,” 3GPP TSG RAN WG1 Meeting AH#2, Qingdao, P.R. China, R1-1711437, pp. 1-4, 3rd Generation Partnership Project, Valbonne, France (Jun. 27-30, 2017). [cited by applicant]
“Rate matching for LDPC codes,” 3GPP TSG RAN WG1 NR Ad-Hoc #2, Qingdao, China, R1-1711438, pp. 1-6, 3rd Generation Partnership Project, Valbonne, France (Jun. 27-30, 2017). [cited by applicant]
“LDPC design for base graph 1,” with corrections, 3GPP TSG RAN WG1 Meeting AH#2, Qingdao, P.R. China, R1-1711727, pp. 1-4, 3rd Generation Partnership Project, Valbonne, France (Jun. 27-30, 2017). [cited by applicant]
Huawei: “R1-1711437_PCMs for BG2,” retrived from the internet: https://www.3gpp.org/ftp/tsg_ran/WG1_RL1/TSGR1_AH/NR_AH_1706/Docs/R1-1711437.zip, XP055695142, pp. 1-10, 3rd Generation Partnership Project, Valbonne, Franc… [cited by applicant]
“High Performance LDPC code Features,” 3GPP TSG-RAN WG1 NR, Spokane, Washington, R1-1701470, pp. 1-17, 3rd Generation Partnership Project, Valbonne, France (Jan. 16-20, 2017). [cited by applicant]
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NR; Multiplexing and channel coding (Release 15),” 3GPP TS 38.212 V0.0.1, XP051336737, pp. 1-23, 3rd Generation Partnership Projec… [cited by applicant]
“On design and performance of NR eMBB LDPC Code,” 3GPP TSG-RAN WG1 Meeting#89, Hangzhou, CN, R1-1709856, pp. 1-14, 3rd Generation Partnership Project, Valbonne, France (May 15-19, 2017). [cited by applicant]
“On NR LDPC design and performance,” 3GPP TSG-RAN WG1 Meeting NR#2, Qingdao, CN, R1-1710829, XP051300033, pp. 1-6, 3rd Generation Partnership Project, Valbonne, France (Jun. 27-30, 2017). [cited by applicant]
“LDPC design for eMBB data,” 3GPP TSG RAN WG1 WG1 NR Ad-Hoc#2, Qingdao, P.R. China, R1-1710046, pp. 1-4, 3rd Generation Partnership Project, Valbonne, France (Jun. 27-30, 2017). [cited by applicant]
ZTE: “R1-1710846 Shift coefficient design for BG2,” retrieved from the internet:https://www.3gpp.org/ftp/tsg_ran/wg1_rl1/TSGR1_AH/NR_AH_1706/Docs/R1-1710846.zip, XP055694976, pp. 1-8, 3rd Generation Partnership Project,… [cited by applicant]
“Shift coefficient design for base graph #2,” 3GPP TSG RAN WG1 NR Ad-Hoc#2, Qingdao, P.R. China, R1-1710846, pp. 1-3, 3rd Generation Partnership Project, Valbonne, France (Jun. 27-30, 2017). [cited by applicant]
“LDPC design for eMBB data,” 3GPP TSG RAN WG1 Meeting #88bis, Spokane, USA, R1-1704250, XP051242402, pp. 1-6, 3rd Generation Partnership Project, Valbonne, France (Apr. 3-7, 2017). [cited by applicant]
Weidu Wu et al., “LDPC merged BG2.xlsx,” XP055698448, 3GPP TSG_RAN_WG1 Archives, pp. 1-12, 3rd Generation Partnership Project, Valbonne, France (Jun. 15, 2017). [cited by applicant]
“A multi-codebook embedded compact QC-LDPC design,” 3GPP TSG-RAN WG1 NR, Spokane, USA, R1-1704457, XP051242602, pp. 1-11, 3rd Generation Partnership Project, Valbonne, France (Apr. 3-7, 2017). [cited by applicant]
Keeth Jayasinghe, “Candidates for base matrix 2 final.xlsx,” XP055698522, pp. 1-8 (Jun. 14, 2017). [cited by applicant]
Nokia et al: “LDPC Basegraph 2 / R1-1711546-Summary of [89-25] email discussion,” XP055698232, one page, (Jun. 19, 2017). [cited by applicant]
“Design of LDPC Codes for NR,” 3GPP TSG RAN WG1 Meeting #87, Reno, USA, R1-1611321, pp. 1-11, 3rd Generation Partnership Project, Valbonne, France (Nov. 14-18, 2016). [cited by applicant]
“Length compatibility of LDPC,” 3GPP TSG RAN WG1 Meeting #86bis, Lisbon, Portugal, R1-1609242, pp. 1-4, 3rd Generation Partnership Project, Valbonne, France (Oct. 10-14, 2016). [cited by applicant]
LG Electronics, “LDPC Codes Design for eMBB data channel,” 3GPP TSG RAN WG1 NR ad-hoc, Spokane, USA, R1-1700518, total 6 pages, 3rd Generation Partnership Project, Valbonne, France (Jan. 16-20, 2017). [cited by applicant]
ZTE, “Shift coefficient design for base graph #2,” 3GPP TSG RAN WG1 NR Ad-Hoc#2, Qingdao, P.R. China, R1-1710846, total 3 pages, 3rd Generation Partnership Project, Valbonne, France (Jun. 27-30, 2017). [cited by applicant]
Jayasinghe, Keeth, Re: [89-25] LDPC code base graph #2 for NR. [email protected], Retrieved from https://list.etsi.org/scripts/wa.exe?A2=ind1706B&L=3GPP_TSG_RAN_WG1&P=R1093428&u=75577, total 20 pages (Jun. … [cited by applicant]
Jayasinghe, Keeth, Re: [89-25] LDPC code base graph #2 for NR. [email protected], Jun. 14, 2017, Candidates for base matrix 2_final.xlsx, retrieved from https://list.etsi.org/scripts/wa.exe?A2=ind1706B&L=3G… [cited by applicant]
Ericsson, “Rate Matching for LDPC Codes,” 3GPP TSG RAN WG1 Meeting #87, Reno, USA, R1-1611322, total 6 pages, 3rd Generation Partnership Project, Valbonne, France (Nov. 14-18, 2016). [cited by applicant]
Samsung, “LDPC Code Design for eMBB,” 3GPP TSG RAN WG1 #89, Hangzhou, China, R1-1708046, total 48 pages, 3rd Generation Partnership Project, Valbonne, France (May 15-19, 2017). [cited by applicant]
Mediatek Inc., “On NR LDPC design and performance,” 3GPP TSG-RAN WG1 Meeting NR#2, Qingdao, CN, R1-1710829, total 6 pages, 3rd Generation Partnership Project, Valbonne, France (Jun. 27-30, 2017). [cited by applicant]
LG Electronics, “LDPC Codes Design for eMBB data channel,” 3GPP TSG RAN WG1 #89, Hangzhou, China, R1-1709641, total 6 pages, 3rd Generation Partnership Project, Valbonne, France (May 15-19, 2017). [cited by applicant]
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NR; Physical channels and modulation (Release 15),” 3GPP TS 38.211 V0.0.0, pp. 1-10, 3rd Generation Partnership Project, Valbonne,… [cited by applicant]
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NR; Physical layer measurements (Release 15),” 3GPP TS 38.215 V0.0.0, pp. 1-6, 3rd Generation Partnership Project, Valbonne, Franc… [cited by applicant]
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NR; NR and NG-RAN Overall Description; Stage 2 (Release 15),” 3GPP TS 38.300 V0.4.1, pp. 1-55, 3rd Generation Partnership Project,… [cited by applicant]
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NR; Medium Access Control (MAC) protocol specification (Release 15),” 3GPP TS 38.321 V0.0.3, pp. 1-20, 3rd Generation Partnership … [cited by applicant]
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NR; Radio Resource Control (RRC); Protocol specification (Release 15),” 3GPP TS 38.331 V0.0.3, pp. 1-20, 3rd Generation Partnershi… [cited by applicant]
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NG Radio Access Network (NG-RAN); NG Application Protocol (NGAP) (Release 15),” 3GPP TS 38.413 V0.0.2, pp. 1-39, 3rd Generation Pa… [cited by applicant]
Chen et al., “Construction of Rate Compatible Length Scalable LDPC Codes with Low Implementation Complexity,” 2017 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB), pp. 1-6, Institute… [cited by applicant]