# US 10,320,422 B2 · Channel coding method and device

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

- Number: US 10,320,422 B2
- Document ID: US10320422B2
- Status: Granted
- Kind: B2
- Application number: 14/947,653
- Filed: 2015-11-20
- Published: 2016-03-17
- Granted: 2019-06-11
- Earliest claimed: 2013-05-31
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Hui Shen; Bin Li
- Web page: https://patentgrep.com/patent/US10320422B2

## CPC

- H03M 13/2792: {Interleaver wherein interleaving is performed jointly with another technique such as puncturing, multiplexing or routing}
- H03M 13/09: Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
- H03M 13/13: Linear codes
- H03M 13/27: using interleaving techniques
- H03M 13/2906: {using block codes (H03M13/2957 takes precedence)}
- 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/0065: {Serial concatenated codes}
- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- 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

The present invention provides a coding method and a coding device. The coding method includes: coding information bits a to be coded via cyclic redundancy check CRC, then inputting the bits coded via the CRC into an interleaver determined by a construction parameter of a Polar code, where the interleaver is configured to interleave the bits coded via the CRC and output interleaved bits; and coding the output interleaved bits via the Polar code to obtain a coded Polar code. The above method is used to solve a problem in the prior art that minimum code distance of a Polar code is not large enough when the Polar code is relatively short or is of a medium length.

## Claims

### Claim 1

A method for transmitting data by a communication device, comprising:
obtaining, by the communication device, K1 bits, wherein K1 is a integer greater or equal to 1;
performing, by the communication device, cyclic redundancy check (CRC) coding on the K1 bits to obtain K CRC-coded bits, wherein K is a integer greater or equal to K1;
interleaving, by the communication device, the K CRC-coded bits based on an interleaver in relation to a bit length of a polar coding process to obtain K interleaved bits; and
performing, by the communication device, polar coding on the K interleaved bits according to the polar coding process of x1N=u1NGN, wherein x1N is an N-bit encoded sequence output by the polar coding process, u1N is an N bits obtained from the K interleaved bits, the bit length is the length of the K interleaved bits and equal to K, GN is a Polar code generating matrix of N rows×N columns, the jth row of the N×N matrix corresponds to the jth bit of u1N, j=1, 2, . . . , N;
transmitting, by the communication device, the encoded sequence x1N.

### Claim 2 (depends on 1)

The method according to claim 1, wherein K=K1+L, and L is a quantity of cyclic redundancy check bits, and L=24.

### Claim 3 (depends on 1)

The method according to claim 1, wherein the K CRC-coded bits are interleaved based on u[A(i)]=b[i] to obtain an output u[A(i)] from an input b[i], wherein A is a set of interleaved bit indexes, A(i) is an index of an ith interleaved bit, wherein i=1, . . . , K.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the interleaver is in relation to indexes of bits input into the polar coding process.

### Claim 5

A communication device, comprising:
a cyclic redundancy check (CRC) encoder;
an interleaver coupled to the CRC encoder;
a polar code encoder coupled to the interleaver; and
a transmitter coupled to the polar code encoder; wherein:
the CRC encoder is configured to obtain K1 bits and perform CRC coding on the K1 bits to obtain K CRC-coded bits, wherein K1 is a integer greater or equal to 1, wherein K is a integer greater or equal to K1;
the interleaver is configured to interleave the K CRC-coded bits to obtain K interleaved bits, and the interleaver is in relation to a bit length of a polar coding process; and
the polar code encoder is configured to perform polar coding on the K interleaved bits according to a polar coding process of x1N=u1NGN, wherein x1N is an N-bit encoded sequence output by the polar coding process, u1N is an N bits obtained from the K interleaved bits, the bit length is the length of the K interleaved bits and equal to K, GN is a Polar code generating matrix of N rows×N columns, the jth row of the N×N matrix corresponds to the jth bit of u1N, j=1, 2, . . . , N; and
the transmitter is configured to transmit the encoded sequence x1N.

### Claim 6 (depends on 5)

The device according to claim 5, wherein K equals to the bit length and K=K1+L, and L is a quantity of cyclic redundancy check bits, and L=24.

### Claim 7 (depends on 5)

The method according to claim 5, wherein the K CRC-coded bits are interleaved based on u[A(i)]=b[i] to obtain an output u[A(i)] from an input b[i], wherein A is a set of interleaved bit indexes, A(i) is an index of an ith interleaved bit, wherein i=1, . . . , K.

### Claim 8 (depends on 5)

The method according to claim 5, wherein the interleaver is in relation to indexes of bits input into the polar coding process.