# US 11,444,639 B2 · Method and system for polar code coding

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

- Number: US 11,444,639 B2
- Document ID: US11444639B2
- Status: Granted
- Kind: B2
- Application number: 16/830,968
- Filed: 2020-03-26
- Published: 2020-08-06
- Granted: 2022-09-13
- Earliest claimed: 2017-09-29
- Assignees: Zte Corporation
- Applicants: Zte Corporation
- Inventors: Mengzhu Chen; Jin Xu; Jun Xu
- Web page: https://patentgrep.com/patent/US11444639B2

## CPC

- H03M 13/13: Linear codes
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- 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

A system and method for polar code coding with information bits placed in particular bit indexes are disclosed herein. In one embodiment, a method for channel coding includes: associating, by a polar code encoder, a first bit sequence with first bit indexes of a polar code input; associating, by the polar code encoder, a second bit sequence with second bit indexes, wherein the first bit indexes have a higher reliability than the second bit indexes; and encoding, by the polar code encoder, both the first bit sequence and the second bit sequence using a generator matrix to generate encoded bits.

## Claims

### Claim 1

A method for channel coding, comprising:
obtaining information bits to be encoded, wherein the information bits comprise a first bit sequence and a second bit sequence, wherein the first bit sequence requires a lower bit error ratio than the second bit sequence;
associating, by a polar code encoder, the first bit sequence of the information bits with first bit indexes of a polar code input;
associating, by the polar code encoder, the second bit sequence of the information bits with second bit indexes of the polar code input, wherein the first bit indexes have a higher reliability than the second bit indexes; and
encoding, by the polar code encoder, both the first bit sequence and the second bit sequence using a generator matrix to generate encoded bits.

### Claim 2 (depends on 1)

The method of claim 1, wherein the first bit indexes have a lower bit error ratio than the second bit indexes.

### Claim 3 (depends on 1)

The method of claim 1, wherein the first bit sequence is associated with control information.

### Claim 4 (depends on 1)

The method of claim 1, wherein the first bit sequence is associated with at least one of: a rank indicator, a channel state information reference signal resource index, a precoding type indicator, an acknowledgement, and a negative-acknowledgement.

### Claim 5 (depends on 1)

The method of claim 1, wherein:
a bit index set comprises the first bit indexes and the second bit indexes, and
the first bit indexes comprise initial indexes of the bit index set.

### Claim 6 (depends on 1)

The method of claim 1, wherein:
a bit index set comprises the first bit indexes and the second bit indexes, and
the first bit indexes comprise final indexes of the bit index set.

### Claim 7 (depends on 1)

The method of claim 1, wherein:
a bit index set comprises the first bit indexes and the second bit indexes, and
the first bit indexes are determined by analyzing the bit index set using at least one of the following techniques: density evolution, Gaussian approximation, polarization weight, row weight, column weight and predefined reliability values.

### Claim 8 (depends on 1)

The method of claim 1, wherein:
a bit index set comprises the first bit indexes and the second bit indexes, and
the first bit indexes are defined irrespective of a size of the bit index set.

### Claim 9

A method for channel coding, comprising:
receiving, by a polar code decoder, encoded information bits comprising a first bit sequence and a second bit sequence, wherein:
the first bit sequence requires a lower bit error ratio than the second bit sequence,
the first bit sequence is associated with first bit indexes of a polar code,
the second bit sequence is associated with second bit indexes of the polar code,
the first bit indexes have a higher reliability than the second bit indexes, and
the first bit sequence and the second bit sequence are encoded based on the polar code using a generator matrix; and
decoding, by the polar code decoder, the encoded information bits based on the polar code.

### Claim 10 (depends on 9)

The method of claim 9, wherein the first bit indexes have a lower bit error ratio than the second bit indexes.

### Claim 11 (depends on 9)

The method of claim 9, wherein the first bit sequence is associated with control information.

### Claim 12 (depends on 9)

The method of claim 9, wherein the first bit sequence is associated with at least one of: a rank indicator, a channel state information reference signal resource index, a precoding type indicator, an acknowledgement, and a negative-acknowledgement.

### Claim 13 (depends on 9)

The method of claim 9, wherein:
a bit index set comprises the first bit indexes and the second bit indexes, and
the first bit indexes comprise initial indexes of the bit index set.

### Claim 14 (depends on 9)

The method of claim 9, wherein:
a bit index set comprises the first bit indexes and the second bit indexes, and
the first bit indexes comprise final indexes of the bit index set.

### Claim 15 (depends on 9)

The method of claim 9, wherein:
a bit index set comprises the first bit indexes and the second bit indexes, and
the first bit indexes are determined by analyzing the bit index set using at least one of the following techniques: density evolution, Gaussian approximation, polarization weight, row weight, column weight and predefined reliability values.

### Claim 16 (depends on 9)

The method of claim 9, wherein:
a bit index set comprises the first bit indexes and the second bit indexes, and
the first bit indexes are defined irrespective of a size of the bit index set.