# US 10,484,013 B2 · Shift-coefficient table design of QC-LDPC code for smaller code block sizes in mobile communications

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 10,484,013 B2
- Document ID: US10484013B2
- Status: Granted
- Kind: B2
- Application number: 16/019,947
- Filed: 2018-06-27
- Published: 2018-11-15
- Granted: 2019-11-19
- Earliest claimed: 2017-05-12
- Assignees: Mediatek Inc.
- Applicants: MediaTek Inc.
- Inventors: Chong-You Lee; Timothy Perrin Fisher-Jeffes; Mao-Ching Chiu; Wei-Jen Chen; Ju-Ya Chen
- Web page: https://patentgrep.com/patent/US10484013B2

## CPC

- H03M 13/1168: {wherein the sub-matrices have column and row weights greater than one, e.g. multi-diagonal sub-matrices}
- H03M 13/033: {Theoretical methods to calculate these checking codes}
- H03M 13/036: {Heuristic code construction methods, i.e. code construction or code search based on using trial-and-error}
- H03M 13/116: {Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices}
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- H03M 13/6306: {Error control coding in combination with Automatic Repeat reQuest [ARQ] and diversity transmission, e.g. coding schemes for the multiple transmission of the same information or the transmission of incremental redundancy (H03M13/3761, H03M13/3769 and H03M13/635 take precedence)}
- H03M 13/6362: {by puncturing}
- H03M 13/6508: {Flexibility, adaptability, parametrability and configurability of the implementation}
- H03M 13/6516: {Support of multiple code parameters, e.g. generalized Reed-Solomon decoder for a variety of generator polynomials or Galois fields}
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0068: {by puncturing}
- H04L 1/1819: {with retransmission of additional or different redundancy}
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A processor of an apparatus establishes a wireless communication link with at least one other apparatus via a transceiver of the apparatus. The processor wirelessly communicates with the other apparatus via the wireless communication link by: selecting a first shift-coefficient table from a plurality of shift-coefficient tables; generating a QC-LDPC code using a base matrix and at least a portion of the first shift-coefficient table; selecting a codebook from a plurality of codebooks embedded in the QC-LDPC code; storing the selected codebook in a memory associated with the processor; encoding data using the selected codebook to generate a plurality of modulation symbols of the data; and controlling the transceiver to multiplex, convert, filter, amplify and radiate the modulation symbols as electromagnetic waves through one or more antennas of the apparatus to transmit the modulation symbols of the data to the other apparatus via the wireless communication link.

## Claims

### Claim 1

A method of wireless communication, comprising:
establishing, by a processor of an apparatus, a wireless communication link with at least one other apparatus via a transceiver of the apparatus; and
wirelessly communicating, by the processor, with the other apparatus via the wireless communication link by:
selecting a first shift-coefficient table from a plurality of shift-coefficient tables;
generating a quasi-cyclic-low-density parity-check (QC-LDPC) code using a base matrix and at least a portion of the first shift-coefficient table;
selecting a codebook from a plurality of codebooks embedded in the QC-LDPC code;
storing the selected codebook in a memory associated with the processor;
encoding data using the selected codebook to generate a plurality of modulation symbols of the data; and
controlling the transceiver to multiplex, convert, filter, amplify and radiate the modulation symbols as electromagnetic waves through one or more antennas of the apparatus to transmit the modulation symbols of the data to the other apparatus via the wireless communication link,
wherein the selecting of the first shift-coefficient table from the plurality of shift-coefficient tables comprises selecting the first shift-coefficient table according to one or more rules related to either or both of a code block size and a code rate of the data for relatively smaller code block sizes.

### Claim 2 (depends on 1)

The method of claim 1, wherein the first shift-coefficient table comprises a basic shift-coefficient table arranged in four rows and fourteen columns in a pattern as follows:
Column #
Row #
1
2
3
4
5
6
7
8
9
10
11
12
13
14
1
9
117
204
26
−1
−1
189
−1
−1
205
0
0
−1
−1
2
167
−1
−1
166
253
125
226
156
224
252
−1
0
0
−1
3
81
114
−1
44
52
−1
−1
−1
240
−1
1
−1
0
0
4
−1
8
58
−1
158
104
209
54
18
128
0
−1
−1
0.

### Claim 3 (depends on 1)

The method of claim 1, wherein the first shift-coefficient table comprises a shift-coefficient table as shown in FIG. 15A and FIG. 15B.

