IP Library › Granted Patent US 12,323,162
Granted Patent B2
US 12,323,162 · App. 18/447,915 · Granted Jun 3, 2025

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

Inventors: Liang Ma (Shanghai, CN); Chen Zheng (Shanghai, CN); Xiaojian Liu (Shenzhen, CN); Yuejun Wei (Shanghai, CN); Xin Zeng (Shenzhen, CN)
Assignee: Huawei Technologies Co., Ltd
H03M13/1148H03M13/616H04L1/0057H04L1/0076
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,323,162
App. No.
18/447,915
Granted
Jun 3, 2025
Kind
B2
Abstract

A low density parity check (LDPC) channel encoding method for use in a wireless communications system includes a communication device encoding an input bit sequence by using a 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 encoding method can be used in various communications systems including the fifth generation (5G) telecommunication systems, and can support various encoding requirements for information bit sequences with different code lengths.

Claims (208)

1. An apparatus, comprising:

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

at least one processor configured to execute the instructions to facilitate performance of the following by the apparatus:

obtaining an input sequence to be encoded; and

performing low density parity check (LDPC) encoding on the input sequence by using a matrix H to obtain an encoded sequence;

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

wherein the base matrix comprises elements in m rows with row index i=0,1,2, . . . (m−1) of a first matrix, wherein the first matrix comprises 46 rows with row index i=0, 1,2, . . . 45 and 68 columns with column index j=0,1,2, . . . 67, and 5≤m≤46; and

wherein the first matrix comprises the following elements (i, j) of row i and column j, i is a row index and j is a column index, each of the elements (i, j) corresponds to a circular permutation matrix of size Z×Z, the circular permutation matrix equals to a matrix obtained by circularly shifting an identity matrix of size Z×Z to the right for P i,j times, wherein P i,j =mod (V i,j ,Z), V i,j is a value corresponding to each of the elements (i, j), each of the elements (i, j) and corresponding V i,j are as follows, and any other element in the first matrix corresponds to an all-zero matrix of size Z×Z:

with respect to row index i=0, for column indexes j=0, 1, 2, 3, 5, 6, 9, 10, 11, 12, 13, 15, 16, 18, 19, 20, 21, 22, 23, V i,j is respectively 211, 198, 188, 186, 219, 4, 29, 144, 116, 216, 115, 233, 144, 95, 216, 73, 261, 1, 0;

with respect to row index i=1, for column indexes j=0, 2, 3, 4, 5, 7, 8, 9, 11, 12, 14, 15, 16, 17, 19, 21, 22, 23, 24, V i,j is respectively 179, 162, 223, 256, 160, 76, 202, 117, 109, 15, 72, 152, 158, 147, 156, 119, 0, 0, 0;

with respect to row index i=2, for column indexes j=0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 17, 18, 19, 20, 24, 25, V i,j is respectively 258, 167, 220, 133, 243, 202, 218, 63, 0, 3, 74, 229, 0, 216, 269, 200, 234, 0, 0;

with respect to row index i=3, for column indexes j=0, 1, 3, 4, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17, 18, 20, 21, 22, 25, V i,j is respectively 187, 145, 166, 108, 82, 132, 197, 41, 162, 57, 36, 115, 242, 165, 0, 113, 108, 1, 0;

with respect to row index i=4, for column indexes j=0, 1, 26, V i,j is respectively 246, 235, 0;

with respect to row index i=5, for column indexes j=0, 1, 3, 12, 16, 21, 22, 27, V i,j is respectively 261, 181, 72, 283, 254, 79, 144, 0;

with respect to row index i=6, for column indexes j=0, 6, 10, 11, 13, 17, 18, 20, 28, V i,j is respectively 80, 144, 169, 90, 59, 177, 151, 108, 0;

with respect to row index i=7, for column indexes j=0, 1, 4, 7, 8, 14, 29, V i,j is respectively 169, 189, 154, 184, 104, 164, 0;

with respect to row index i=8, for column indexes j=0, 1, 3, 12, 16, 19, 21, 22, 24, 30, V i,j is respectively 54, 0, 252, 41, 98, 46, 15, 230, 54, 0;

with respect to row index i=9, for column indexes j=0, 1, 10, 11, 13, 17, 18, 20, 31, V i,j is respectively 162, 159, 93, 134, 45, 132, 76, 209, 0;

with respect to row index i=10, for column indexes j=1, 2, 4, 7, 8, 14, 32, V i,j is respectively 178, 1, 28, 267, 234, 201, 0;

with respect to row index i=11, for column indexes j=0, 1, 12, 16, 21, 22, 23, 33, V i,j is respectively 55, 23, 274, 181, 273, 39, 26, 0;

with respect to row index i=12, for column indexes j=0, 1, 10, 11, 13, 18, 34, V i,j is respectively 225, 162, 244, 151, 238, 243, 0;

