# US 11,121,809 B2 · Channel coding method and apparatus in wireless communications

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

- Number: US 11,121,809 B2
- Document ID: US11121809B2
- Status: Granted
- Kind: B2
- Application number: 16/693,906
- Filed: 2019-11-25
- Published: 2020-03-19
- Granted: 2021-09-14
- Earliest claimed: 2017-08-07
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Lingchen Huang; Shengchen Dai; Chen Xu; Yunfei Qiao; Rong Li
- Web page: https://patentgrep.com/patent/US11121809B2

## CPC

- H04L 1/0058: {Block-coded modulation}
- H03M 13/13: Linear codes
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0061: {Error detection codes}
- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- H03M 13/09: Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- 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)

## Abstract

This application provides a channel encoding method and apparatus in wireless communications. The method includes: performing CRC encoding on A to-be-encoded information bits, to obtain a first bit sequence, where the first bit sequence includes L CRC bits and A information bits; performing a interleaving operation on the first bit sequence, to obtain a second bit sequence, where a first interleaving sequence used for the interleaving operation is obtained based on a system-supported maximum-length interleaving sequence with the length of Kmax+L, and Kmax is a maximum information bit quantity corresponding to the maximum-length interleaving sequence ad a preset rule, and a length of the first interleaving sequence is equal to A+L. Therefore, during distributed CRC encoding, when an information bit quantity is less than the maximum information bit quantity, an interleaving sequence required for completing an interleaving process is obtained based on the system-supported maximum-length interleaving sequence.

## Claims

### Claim 1

A method comprising:
determining encoded information to be decoded;
performing, based on a de-interleaving sequence, channel decoding of the encoded information to obtain a decoded bit sequence, wherein the decoded bit sequence comprises L cyclic redundancy check (CRC) bits and A information bits, wherein the de-interleaving sequence comprises A+L indexes, wherein the A+L indexes are obtained by extracting A+L original indexes that are greater than or equal to Kmax−A from a maximum-length interleaving sequence that comprises Kmax+L indexes, and subtracting Kmax−A from each of the A+L original indexes, and wherein Kmax is a maximum quantity of information bits corresponding to the maximum-length interleaving sequence; and
outputting the decoded bit sequence.

### Claim 2 (depends on 1)

The method according to claim 1, wherein L=24, and a CRC polynomial is 0x1D11A9B.

### Claim 3 (depends on 2)

The method according to claim 2, wherein Kmax=200.

### Claim 4 (depends on 3)

The method according to claim 3, wherein the maximum-length interleaving sequence is:
0, 2, 3, 5, 6, 8, 11, 12, 13, 16, 19, 20, 22, 24, 28, 32, 33, 35, 37, 38, 39, 40, 41, 42, 44, 46, 47, 49, 50, 54, 55, 57, 59, 60, 62, 64, 67, 69, 74, 79, 80, 84, 85, 86, 88, 91, 94, 102, 105, 109, 110, 111, 113, 114, 116, 118, 119, 121, 122, 125, 126, 127, 129, 130, 131, 132, 136, 137, 141, 142, 143, 147, 148, 149, 151, 153, 155, 158, 161, 164, 166, 168, 170, 171, 173, 175, 178, 179, 180, 182, 183, 186, 187, 189, 192, 194, 198, 199, 200, 1, 4, 7, 9, 14, 17, 21, 23, 25, 29, 34, 36, 43, 45, 48, 51, 56, 58, 61, 63, 65, 68, 70, 75, 81, 87, 89, 92, 95, 103, 106, 112, 115, 117, 120, 123, 128, 133, 138, 144, 150, 152, 154, 156, 159, 162, 165, 167, 169, 172, 174, 176, 181, 184, 188, 190, 193, 195, 201, 10, 15, 18, 26, 30, 52, 66, 71, 76, 82, 90, 93, 96, 104, 107, 124, 134, 139, 145, 157, 160, 163, 177, 185, 191, 196, 202, 27, 31, 53, 72, 77, 83, 97, 108, 135, 140, 146, 197, 203, 73, 78, 98, 204, 99, 205, 100, 206, 101, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223; or
199, 198, 194, 192, 189, 187, 186, 183, 182, 180, 179, 178, 175, 173, 171, 170, 168, 166, 164, 161, 158, 155, 153, 151, 149, 148, 147, 143, 142, 141, 137, 136, 132, 131, 130, 129, 127, 126, 125, 122, 121, 119, 118, 116, 114, 113, 111, 110, 109, 105, 102, 94, 91, 88, 86, 85, 84, 80, 79, 74, 69, 67, 64, 62, 60, 59, 57, 55, 54, 50, 49, 47, 46, 44, 42, 41, 40, 39, 38, 37, 35, 33, 32, 28, 24, 22, 20, 19, 16, 13, 12, 11, 8, 6, 5, 3, 2, 0, 200, 195, 193, 190, 188, 184, 181, 176, 174, 172, 169, 167, 165, 162, 159, 156, 154, 152, 150, 144, 138, 133, 128, 123, 120, 117, 115, 112, 106, 103, 95, 92, 89, 87, 81, 75, 70, 68, 65, 63, 61, 58, 56, 51, 48, 45, 43, 36, 34, 29, 25, 23, 21, 17, 14, 9, 7, 4, 1, 201, 196, 191, 185, 177, 163, 160, 157, 145, 139, 134, 124, 107, 104, 96, 93, 90, 82, 76, 71, 66, 52, 30, 26, 18, 15, 10, 202, 197, 146, 140, 135, 108, 97, 83, 77, 72, 53, 31, 27, 203, 98, 78, 73, 204, 99, 205, 100, 206, 101, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223.

