# US 11,451,324 B2 · Bit selection for hybrid automatic repeat requests

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

- Number: US 11,451,324 B2
- Document ID: US11451324B2
- Status: Granted
- Kind: B2
- Application number: 17/208,153
- Filed: 2021-03-22
- Published: 2021-07-08
- Granted: 2022-09-20
- Earliest claimed: 2018-09-28
- Assignees: Zte Corporation
- Applicants: ZTE Corporation
- Inventors: Focai Peng; Jun Xu; Jin Xu; Mengzhu Chen; Saijin Xie; Xuan Ma; Cuihong Han
- Web page: https://patentgrep.com/patent/US11451324B2

## CPC

- H03M 13/13: Linear codes
- H04L 1/0013: {Rate matching, e.g. puncturing or repetition of code symbols}
- H04L 1/1812: Hybrid protocols; Hybrid automatic repeat request [HARQ]
- H03M 13/618: {Shortening and extension of codes}
- 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}
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0067: {Rate matching (H04L1/0013 and H04L1/08 take precedence)}
- H04L 1/0068: {by puncturing}
- H04L 1/0069: {Puncturing patterns}
- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- H04L 1/1835: {Buffer management}
- 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

Methods, systems, and devices related to wireless communication are described. A method of wireless communication includes determining respective starting points of data, in accordance with Polar encoding, that are associated with each Redundancy Version (RV) of a plurality of RVs and selecting data for transmission in accordance with at least one of the plurality of RVs.

## Claims

### Claim 1

A method of wireless communication, comprising:
determining, by a station, starting points of a first redundancy version (RV0) and a second redundancy version (RV1) based on a code rate that is associated with Polar encoding; and
transmitting, by the station, data in accordance with the RV0 and the RV1,
wherein a starting point of data for transmission is in accordance with the Polar encoding associated with the RV0 and the RV1, and
wherein the starting point of the RV1 succeeds an ending point of the RV0 or corresponds to a certain code bit of a code output from the Polar encoding,
wherein the starting point of the RV0 corresponds to a first bit of the code output or a (N−E)'th bit of the code output, and
wherein the certain code bit corresponds to the first bit of the code output or depends on at least one of E, N, or K, whereby N is a length of a mother code of the Polar encoding, E is a number of bits after rate matching, and K is a number of information bits encoded into the mother code.

### Claim 2 (depends on 1)

The method of claim 1, wherein the Polar encoding includes performing Shortening of a polar code and wherein the starting point of the RV1 succeeds the ending point of the RV0 or the starting point of the RV0 corresponds to a first bit of the code output from the Polar encoding.

### Claim 3 (depends on 1)

The method of claim 1, wherein the Polar encoding includes performing Puncturing of a polar code, the starting point of the RV1 corresponds to one of a first bit, a (3N/4)'th bit, or a ceil(3E/4)'th bit of the code output from the Polar encoding, and the starting point of the RV0 corresponds to a (N−E)'th bit of the code output from the Polar encoding.

### Claim 4 (depends on 1)

The method of claim 1, wherein the starting point of the RV0 corresponds to the first bit of the code output from the Polar encoding and the starting point of the RV1 corresponds to i) one of a (N/2)'th bit, a floor(N*K/E)'th bit, a ceil(N*K/E)'th bit, a round(N*K/E)'th bit, floor(N*(1−K/E))'th bit, or ceil(N*(1−K/E))'s bit of the code output from the Polar encoding.

### Claim 5 (depends on 1)

The method of claim 1, wherein the starting point of the RV0 corresponds to the first bit of the code output from the Polar encoding and the starting point of the RV1 corresponds to one of a ((E−N) mod N)+1)'th bit or a (N/2)'th bit of the code output from the Polar encoding, wherein E>N.

### Claim 6 (depends on 1)

The method of claim 1, wherein the starting point of the RV0 corresponds to the first bit of the code output from the Polar encoding, and the starting point of the RV1 corresponds to one of a floor(N*K/E)'th bit, a ceil(N*K/E)'th bit, or a round(N*K/E)'th bit of the code output from the Polar encoding.

### Claim 7 (depends on 2)

The method of claim 2, wherein if the code rate (R=K/E) of the Polar encoding is less than a threshold value R0, then the starting point of RV1 corresponds to one of a floor(E*R0)'th bit or a ceil(E*R0)'th bit of the code output from the Polar encoding.

### Claim 8 (depends on 1)