with respect to row index i=13, for column indexes j=0, 3, 7, 20, 23, 35, V i,j is respectively 231, 0, 216, 47, 36, 0;

with respect to row index i=14, for column indexes j=0, 12, 15, 16, 17, 21, 36, V i,j is respectively 0, 186, 253, 16, 0, 79, 0;

with respect to row index i=15, for column indexes j=0, 1, 10, 13, 18, 25, 37, V i,j is respectively 170, 0, 183, 108, 68, 64, 0;

with respect to row index i=16, for column indexes j=1, 3, 11, 20, 22, 38, V i,j is respectively 270, 13, 99, 54, 0, 0;

with respect to row index i=17, for column indexes j=0, 14, 16, 17, 21, 39, V i,j is respectively 153, 137, 0, 0, 162, 0;

with respect to row index i=18, for column indexes j=1, 12, 13, 18, 19, 40, V i,j is respectively 161, 151, 0, 241, 144, 0;

with respect to row index i=19, for column indexes j=0, 1, 7, 8, 10, 41, V i,j is respectively 0, 0, 118, 144, 0, 0;

with respect to row index i=20, for column indexes j=0, 3, 9, 11, 22, 42, V i,j is respectively 265, 81, 90, 144, 228, 0;

with respect to row index i=21, for column indexes j=1, 5, 16, 20, 21, 43, V i,j is respectively 64, 46, 266, 9, 18, 0;

with respect to row index i=22, for column indexes j=0, 12, 13, 17, 44, V i,j is respectively 72, 189, 72, 257, 0;

with respect to row index i=23, for column indexes j=1, 2, 10, 18, 45, V i,j is respectively 180, 0, 0, 165, 0;

with respect to row index i=24, for column indexes j=0, 3, 4, 11, 22, 46, V i,j is respectively 236, 199, 0, 266, 0, 0;

with respect to row index i=25, for column indexes j=1, 6, 7, 14, 47, V i,j is respectively 205, 0, 0, 183, 0;

with respect to row index i=26, for column indexes j=0, 2, 4, 15, 48, V i,j is respectively 0, 0, 0, 277, 0;

with respect to row index i=27, for column indexes j=1, 6, 8, 49, V i,j is respectively 45, 36, 72, 0;

with respect to row index i=28, for column indexes j=0, 4, 19, 21, 50, V i,j is respectively 275, 0, 155, 62, 0;

with respect to row index i=29, for column indexes j=1, 14, 18, 25, 51, V i,j is respectively 0, 180, 0, 42, 0;

with respect to row index i=30, for column indexes j=0, 10, 13, 24, 52, V i,j is respectively 0, 90, 252, 173, 0;

with respect to row index i=31, for column indexes j=1, 7, 22, 25, 53, V i,j is respectively 144, 144, 166, 19, 0;

with respect to row index i=32, for column indexes j=0, 12, 14, 24, 54, V i,j is respectively 0, 211, 36, 162, 0;

with respect to row index i=33, for column indexes j=1, 2, 11, 21, 55, V i,j is respectively 0, 0, 76, 18, 0;

with respect to row index i=34, for column indexes j=0, 7, 15, 17, 56, V i,j is respectively 197, 0, 108, 0, 0;

with respect to row index i=35, for column indexes j=1, 6, 12, 22, 57, V i,j is respectively 199, 278, 0, 205, 0;

with respect to row index i=36, for column indexes j=0, 14, 15, 18, 58, V i,j is respectively 216, 16, 0, 0, 0;

with respect to row index i=37, for column indexes j=1, 13, 23, 59, V i,j is respectively 72, 144, 0, 0;

with respect to row index i=38, for column indexes j=0, 9, 10, 12, 60, V i,j is respectively 190, 0, 0, 0, 0;

with respect to row index i=39, for column indexes j=1, 3, 7, 19, 61, V i,j is respectively 153, 0, 165, 117, 0;

with respect to row index i=40, for column indexes j=0, 8, 17, 62, V i,j is respectively 216, 144, 2, 0;

with respect to row index i=41, for column indexes j=1, 3, 9, 18, 63, V i,j is respectively 0, 0, 0, 183, 0;

with respect to row index i=42, for column indexes j=0, 4, 24, 64, V i,j is respectively 27, 0, 35, 0;

with respect to row index i=43, for column indexes j=1, 16, 18, 25, 65, V i,j is respectively 52, 243, 0, 270, 0;

with respect to row index i=44, for column indexes j=0, 7, 9, 22, 66, V i,j is respectively 18, 0, 0, 57, 0; and

with respect to row index i=45, for column indexes j=1, 6, 10, 67, V i,j is respectively 168, 0, 144, 0.