### Claim 5 (depends on 1)

The method according to claim 1, wherein the A+L indexes in the de-interleaving sequence are arranged in a same order as an order of the A+L indexes in the maximum-length interleaving sequence.

### Claim 6

An apparatus, comprising:
at least one processor;
a memory coupled to the at least one processor and storing programming instructions for execution by the at least one processor to perform operations comprising:
determining encoded information to be decoded;
performing, based on a de-interleaving sequence, channel decoding of the encoded information to obtain a decoded bit sequence, wherein the decoded bit sequence comprises L cyclic redundancy check (CRC) bits and A information bits, wherein the de-interleaving sequence comprises A+L indexes, wherein the A+L indexes are obtained by extracting A+L original indexes that are greater than or equal to Kmax−A from a maximum-length interleaving sequence that comprises Kmax+L indexes, and subtracting Kmax−A from each of the A+L original indexes, and wherein Kmax is a maximum quantity of information bits corresponding to the maximum-length interleaving sequence; and
outputting the decoded bit sequence.

### Claim 7 (depends on 6)

The apparatus according to claim 6, wherein L=24, and a CRC polynomial is 0x1D11A9B.

### Claim 8 (depends on 7)

The apparatus according to claim 7, wherein Kmax=200.

### Claim 9 (depends on 8)

The apparatus according to claim 8, wherein the maximum-length interleaving sequence is:
0, 2, 3, 5, 6, 8, 11, 12, 13, 16, 19, 20, 22, 24, 28, 32, 33, 35, 37, 38, 39, 40, 41, 42, 44, 46, 47, 49, 50, 54, 55, 57, 59, 60, 62, 64, 67, 69, 74, 79, 80, 84, 85, 86, 88, 91, 94, 102, 105, 109, 110, 111, 113, 114, 116, 118, 119, 121, 122, 125, 126, 127, 129, 130, 131, 132, 136, 137, 141, 142, 143, 147, 148, 149, 151, 153, 155, 158, 161, 164, 166, 168, 170, 171, 173, 175, 178, 179, 180, 182, 183, 186, 187, 189, 192, 194, 198, 199, 200, 1, 4, 7, 9, 14, 17, 21, 23, 25, 29, 34, 36, 43, 45, 48, 51, 56, 58, 61, 63, 65, 68, 70, 75, 81, 87, 89, 92, 95, 103, 106, 112, 115, 117, 120, 123, 128, 133, 138, 144, 150, 152, 154, 156, 159, 162, 165, 167, 169, 172, 174, 176, 181, 184, 188, 190, 193, 195, 201, 10, 15, 18, 26, 30, 52, 66, 71, 76, 82, 90, 93, 96, 104, 107, 124, 134, 139, 145, 157, 160, 163, 177, 185, 191, 196, 202, 27, 31, 53, 72, 77, 83, 97, 108, 135, 140, 146, 197, 203, 73, 78, 98, 204, 99, 205, 100, 206, 101, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223; or
199, 198, 194, 192, 189, 187, 186, 183, 182, 180, 179, 178, 175, 173, 171, 170, 168, 166, 164, 161, 158, 155, 153, 151, 149, 148, 147, 143, 142, 141, 137, 136, 132, 131, 130, 129, 127, 126, 125, 122, 121, 119, 118, 116, 114, 113, 111, 110, 109, 105, 102, 94, 91, 88, 86, 85, 84, 80, 79, 74, 69, 67, 64, 62, 60, 59, 57, 55, 54, 50, 49, 47, 46, 44, 42, 41, 40, 39, 38, 37, 35, 33, 32, 28, 24, 22, 20, 19, 16, 13, 12, 11, 8, 6, 5, 3, 2, 0, 200, 195, 193, 190, 188, 184, 181, 176, 174, 172, 169, 167, 165, 162, 159, 156, 154, 152, 150, 144, 138, 133, 128, 123, 120, 117, 115, 112, 106, 103, 95, 92, 89, 87, 81, 75, 70, 68, 65, 63, 61, 58, 56, 51, 48, 45, 43, 36, 34, 29, 25, 23, 21, 17, 14, 9, 7, 4, 1, 201, 196, 191, 185, 177, 163, 160, 157, 145, 139, 134, 124, 107, 104, 96, 93, 90, 82, 76, 71, 66, 52, 30, 26, 18, 15, 10, 202, 197, 146, 140, 135, 108, 97, 83, 77, 72, 53, 31, 27, 203, 98, 78, 73, 204, 99, 205, 100, 206, 101, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223.

