# US 2019/0319749 A1 · Systems and methods for harq retransmission using an outer code

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

- Number: US 2019/0319749 A1
- Document ID: US20190319749A1
- Status: Published application
- Kind: A1
- Application number: 16/377,704
- Filed: 2019-04-08
- Published: 2019-10-17
- Earliest claimed: 2018-04-13
- Assignees: Huawei Technologies Co., Ltd.
- Inventors: YU CAO; MING JIA
- Web page: https://patentgrep.com/patent/US20190319749A1

## CPC

- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/1812: Hybrid protocols; Hybrid automatic repeat request [HARQ]
- H04L 1/005: {Iterative decoding, including iteration between signal detection and decoding operation}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0063: {Single parity check}
- H04L 1/0064: {Concatenated codes}
- H04L 1/1819: {with retransmission of additional or different redundancy}
- H04L 1/1864: {ARQ related signaling (H04L1/1607 takes precedence)}
- H04L 1/189: {Transmission or retransmission of more than one copy of a message}
- H04L 1/0061: {Error detection codes}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Systems and methods disclosed herein provide an outer code for HARQ applications, which may be an erasure code. In some embodiments, the outer code has a relatively simple decoding algorithm, increased decoding probability with no extra redundancy packets needed and can correct an arbitrary number of code blocks. In some embodiments, the outer code may be implemented as part of the 5G air interface, also known as new radio (NR), and/or in applications such as vehicle-to-everything (V2X) and/or ultra-reliable low latency communication (URLLC). Some embodiments provide a nested HARQ protocol for HARQ transmission with an outer code.

## Claims

### Claim 1

A method performed by a network device, the method comprising:
encoding each information block of m information blocks to obtain a respective encoded code block;
transmitting the m encoded code blocks;
computing N parity blocks from the m information blocks by, for each one of the N parity blocks, performing an XOR operation on all of the m information blocks or cyclic shifts thereof, wherein 1<N≤m;
encoding each parity block of the N parity blocks to obtain N encoded parity code blocks; and
transmitting the N encoded parity code blocks.

### Claim 2 (depends on 1)

The method of claim 1, wherein after transmitting the m encoded code blocks, the method further comprises: receiving a feedback message indicating a quantity N of failed code blocks, without identifying which ones of the m encoded code blocks were unsuccessfully decoded.

### Claim 3 (depends on 2)

The method of claim 2, wherein computing the N parity blocks comprises:
for each parity block, computing an XOR of m words, wherein each one of the m words is either equal to or a cyclic shift of a respective different one of the m information blocks.

### Claim 4 (depends on 3)

The method of claim 3, wherein the cyclic shift applied to an information block Ci to compute a parity block Pj is different from the cyclic shift applied to that information block Ci to compute each other parity block Ph≠j.

### Claim 5 (depends on 3)

The method of claim 3, wherein for each parity block Pj, 1≤j≤N: the cyclic shift applied to each information block Ci, 1≤i≤m to compute parity block Pj is a function of j and i.

### Claim 6 (depends on 5)

The method of claim 5, wherein for each parity block Pj, 1≤j≤N: the cyclic shift applied to each information block Ci, 1≤i≤m to compute parity block Pj is based on a function of j multiplied by a function of i.

### Claim 7 (depends on 1)

The method of claim 1, wherein the method further comprises:
computing N1≤N new parity blocks from the N parity blocks by, for each one of the N1 new parity blocks, performing an XOR operation on all of the N parity blocks or cyclic shifts thereof;
encoding each one of the new parity blocks to obtain N1 new encoded parity code blocks; and
transmitting the N1 new encoded parity code blocks.

### Claim 8 (depends on 7)

The method of claim 7, wherein after transmitting the N encoded parity code blocks, the method further comprises: receiving a feedback message indicating a quantity N1 of failed parity blocks, without identifying which ones of the parity blocks were unsuccessfully decoded.

### Claim 9 (depends on 1)

The method of claim 1, wherein each code block is a transport block.

### Claim 10

A network device comprising:
a transmitter and an encoder;
the encoder to: receive bits partitioned into m information blocks, and encode each information block of the m information blocks to obtain a respective encoded code block;
the transmitter to transmit the m encoded code blocks;
the encoder further to compute N parity blocks from the m information blocks by, for each one of the N parity blocks, performing an XOR operation on all of the m information blocks or cyclic shifts thereof, wherein 1<N≤m;
the encoder further to encode each parity block of the N parity blocks to obtain N encoded parity code blocks; and
the transmitter further to transmit the N encoded parity code blocks.