2. The apparatus according to claim 1 , wherein the input sequence comprises K bits and K is equal to 22×Z.

3. The apparatus according to claim 1 , wherein Z is 9, 18, 36, 72, 144, or 288.

4. The apparatus according to claim 1 , wherein the encoded sequence comprises N bits and N is equal to 66×Z.

5. The apparatus according to claim 1 , wherein the base matrix comprises n columns, wherein m and n are integers, and n=m+22.

6. The apparatus according to claim 1 , wherein the base matrix comprises n columns, wherein m and n are integers, and 27≤n≤68.

7. The apparatus according to claim 1 , wherein the input sequence is represented as c={c 0 , c 1 , c 2 , . . . , c K−1 }, the encoded sequence is represented as d={d 0 , d 1 , d 2 , . . . , d x-1 }, the encoded sequence d comprises K 0 bits from the input sequence c and (N−K 0 ) parity bits in a parity sequence, and the parity sequence is represented as w={w 0 , w 1 , w 2 , . . . , w N−K 0 −1 } T , wherein K 0 is an integer greater than 0 and less than or equal to K; and

wherein the matrix H, 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 , w T =[w 0 , w 1 , w 2 , . . . , w N−K 0 −1 ] T , 0 T is a column vector, and values of all elements of 0 T are 0.

8. The apparatus according to claim 7 , wherein K 0 =K−2×Z.

9. The apparatus according to claim 1 , wherein the base matrix comprises p columns corresponding to built-in puncture bits, p is an integer, 0≤p≤2, the p columns are for the LDPC encoding, and system bits in the input sequence corresponding to the LDPC encoding using the p columns corresponding to the built-in puncture bits are not sent.

10. A method, comprising:

obtaining an input sequence to be encoded; and

performing low density parity check (LDPC) encoding on the input sequence by using a matrix H to obtain an encoded sequence;

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

wherein the base matrix comprises elements in m rows with row index i=0,1,2, . . . (m−1) of a first matrix, wherein the first matrix comprises 46 rows with row index i=0, 1,2, . . . 45 and 68 columns with column index j-0,1,2, . . . 67, and 5≤m≤46; and

wherein the first matrix comprises the following elements (i, j) of row i and column j, i is a row index and j is a column index, each of the elements (i, j) corresponds to a circular permutation matrix of size Z×Z, the circular permutation matrix equals to a matrix obtained by circularly shifting an identity matrix of size Z×Z to the right for P i,j times, wherein P i,j =mod (V i,j ,Z), V i,j is a value corresponding to each of the elements (i, j), each of the elements (i, j) and corresponding V i,j are as follows, and any other element in the first matrix corresponds to an all-zero matrix of size Z×Z:

with respect to row index i=0, for column indexes j=0, 1, 2, 3, 5, 6, 9, 10, 11, 12, 13, 15, 16, 18, 19, 20, 21, 22, 23, V i,j is respectively 211, 198, 188, 186, 219, 4, 29, 144, 116, 216, 115, 233, 144, 95, 216, 73, 261, 1, 0;

with respect to row index i=1, for column indexes j=0, 2, 3, 4, 5, 7, 8, 9, 11, 12, 14, 15, 16, 17, 19, 21, 22, 23, 24, V i,j is respectively 179, 162, 223, 256, 160, 76, 202, 117, 109, 15, 72, 152, 158, 147, 156, 119, 0, 0, 0;

with respect to row index i=2, for column indexes j=0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 17, 18, 19, 20, 24, 25, V i,j is respectively 258, 167, 220, 133, 243, 202, 218, 63, 0, 3, 74, 229, 0, 216, 269, 200, 234, 0, 0;

with respect to row index i=3, for column indexes j=0, 1, 3, 4, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17, 18, 20, 21, 22, 25, V i,j is respectively 187, 145, 166, 108, 82, 132, 197, 41, 162, 57, 36, 115, 242, 165, 0, 113, 108, 1, 0;

with respect to row index i=4, for column indexes j=0, 1, 26, V i,j is respectively 246, 235, 0;

with respect to row index i=5, for column indexes j=0, 1, 3, 12, 16, 21, 22, 27, V i,j is respectively 261, 181, 72, 283, 254, 79, 144, 0;

with respect to row index i=6, for column indexes j=0, 6, 10, 11, 13, 17, 18, 20, 28, V i,j is respectively 80, 144, 169, 90, 59, 177, 151, 108, 0;

with respect to row index i=7, for column indexes j=0, 1, 4, 7, 8, 14, 29, V i,j is respectively 169, 189, 154, 184, 104, 164, 0;

with respect to row index i=8, for column indexes j=0, 1, 3, 12, 16, 19, 21, 22, 24, 30, V i,j is respectively 54, 0, 252, 41, 98, 46, 15, 230, 54, 0;