### Claim 10 (depends on 6)

The apparatus according to claim 6, wherein the A+L indexes in the de-interleaving sequence are arranged in a same order as an order of the A+L indexes in the maximum-length interleaving sequence.

### Claim 11

A non-transitory computer-readable storage medium coupled to one or more processors and having instructions stored thereon executable by the one or more processors to:
determine encoded information to be decoded;
perform, based on a de-interleaving sequence, channel decoding of the encoded information to obtain a decoded bit sequence, wherein the decoded bit sequence comprises L cyclic redundancy check (CRC) bits and A information bits, wherein the de-interleaving sequence comprises A+L indexes, wherein the A+L indexes are obtained by extracting A+L original indexes that are greater than or equal to Kmax−A from a maximum-length interleaving sequence that comprises Kmax+L indexes, and subtracting Kmax−A from each of the A+L original indexes, and wherein Kmax is a maximum quantity of information bits corresponding to the maximum-length interleaving sequence; and
output the decoded bit sequence.

### Claim 12 (depends on 11)

The non-transitory computer-readable storage medium according to claim 11, wherein L=24, and a CRC polynomial is 0x1D11A9B.

### Claim 13 (depends on 12)

The non-transitory computer-readable storage medium according to claim 12, wherein Kmax=200.

### Claim 14 (depends on 13)

The non-transitory computer-readable storage medium according to claim 13, wherein the maximum-length interleaving sequence is:
0, 2, 3, 5, 6, 8, 11, 12, 13, 16, 19, 20, 22, 24, 28, 32, 33, 35, 37, 38, 39, 40, 41, 42, 44, 46, 47, 49, 50, 54, 55, 57, 59, 60, 62, 64, 67, 69, 74, 79, 80, 84, 85, 86, 88, 91, 94, 102, 105, 109, 110, 111, 113, 114, 116, 118, 119, 121, 122, 125, 126, 127, 129, 130, 131, 132, 136, 137, 141, 142, 143, 147, 148, 149, 151, 153, 155, 158, 161, 164, 166, 168, 170, 171, 173, 175, 178, 179, 180, 182, 183, 186, 187, 189, 192, 194, 198, 199, 200, 1, 4, 7, 9, 14, 17, 21, 23, 25, 29, 34, 36, 43, 45, 48, 51, 56, 58, 61, 63, 65, 68, 70, 75, 81, 87, 89, 92, 95, 103, 106, 112, 115, 117, 120, 123, 128, 133, 138, 144, 150, 152, 154, 156, 159, 162, 165, 167, 169, 172, 174, 176, 181, 184, 188, 190, 193, 195, 201, 10, 15, 18, 26, 30, 52, 66, 71, 76, 82, 90, 93, 96, 104, 107, 124, 134, 139, 145, 157, 160, 163, 177, 185, 191, 196, 202, 27, 31, 53, 72, 77, 83, 97, 108, 135, 140, 146, 197, 203, 73, 78, 98, 204, 99, 205, 100, 206, 101, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223; or
199, 198, 194, 192, 189, 187, 186, 183, 182, 180, 179, 178, 175, 173, 171, 170, 168, 166, 164, 161, 158, 155, 153, 151, 149, 148, 147, 143, 142, 141, 137, 136, 132, 131, 130, 129, 127, 126, 125, 122, 121, 119, 118, 116, 114, 113, 111, 110, 109, 105, 102, 94, 91, 88, 86, 85, 84, 80, 79, 74, 69, 67, 64, 62, 60, 59, 57, 55, 54, 50, 49, 47, 46, 44, 42, 41, 40, 39, 38, 37, 35, 33, 32, 28, 24, 22, 20, 19, 16, 13, 12, 11, 8, 6, 5, 3, 2, 0, 200, 195, 193, 190, 188, 184, 181, 176, 174, 172, 169, 167, 165, 162, 159, 156, 154, 152, 150, 144, 138, 133, 128, 123, 120, 117, 115, 112, 106, 103, 95, 92, 89, 87, 81, 75, 70, 68, 65, 63, 61, 58, 56, 51, 48, 45, 43, 36, 34, 29, 25, 23, 21, 17, 14, 9, 7, 4, 1, 201, 196, 191, 185, 177, 163, 160, 157, 145, 139, 134, 124, 107, 104, 96, 93, 90, 82, 76, 71, 66, 52, 30, 26, 18, 15, 10, 202, 197, 146, 140, 135, 108, 97, 83, 77, 72, 53, 31, 27, 203, 98, 78, 73, 204, 99, 205, 100, 206, 101, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223.

### Claim 15 (depends on 11)

The non-transitory computer-readable storage medium according to claim 11, wherein the A+L indexes in the de-interleaving sequence are arranged in a same order as an order of the A+L indexes in the maximum-length interleaving sequence.