### Claim 11 (depends on 10)

The network device of claim 10, further comprising a receiver, and wherein upon unsuccessful decoding of N encoded code blocks the receiver is to receive a feedback message indicating a quantity N of failed code blocks, and wherein the feedback message does not identify which ones of the m encoded code blocks were unsuccessfully decoded.

### Claim 12 (depends on 11)

The network device of claim 11, wherein the encoder is to compute the N parity blocks by performing operations comprising: for each parity block, computing an XOR of m words, wherein each one of the m words is either equal to or a cyclic shift of a respective different one of the m information blocks.

### Claim 13 (depends on 12)

The network device of claim 12, wherein the cyclic shift to be applied to an information block Ci to compute a parity block Pj is different from the cyclic shift to be applied to that information block Ci to compute each other parity block Ph≠j.

### Claim 14 (depends on 12)

The network device of claim 12, wherein for each parity block Pj, 1≤j≤N: the cyclic shift to be applied to each information block Ci, 1≤i≤m to compute parity block Pj is a function of j and i.

### Claim 15 (depends on 14)

The network device of claim 14, wherein for each parity block Pj, 1≤j≤N: the cyclic shift to be applied to each information block Ci, 1≤i≤m to compute parity block Pj is based on a function of j multiplied by a function of i.

### Claim 16 (depends on 10)

The network device of claim 10, wherein the encoder is further to: (i) compute N1≤N new parity blocks from the N parity blocks by, for each one of the N1 new parity blocks, performing an XOR operation on all of the N parity blocks or cyclic shifts thereof; and (ii) encode each one of the new parity blocks to obtain N1 new encoded parity code blocks; and wherein the transmitter is further to transmit the N1 new encoded parity code blocks.

### Claim 17 (depends on 16)

The network device of claim 16, wherein after the N encoded parity code blocks have been transmitted, and upon N1 failed parity blocks, the receiver is to receive a feedback message indicating a quantity N1 of failed parity blocks, wherein the feedback message does not identify which ones of the parity blocks were unsuccessfully decoded.

### Claim 18 (depends on 10)

The network device of claim 10, wherein each code block is a transport block.

### Claim 19

A method performed by a network device, the method comprising:
receiving m encoded code blocks, each one of the m encoded code blocks corresponding to a respective information block that has been encoded;
decoding the m encoded code blocks;
in response to decoding failing for N≤m of the encoded code blocks:
transmitting feedback indicating a quantity N of failed code blocks, without identifying which ones of the m code blocks were incorrectly decoded;
receiving N encoded parity blocks;
decoding the N encoded parity blocks to obtain N parity blocks;
decoding the N incorrectly decoded information blocks using the N parity blocks.

### Claim 20 (depends on 19)

The method of claim 19, wherein decoding the N incorrectly decoded information blocks using the N parity blocks comprises:
for each one of the N parity blocks: XORing the parity block with each correctly decoded information block or with a cyclic shifted version of the correctly decoded information block.

### Claim 21 (depends on 20)

The method of claim 20, wherein decoding the N incorrectly decoded information blocks using the N parity blocks comprises: recursively calling a decoding function, wherein in each of a plurality of recursions of the decoding function, pairs of input parity blocks are cyclic shifted and XOR'd together.

### Claim 22

A network device comprising:
a transmitter, a receiver, and a decoder;
the receiver to receive m encoded blocks, each one of the m encoded blocks corresponding to a respective information block that has been encoded;
the decoder to decode the m encoded blocks;
in response to decoding failing for N≤m of the encoded blocks:
the transmitter to transmit feedback indicating N information blocks have been incorrectly decoded;
the receiver to receive N encoded parity blocks;
the decoder to decode the N encoded parity blocks to obtain N parity blocks;
the decoder further to decode the N incorrectly decoded information blocks using the N parity blocks.

### Claim 23 (depends on 22)

The network device of claim 22, wherein the decoder is to decode the N incorrectly decoded information blocks by performing operations comprising for each one of the N parity blocks:
XORing the parity block with each correctly decoded information block or with a cyclic shifted version of the correctly decoded information block.

### Claim 24 (depends on 23)

The network device of claim 23, wherein the decoder is to decode the N incorrectly decoded information blocks by further performing operations comprising: recursively calling a decoding function, wherein in each of a plurality of recursions of the decoding function, pairs of input parity blocks are cyclic shifted and XOR'd together.