with respect to row index i=9, for column indexes j=0, 1, 10, 11, 13, 17, 18, 20, 31, V i,j is respectively 162, 159, 93, 134, 45, 132, 76, 209, 0;

with respect to row index i=10, for column indexes j=1, 2, 4, 7, 8, 14, 32, V i,j is respectively 178, 1, 28, 267, 234, 201, 0;

with respect to row index i=11, for column indexes j=0, 1, 12, 16, 21, 22, 23, 33, V i,j is respectively 55, 23, 274, 181, 273, 39, 26, 0;

with respect to row index i=12, for column indexes j=0, 1, 10, 11, 13, 18, 34, V i,j is respectively 225, 162, 244, 151, 238, 243, 0;

with respect to row index i=13, for column indexes j=0, 3, 7, 20, 23, 35, V i,j is respectively 231, 0, 216, 47, 36, 0;

with respect to row index i=14, for column indexes j=0, 12, 15, 16, 17, 21, 36, V i,j is respectively 0, 186, 253, 16, 0, 79, 0;

with respect to row index i=15, for column indexes j=0, 1, 10, 13, 18, 25, 37, V i,j is respectively 170, 0, 183, 108, 68, 64, 0;

with respect to row index i=16, for column indexes j=1, 3, 11, 20, 22, 38, V i,j is respectively 270, 13, 99, 54, 0, 0;

with respect to row index i=17, for column indexes j=0, 14, 16, 17, 21, 39, V i,j is respectively 153, 137, 0, 0, 162, 0;

with respect to row index i=18, for column indexes j=1, 12, 13, 18, 19, 40, V i,j is respectively 161, 151, 0, 241, 144, 0;

with respect to row index i=19, for column indexes j=0, 1, 7, 8, 10, 41, V i,j is respectively 0, 0, 118, 144, 0, 0;

with respect to row index i=20, for column indexes j=0, 3, 9, 11, 22, 42, V i,j is respectively 265, 81, 90, 144, 228, 0;

with respect to row index i=21, for column indexes j=1, 5, 16, 20, 21, 43, V i,j is respectively 64, 46, 266, 9, 18, 0;

with respect to row index i=22, for column indexes j=0, 12, 13, 17, 44, V i,j is respectively 72, 189, 72, 257, 0;

with respect to row index i=23, for column indexes j=1, 2, 10, 18, 45, V i,j is respectively 180, 0, 0, 165, 0;

with respect to row index i=24, for column indexes j=0, 3, 4, 11, 22, 46, V i,j is respectively 236, 199, 0, 266, 0, 0;

with respect to row index i=25, for column indexes j=1, 6, 7, 14, 47, V i,j is respectively 205, 0, 0, 183, 0;

with respect to row index i=26, for column indexes j=0, 2, 4, 15, 48, V i,j is respectively 0, 0, 0, 277, 0;

with respect to row index i=27, for column indexes j=1, 6, 8, 49, V i,j is respectively 45, 36, 72, 0;

with respect to row index i=28, for column indexes j=0, 4, 19, 21, 50, V i,j is respectively 275, 0, 155, 62, 0;

with respect to row index i=29, for column indexes j=1, 14, 18, 25, 51, V i,j is respectively 0, 180, 0, 42, 0;

with respect to row index i=30, for column indexes j=0, 10, 13, 24, 52, V i,j is respectively 0, 90, 252, 173, 0;

with respect to row index i=31, for column indexes j=1, 7, 22, 25, 53, V i,j is respectively 144, 144, 166, 19, 0;

with respect to row index i=32, for column indexes j=0, 12, 14, 24, 54, V i,j is respectively 0, 211, 36, 162, 0;

with respect to row index i=33, for column indexes j=1, 2, 11, 21, 55, V i,j is respectively 0, 0, 76, 18, 0;

with respect to row index i=34, for column indexes j=0, 7, 15, 17, 56, V i,j is respectively 197, 0, 108, 0, 0;

with respect to row index i=35, for column indexes j=1, 6, 12, 22, 57, V i,j is respectively 199, 278, 0, 205, 0;

with respect to row index i=36, for column indexes j=0, 14, 15, 18, 58, V i,j is respectively 216, 16, 0, 0, 0;

with respect to row index i=37, for column indexes j=1, 13, 23, 59, V i,j is respectively 72, 144, 0, 0;

with respect to row index i=38, for column indexes j=0, 9, 10, 12, 60, V i,j is respectively 190, 0, 0, 0, 0;

with respect to row index i=39, for column indexes j=1, 3, 7, 19, 61, V i,j is respectively 153, 0, 165, 117, 0;

with respect to row index i=40, for column indexes j=0, 8, 17, 62, V i,j is respectively 216, 144, 2, 0;