The method of claim 1, wherein if the code rate (R =K/E) of the Polar encoding is less than ½, the starting point of the RV1 corresponds to one of a floor(E/2)'th bit or a ceil(E/2)'th bit of the code output from the Polar encoding, and if the code rate (R=K/E) is greater than or equal to ½, the starting point of the RV1 corresponds to one of a floor(E/4)'th bit or a ceil(E/4)'th bit of the code output from the Polar encoding.

### Claim 9 (depends on 1)

The method of claim 1, wherein if K/N<½, the starting point of the RV1 corresponds to one of a floor(E/2)'th bit or a ceil(E/2)'th bit of the code output from the Polar encoding, and if K/N>=½, the starting point of the RV1 corresponds to one of a floor(E/3)'th bit or a ceil(E/3)'th bit of the code output from the Polar encoding.

### Claim 10 (depends on 1)

The method of claim 1, wherein the Polar encoding encoding includes performing Shortening of a polar code, K information bits or a subset of J information bits selected from a set of K information bits are appended to E code bits.

### Claim 11 (depends on 1)

The method of claim 1, wherein the Polar encoding encoding includes performing Puncturing of a polar code, K information bits or a subset of J information bits selected from a set of K information bits are appended to N code bits.

### Claim 12 (depends on 1)

The method of claim 1, wherein first half and second half of the code output from the Polar encoding are XORed to obtain first data of half the length of the code output from the Polar encoding, wherein the first data and at least a part of the code output are used to at least partially form new data, and wherein the new data is placed in a circular buffer.

### Claim 13 (depends on 1)

The method of claim 1, wherein input information bits and code bits of the code output from the Polar encoding are XORed to obtain additional data having a length equal to the length of the input information bits, wherein the additional data is appended to the code output from the Polar encoding to form new data, and wherein the new data is placed in a circular buffer.

### Claim 14 (depends on 1)

The method of claim 1, wherein the starting of the RV1 is one bit after the ending point of the RV0.

### Claim 15 (depends on 1)

The method of claim 1, wherein if the code rate K/E of the Polar encoding is less than or equal to 7/16, the Polar encoding includes performing Puncturing of a polar code and the starting point of the RV1 is one bit after the ending point of the RV0; and wherein if the code rate K/E is greater than 7/16, the Polar encoding includes performing Shortening of the polar code and the starting point of the RV1 is one bit after the ending point of the RV0.

### Claim 16

A method of wireless communication, comprising:
determining, by a station, starting points of a first redundancy version (RV0) and a second redundancy version (RV1) based on a code rate that is associated with Polar encoding; and
transmitting, by the station, data in accordance with the RV0 and the RV1,
wherein a starting point of data for transmission is in accordance with the Polar encoding associated with the RV0 and the RV1, and
wherein if a target condition related to the code rate is satisfied, the Polar encoding includes performing Puncturing of a polar code and the starting point of the RV1 is either (a) one bit after an ending point of the RV0 or (b) a certain code bit of a code output from the Polar encoding; and wherein if the target condition is not satisfied, the Polar encoding includes performing Shortening of the polar code and the starting point of the RV1 is one bit after the ending point of the RV0,
wherein the starting point of the RV0 corresponds to a first bit of the code output or a (N−E)'th bit of the code output, and
wherein the certain code bit corresponds to the first bit of the code output or depends on at least one of E, N, or K, whereby N is a length of a mother code of the Polar encoding, E is a number of bits after rate matching, and K is a number of information bits encoded into the mother code.

### Claim 17 (depends on 16)

The method of claim 16, wherein the target condition includes at least one of (a) the coding rate K/E of the Polar encoding is less than or equal to a first threshold value or (b) K/N is less than or equal to a second threshold value.

### Claim 18 (depends on 16)

The method of claim 16, wherein the starting point of the RV1 and the ending point of the RV0 correspond to positions in a circular buffer.

### Claim 19

A non-transitory computer readable medium having code stored thereon, the code when executed by a processor, causing the processor to implement a method comprising:
determining starting points of a first redundancy version (RV0) and a second redundancy version (RV1) based on a code rate that is associated with Polar encoding; and
transmitting, by the station, data in accordance with the RV0 and the RV1,
wherein a starting point of data for transmission is in accordance with Polar encoding that is associated with the at least one of the plurality of RVs,
wherein the starting point of the RV1 succeeds an ending point of the RV0 or the starting point of the RV1 corresponds to a certain code bit of a code output from the Polar encoding,
wherein the starting point of the RV0 corresponds to a first bit of the code output or a (N−E)'th bit of the code output, and
wherein the certain code bit corresponds to the first bit of the code output or depends on at least one of E, N, or K, whereby N is a length of a mother code of the Polar encoding, E is a number of bits after rate matching, and K is a number of information bits encoded into the mother code.