### Claim 4 (depends on 1)

The method of claim 1, wherein the first shift-coefficient table comprises a shift-coefficient table corresponding to base graph 2 (BG2) with a primitive element of 2 (a=2) and a lifting factor of 256.

### Claim 5 (depends on 1)

The method of claim 1, wherein the first shift-coefficient table comprises a shift-coefficient table corresponding to base graph 2 (BG2) with a primitive element of 9 (a=9) and a lifting factor of 144.

### Claim 6 (depends on 1)

The method of claim 1, wherein the first shift-coefficient table comprises a shift-coefficient table corresponding to base graph 2 (BG2) with a primitive element of 5 (a=5) and a lifting factor of 160.

### Claim 7 (depends on 1)

The method of claim 1, wherein the first shift-coefficient table comprises a shift-coefficient table corresponding to base graph 2 (BG2) with a primitive element of 11 (a=11) and a lifting factor of 176.

### Claim 8 (depends on 1)

The method of claim 1, wherein the first shift-coefficient table comprises a shift-coefficient table corresponding to base graph 2 (BG2) with a primitive element of 3 (a=3) and a lifting factor of 192.

### Claim 9 (depends on 1)

The method of claim 1, wherein the first shift-coefficient table comprises a shift-coefficient table corresponding to base graph 2 (BG2) with a primitive element of 13 (a=13) and a lifting factor of 208.

### Claim 10 (depends on 1)

The method of claim 1, wherein the first shift-coefficient table comprises a shift-coefficient table corresponding to base graph 2 (BG2) with a primitive element of 7 (a=7) and a lifting factor of 224.

### Claim 11 (depends on 1)

The method of claim 1, wherein the first shift-coefficient table comprises a shift-coefficient table corresponding to base graph 2 (BG2) with a primitive element of 15 (a=15) and a lifting factor of 240.

### Claim 12 (depends on 1)

The method of claim 1, wherein the generating of the QC-LDPC code using the base matrix and at least a portion of the first shift-coefficient table comprises generating the QC-LDPC code using the base matrix and a full portion of the first shift-coefficient table.

### Claim 13 (depends on 1)

The method of claim 1, wherein the generating of the QC-LDPC code using the base matrix and at least a portion of the first shift-coefficient table comprises generating the QC-LDPC code using the base matrix and a partial portion of the first shift-coefficient table.

### Claim 14 (depends on 1)

The method of claim 1, wherein the selecting of the first shift-coefficient table from the plurality of shift-coefficient tables comprises selecting a second shift-coefficient table a value of which modulo one or more lifting factors is same as a modulo result of at least the first shift-coefficient table.

### Claim 15 (depends on 14)

The method of claim 14, wherein the generating of the QC-LDPC code using the base matrix and at least a portion of the first shift-coefficient table comprises generating the QC-LDPC code using the base matrix and a full portion of the second shift-coefficient table.

### Claim 16 (depends on 14)

The method of claim 14, wherein the generating of the QC-LDPC code using the base matrix and at least a portion of the first shift-coefficient table comprises generating the QC-LDPC code using the base matrix and a partial portion of the second shift-coefficient table.

### Claim 17 (depends on 1)

The method of claim 1, wherein the selecting of the first shift-coefficient table from the plurality of shift-coefficient tables comprises:
determining whether the code block size is less than or equal to a threshold code block size; and
determining whether the code rate is less than or equal to a threshold code rate.

### Claim 18 (depends on 17)

The method of claim 17, wherein the selecting of the first shift-coefficient table from the plurality of shift-coefficient tables further comprises:
selecting the first shift-coefficient table which corresponds to base graph 1 (BG1) responsive to a determination that the code block size is greater than the threshold code block size or responsive to a determination that the code rate is greater than the threshold code rate.

### Claim 19 (depends on 17)

The method of claim 17, wherein the selecting of the first shift-coefficient table from the plurality of shift-coefficient tables further comprises:
selecting the first shift-coefficient table which corresponds to base graph 2 (BG2) responsive to a determination that the code block size is less than or equal to the threshold code block size and responsive to a determination that the code rate is less than or equal to the threshold code rate.

### Claim 20 (depends on 1)

The method of claim 1, wherein each codebook of the plurality of codebooks corresponds to a respective hybrid automatic repeat request (HARQ) threads of a plurality of HARQ threads that are different from one another.