with respect to row index i=41, for column indexes j=1, 3, 9, 18, 63, V i,j is respectively 0, 0, 0, 183, 0;

with respect to row index i=42, for column indexes j=0, 4, 24, 64, V i,j is respectively 27, 0, 35, 0;

with respect to row index i=43, for column indexes j=1, 16, 18, 25, 65, V i,j is respectively 52, 243, 0, 270, 0;

with respect to row index i=44, for column indexes j=0, 7, 9, 22, 66, V i,j is respectively 18, 0, 0, 57, 0; and

with respect to row index i=45, for column indexes j=1, 6, 10, 67, V i,j is respectively 168, 0, 144, 0.

11. The method according to claim 10 , wherein the input sequence comprises K bits and K is equal to 22×Z.

12. The method according to claim 10 , wherein Z is 9, 18, 36, 72, 144, or 288.

13. The method according to claim 10 , wherein the encoded sequence comprises N bits and N is equal to 66×Z.

14. The method according to claim 10 , wherein the base matrix comprises n columns, wherein m and n are integers, and 27≤n≤68.

15. The method according to claim 10 , wherein the base matrix comprises p columns corresponding to built-in puncture bits, p is an integer, 0≤p≤2, the p columns are for the LDPC encoding, and system bits in the input sequence corresponding to the LDPC encoding using the p columns corresponding to the built-in puncture bits are not sent.

16. A communication system, comprising:

a first communication device; and

a second communication device;

wherein the first communication device is configured to perform low density parity check (LDPC) encoding on a first sequence to be encoded based on a matrix H to obtain an encoded sequence;

wherein the second communication device is configured to perform LDPC decoding on a second sequence to be decoded based on the matrix H;

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

wherein the base matrix comprises elements in m rows with row index i=0,1,2, . . . (m-1) of a first matrix, wherein the first matrix comprises 46 rows with row index i=0, 1,2, . . . 45 and 68 columns with column index j-0,1,2, . . . 67, and 5≤m≤46; and

wherein the first matrix comprises the following elements (i, j) of row i and column j, i is a row index and j is a column index, each of the elements (i, j) corresponds to a circular permutation matrix of size Z×Z, the circular permutation matrix equals to a matrix obtained by circularly shifting an identity matrix of size Z×Z to the right for P i,j times, wherein P i,j =mod (V i,j , Z), V i,j is a value corresponding to each of the elements (i, j), each of the elements (i, j) and corresponding V i,j are as follows, and any other element in the first matrix corresponds to an all-zero matrix of size Z×Z:

with respect to row index i=0, for column indexes j=0, 1, 2, 3, 5, 6, 9, 10, 11, 12, 13, 15, 16, 18, 19, 20, 21, 22, 23, V i,j is respectively 211, 198, 188, 186, 219, 4, 29, 144, 116, 216, 115, 233, 144, 95, 216, 73, 261, 1, 0;

with respect to row index i=1, for column indexes j=0, 2, 3, 4, 5, 7, 8, 9, 11, 12, 14, 15, 16, 17, 19, 21, 22, 23, 24, V i,j is respectively 179, 162, 223, 256, 160, 76, 202, 117, 109, 15, 72, 152, 158, 147, 156, 119, 0, 0, 0;

with respect to row index i=2, for column indexes j=0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 17, 18, 19, 20, 24, 25, V i,j is respectively 258, 167, 220, 133, 243, 202, 218, 63, 0, 3, 74, 229, 0, 216, 269, 200, 234, 0, 0;

with respect to row index i=3, for column indexes j=0, 1, 3, 4, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17, 18, 20, 21, 22, 25, V i,j is respectively 187, 145, 166, 108, 82, 132, 197, 41, 162, 57, 36, 115, 242, 165, 0, 113, 108, 1, 0;

with respect to row index i=4, for column indexes j=0, 1, 26, V i,j is respectively 246, 235, 0;

with respect to row index i=5, for column indexes j=0, 1, 3, 12, 16, 21, 22, 27, V i,j is respectively 261, 181, 72, 283, 254, 79, 144, 0;

with respect to row index i=6, for column indexes j=0, 6, 10, 11, 13, 17, 18, 20, 28, V i,j is respectively 80, 144, 169, 90, 59, 177, 151, 108, 0;

with respect to row index i=7, for column indexes j=0, 1, 4, 7, 8, 14, 29, V i,j is respectively 169, 189, 154, 184, 104, 164, 0;

with respect to row index i=8, for column indexes j=0, 1, 3, 12, 16, 19, 21, 22, 24, 30, V i,j is respectively 54, 0, 252, 41, 98, 46, 15, 230, 54, 0;

with respect to row index i=9, for column indexes j=0, 1, 10, 11, 13, 17, 18, 20, 31, V i,j is respectively 162, 159, 93, 134, 45, 132, 76, 209, 0;

with respect to row index i=10, for column indexes j=1, 2, 4, 7, 8, 14, 32, V i,j is respectively 178, 1, 28, 267, 234, 201, 0;

with respect to row index i=11, for column indexes j=0, 1, 12, 16, 21, 22, 23, 33, V i,j is respectively 55, 23, 274, 181, 273, 39, 26, 0;

with respect to row index i=12, for column indexes j=0, 1, 10, 11, 13, 18, 34, V i,j is respectively 225, 162, 244, 151, 238, 243, 0;

with respect to row index i=13, for column indexes j=0, 3, 7, 20, 23, 35, V i,j is respectively 231, 0, 216, 47, 36, 0;

with respect to row index i=14, for column indexes j=0, 12, 15, 16, 17, 21, 36, V i,j is respectively 0, 186, 253, 16, 0, 79, 0;

with respect to row index i=15, for column indexes j=0, 1, 10, 13, 18, 25, 37, V i,j is respectively 170, 0, 183, 108, 68, 64, 0;

with respect to row index i=16, for column indexes j=1, 3, 11, 20, 22, 38, V i,j is respectively 270, 13, 99, 54, 0, 0;

with respect to row index i=17, for column indexes j=0, 14, 16, 17, 21, 39, V i,j is respectively 153, 137, 0, 0, 162, 0;

with respect to row index i=18, for column indexes j=1, 12, 13, 18, 19, 40, V i,j is respectively 161, 151, 0, 241, 144, 0;

with respect to row index i=19, for column indexes j=0, 1, 7, 8, 10, 41, V i,j is respectively 0, 0, 118, 144, 0, 0;

with respect to row index i=20, for column indexes j=0, 3, 9, 11, 22, 42, V i,j is respectively 265, 81, 90, 144, 228, 0;

with respect to row index i=21, for column indexes j=1, 5, 16, 20, 21, 43, V i,j is respectively 64, 46, 266, 9, 18, 0;

with respect to row index i=22, for column indexes j=0, 12, 13, 17, 44, V i,j is respectively 72, 189, 72, 257, 0;

with respect to row index i=23, for column indexes j=1, 2, 10, 18, 45, V i,j is respectively 180, 0, 0, 165, 0;

with respect to row index i=24, for column indexes j=0, 3, 4, 11, 22, 46, V i,j is respectively 236, 199, 0, 266, 0, 0;

with respect to row index i=25, for column indexes j=1, 6, 7, 14, 47, V i,j is respectively 205, 0, 0, 183, 0;

with respect to row index i=26, for column indexes j=0, 2, 4, 15, 48, V i,j is respectively 0, 0, 0, 277, 0;

with respect to row index i=27, for column indexes j=1, 6, 8, 49, V i,j is respectively 45, 36, 72, 0;

with respect to row index i=28, for column indexes j=0, 4, 19, 21, 50, V i,j is respectively 275, 0, 155, 62, 0;

with respect to row index i=29, for column indexes j=1, 14, 18, 25, 51, V i,j is respectively 0, 180, 0, 42, 0;

with respect to row index i=30, for column indexes j=0, 10, 13, 24, 52, V i,j is respectively 0, 90, 252, 173, 0;

with respect to row index i=31, for column indexes j=1, 7, 22, 25, 53, V i,j is respectively 144, 144, 166, 19, 0;

with respect to row index i=32, for column indexes j=0, 12, 14, 24, 54, V i,j is respectively 0, 211, 36, 162, 0;

with respect to row index i=33, for column indexes j=1, 2, 11, 21, 55, V i,j is respectively 0, 0, 76, 18, 0;

with respect to row index i=34, for column indexes j=0, 7, 15, 17, 56, V i,j is respectively 197, 0, 108, 0, 0;

with respect to row index i=35, for column indexes j=1, 6, 12, 22, 57, V i,j is respectively 199, 278, 0, 205, 0;

with respect to row index i=36, for column indexes j=0, 14, 15, 18, 58, V i,j is respectively 216, 16, 0, 0, 0;

with respect to row index i=37, for column indexes j=1, 13, 23, 59, V i,j is respectively 72, 144, 0, 0;

with respect to row index i=38, for column indexes j=0, 9, 10, 12, 60, V i,j is respectively 190, 0, 0, 0, 0;

with respect to row index i=39, for column indexes j=1, 3, 7, 19, 61, V i,j is respectively 153, 0, 165, 117, 0;

with respect to row index i=40, for column indexes j=0, 8, 17, 62, V i,j is respectively 216, 144, 2, 0;

with respect to row index i=41, for column indexes j=1, 3, 9, 18, 63, V i,j is respectively 0, 0, 0, 183, 0;

with respect to row index i=42, for column indexes j=0, 4, 24, 64, V i,j is respectively 27, 0, 35, 0;

with respect to row index i=43, for column indexes j=1, 16, 18, 25, 65, V i,j is respectively 52, 243, 0, 270, 0;

with respect to row index i=44, for column indexes j=0, 7, 9, 22, 66, V i,j is respectively 18, 0, 0, 57, 0; and

with respect to row index i=45, for column indexes j=1, 6, 10, 67, V i,j is respectively 168, 0, 144, 0.

17. The communication system according to claim 16 , wherein the first sequence comprises K bits and K is equal to 22×Z.

18. The communication system according to claim 16 , wherein Z is 9, 18, 36, 72, 144, or 288.

19. The communication system according to claim 16 , wherein the encoded sequence comprises N bits and N is equal to 66×Z.

20. The communication system according to claim 16 , wherein the base matrix comprises n columns, wherein m and n are integers, and n=m+22.

21. The communication system according to claim 16 , wherein the base matrix comprises n columns, wherein m and n are integers, and 27≤n≤68.

22. The communication system according to claim 16 , wherein the first sequence comprising K bits is represented as c={c 0 , c 1 , c 2 , . . . , c K−1 }, the encoded sequence comprising N bits is represented as d={d 0 , d 1 , d 2 , . . . , d y-1 }, the encoded sequence d comprises K 0 bits from the first sequence c and (N−K 0 ) parity bits in a parity sequence, and the parity sequence is represented as w={w 0 , w 1 , w 2 , . . . , w N−K 0 −1 }, wherein K 0 =K− 2 ×Z; and

wherein the matrix H, the parity sequence w and the first sequence c meet:

H

×

[

c

T

w

T

]

=

0

T

,

wherein c T =[c 0 , c 1 , c 2 , . . . , c K−1 ] T , w T =[w 0 , w 1 , w 2 , . . . , w N−K 0 −1 ] T , 0 T is a column vector, and values of all elements of 0 T are 0.

23. The communication system according to claim 16 , wherein the base matrix comprises p columns corresponding to built-in puncture bits, p is an integer, 0≤p≤2, the p columns are for the LDPC encoding, and system bits in the input sequence corresponding to the LDPC encoding using the p columns corresponding to the built-in puncture bits are not sent.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 10, 2023
From: MA, LIANG; ZHENG, CHEN; LIU, XIAOJIAN; WEI, YUEJUN; ZENG, XIN
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 064555/0891 →
Priority Claims (2)
CN 201710502600.1 · Jun 27, 2017 · national
CN 201710572348.1 · Jul 13, 2017 · national
Continuity (5)
Continuation 17888198 · Aug 15, 2022
Continuation 17008081 · Aug 31, 2020
Continuation 16525076 · Jul 29, 2019
Continuation PCTCN2018081003 · Mar 29, 2018
Related Publication 20240056100A1 · Feb 15, 2024
References Cited (66)
US 7191378B2 · Eroz et al. · 2007 [cited by applicant]
US 8433984B2 · Khandekar et al. · 2013 [cited by applicant]
US 9306601B2 · Richardson · 2016 [cited by applicant]
US 10432219B2 · Zheng et al. · 2019 [cited by applicant]
US 10784893B2 · Ma · 2020 [cited by examiner]
US 11469776B2 · Ma · 2022 [cited by examiner]
US 11770135B2 · Ma · 2023 [cited by examiner]
US 20120173949A1 · Liu et al. · 2012 [cited by applicant]
US 20140215285A1 · Wu · 2014 [cited by applicant]
US 20140229789A1 · Richardson · 2014 [cited by applicant]
US 20140298132A1 · Wu et al. · 2014 [cited by applicant]
US 20150381025A1 · Goldman et al. · 2015 [cited by applicant]
US 20150381205A1 · Zhang et al. · 2015 [cited by applicant]
US 20160173132A1 · Cho · 2016 [cited by applicant]
US 20160218750A1 · Ma · 2016 [cited by applicant]
US 20160344412A1 · Jeong et al. · 2016 [cited by applicant]
US 20170230058A1 · Xu et al. · 2017 [cited by applicant]
US 20180287737A1 · Kim · 2018 [cited by examiner]
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 20190393890A1 · Montorsi et al. · 2019 [cited by applicant]
CN 1960188A · 2007 [cited by applicant]
CN 101431337A · 2009 [cited by applicant]
CN 101834613A · 2010 [cited by applicant]
CN 103731160A · 2014 [cited by applicant]
CN 104333390A · 2015 [cited by applicant]
CN 104821831A · 2015 [cited by applicant]
CN 104868925A · 2015 [cited by applicant]
CN 106685586A · 2017 [cited by applicant]
CN 106849958A · 2017 [cited by applicant]
CN 108712174B · 2019 [cited by applicant]
JP 2010517444A · 2010 [cited by applicant]
KR 20150118992A · 2015 [cited by applicant]
RU 2461963C2 · 2012 [cited by applicant]
WO 2010022602A1 · 2010 [cited by applicant]
U.S. Appl. No. 17/888,198, filed Aug. 15, 2022. [cited by applicant]
U.S. Appl. No. 17/008,081, filed Aug. 31, 2020. [cited by applicant]
U.S. Appl. No. 16/525,076, filed Jul. 29, 2019. [cited by applicant]
“PCR 45.820 Nb M2M—Uplink Forward Error Correction,” 3GPP TSG GERAN Adhoc #3, Kista, Sweden, GPC150318, pp. 1-26, 3rd Generation Partnership Project, Valbonne, France (Jun. 29-Jul. 2, 2015). [cited by applicant]
Gallager, “Low-Density Parity-Check Codes,” IRE Transactions on Information Theory, pp. 1-8, IRE Professional Group on Information Theory, New York, New York (1962). [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; Radio Resource Control (RRC); Protocol specification (Release 15),” 3GPP TS 38.331 V0.0.4, pp. 1-22, 3rd Generation Partnershi… [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, … [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; Medium Access Control (MAC) protocol specification (Release 15),” 3GPP TS 38.321 V0.0.4, pp. 1-31, 3rd Generation Partnership … [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.1.0, pp. 1-80, 3rd Generation Pa… [cited by applicant]
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NG Radio Access Network (NG-RAN); Xn application protocol (XnAP) (Release 15),” 3GPP TS 38.423 V0.1.1, pp. 1-53, 3rd Generation Pa… [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]
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NR; Physical channels and modulation (Release 15),” 3GPP TS 38.211 V0.0.1, pp. 1-23, 3rd Generation Partnership Project, Valbonne,… [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]
“On NR LDPC design and performance,” 3GPP TSG-RAN WG1 Meeting NR#2, Qingdao, China, R1-1710829, pp. 1-6, 3rd Generation Partnership Project, Valbonne, France (Jun. 27-30, 2017). [cited by applicant]
“LDPC design for base graph 1,” 3GPP TSG RAN WG1 Meeting AH#2, Qingdao, China, R1-1711727, pp. 1-4, 3rd Generation Partnership Project, Valbonne, France (Jun. 27-30, 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 V15.0.1, pp. 1-86, 3rd Generation Partnership Project, Valbonne,… [cited by applicant]
“PCM for BG1_alt1,” XP55705524A, pp. 1-20, 3rd Generation Partnership Project, Valbonne France (Jun. 2017). [cited by applicant]
“Merged LDPC BG1 alternative PCM,” XP055705338, pp. 1-19, 3rd Generation Partnership Project, Valbonne France (Jun. 2017). [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.3.0, pp. 1-48, 3rd Generation Partnership Project,… [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.0, pp. 1-39, 3rd Generation Pa… [cited by applicant]
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NG Radio Access Network (NG-RAN); Xn application protocol (XnAP) (Release 15),” 3GPP TS 38.423 V0.1.0, pp. 1-56, 3rd Generation Pa… [cited by applicant]
“On NR LDPC design and performance,” 3GPP TSG-RAN WG1 Meeting NR#2, Qingdao, CN, R1-1711696, total 11 pages, 3rd Generation Partnership Project, Valbonne, France (Jun. 27-30, 2017). [cited by applicant]
“LDPC design for eMBB,” 3GPP TSG RAN WG1 #88bis Meeting, Spokane, WA, USA, R1-1705857, total 6 pages, 3rd Generation Partnership Project, Valbonne, France (Apr. 3-7, 2017). [cited by applicant]
“LDPC design for eMBB data,” 3GPP TSG RAN WG1 Meeting #88bis, Spokane, USA, R1-1704250, total 6 pages, 3rd Generation Partnership Project, Valbonne, France (Apr. 3-7, 2017). [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]
“On design and performance of NR eMBB LDPC Code,” 3GPP TSG-RAN WG1 Meeting #89, Hangzhou, CN, R1-1709150, Total 14 pages, 3rd Generation Partnership Project, Valbonne, France (May 15-19, 2017). [cited by applicant]
Samsung, “LDPC Code for BG1,” 3GPP TSG RAN WG1 NR#2, Qingdao, China, R1-1710744, Total 3 pages, 3rd Generation Partnership Project, Valbonne, France (Jun. 27-30, 2017). [cited by applicant]
ZTE et al., “Comparison of structured LDPC Codes and 3GPP Turbo codes,” 3GPP TSG RAN WG1 #43, Seoul, Korea R1-051360, Total 30 pages, 3rd Generation Partnership Project (Nov. 7-11, 2005). [cited by applicant]