# US 2019/0379485 A1 · Self-decodability for low-density parity-check codes

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

- Number: US 2019/0379485 A1
- Document ID: US20190379485A1
- Status: Published application
- Kind: A1
- Application number: 16/412,237
- Filed: 2019-05-14
- Published: 2019-12-12
- Earliest claimed: 2018-06-07
- Assignees: QUALCOMM Incorporated
- Applicants: QUALCOMM Incorporated
- Inventors: Jing JIANG; Gabi SARKIS; Yang YANG; Ying WANG
- Web page: https://patentgrep.com/patent/US20190379485A1

## CPC

- H03M 13/116: {Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices}
- H04L 1/0041: {Arrangements at the transmitter end}
- H03M 13/1105: {Decoding}
- H03M 13/1185: {wherein the parity-check matrix comprises a part with a double-diagonal}
- H03M 13/2707: {Simple row-column interleaver, i.e. pure block interleaving}
- H03M 13/2742: {Irregular interleaver wherein the permutation pattern is not obtained by a computation rule, e.g. interleaver based on random generators}
- 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/6393: {Rate compatible low-density parity check [LDPC] codes}
- H04L 1/0045: {Arrangements at the receiver end}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/1819: {with retransmission of additional or different redundancy}
- H04L 1/0068: {by puncturing}
- 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

A technique for hybrid automatic repeat request (HARD) transmissions using low-density parity-check (LDPC) coding with self-decodable retransmissions is disclosed. Data is encoded using a low-density parity check code to obtain encoded data, where the encoded data includes core data and non-core data. The encoded data is then stored in a buffer for transmission. A plurality of redundancy versions of the encoded data is then transmitted, wherein all redundancy versions of encoded data include core data, and each of the transmitted redundancy versions of the encoded data includes at least a different subset of the core data. The core data may be reordered prior to obtaining at least one of the different subsets of core data. Each of the transmitted redundancy versions of the encoded data includes sufficient core data to permit self-decodability of the transmission at a receiver.

## Claims

### Claim 1

A method for wireless communication at a transmitter, comprising:
encoding data using a low-density parity check code to obtain encoded data, where the encoded data includes core data and non-core data;
storing the encoded data in a buffer for transmission; and
transmitting a plurality of redundancy versions of the encoded data, wherein all redundancy versions of encoded data include core data, and each of the transmitted redundancy versions of the encoded data includes at least a different subset of the core data.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
reordering the core data prior to obtaining at least one of the different subsets of core data.

### Claim 3 (depends on 1)

The method of claim 1, wherein a transmission of a first redundancy version of the encoded data includes all of the core data, while a transmission of a second redundancy version of the encoded data includes fewer than all of the core data.

### Claim 4 (depends on 1)

The method of claim 1, wherein each of the transmitted redundancy versions of the encoded data includes sufficient core data to permit self-decodability of the transmission at a receiver.

### Claim 5 (depends on 1)

The method of claim 1, further comprising:
selecting the plurality of redundancy versions from a set of redundancy versions, where the set of redundancy versions and their transmission order is preconfigured, and wherein each of the set of redundancy versions includes sufficient core data to permit self-decodability.

### Claim 6 (depends on 5)

The method of claim 5, wherein each of the set of redundancy versions has a first starting point for the core data and a second starting point for the non-core data, which are known to an intended receiver.

### Claim 7 (depends on 1)

The method of claim 1, wherein the non-core data includes parity data for forward error correction.

### Claim 8 (depends on 1)

The method of claim 1, wherein the low-density parity check code uses a quasi-cyclic lifting structure, where the quasi-cyclic lifting structure is a sparse bipartite graph having a core part that is more densely populated than a non-core part.

### Claim 9 (depends on 1)

The method of claim 1, wherein transmitting a plurality of redundancy versions of the encoded data includes:
transmitting a first redundancy version of the encoded data, wherein the first redundancy version of the encoded data includes at least a first subset of the core data; and
transmitting a second redundancy version of the encoded data, wherein the second redundancy version of the encoded data includes at least a second subset of the core data different from the first subset of the core data, and where the core data is reordered prior to obtaining the second subset of the core data.

### Claim 10 (depends on 9)

The method of claim 9, wherein the first subset of the core data includes all the core data, and the second subset of the core data includes fewer than all the core data.

### Claim 11 (depends on 9)

The method of claim 9, wherein the second redundancy version of the encoded data (a) includes more non-core data than the first redundancy version of the encoded data, and/or (b) is transmitted upon receipt of an indicator to retransmit the encoded data.

### Claim 12 (depends on 9)

The method of claim 9, wherein the first redundancy version of the encoded data has a higher transmission rate for the data than the second redundancy version of the encoded data.

### Claim 13 (depends on 9)

The method of claim 9, wherein transmitting the plurality of redundancy versions of the encoded data further includes:
transmitting a third redundancy version of the encoded data, wherein the third redundancy version of the encoded data includes at least a third subset of the core data different from the first and second subsets of the core data, and the same reordered core data is used to obtain the second and third subsets of the core data.

### Claim 14 (depends on 1)

The method of claim 1, wherein the buffer is a circular buffer.

### Claim 15

An apparatus, comprising:
an encoder for encoding data using a low-density parity check code to obtain encoded data, where the encoded data includes core data and non-core data;
a buffer for storing the encoded data for transmission;
a transmitter circuit configured for transmitting a plurality of redundancy versions of the encoded data, wherein all redundancy versions of encoded data include core data, and each of the transmitted redundancy versions of the encoded data includes at least a different subset of the core data.

### Claim 16 (depends on 15)

The apparatus of claim 15, wherein the core data is reordered prior to obtaining at least one of the different subsets of the core data.

### Claim 17 (depends on 15)

The apparatus of claim 15, wherein a transmission of a first redundancy version of the encoded data includes all of the core data, while a transmission of a second redundancy version of the encoded data includes only a subset of the core data.

### Claim 18 (depends on 15)

The apparatus of claim 15, wherein transmitting the plurality of redundancy versions of the encoded data includes:
transmitting a first redundancy version of the encoded data, wherein the first redundancy version of the encoded data includes at least a first subset of the core data; and
transmitting a second redundancy version of the encoded data, wherein the second redundancy version of the encoded data includes at least a second subset of the core data different from the first subset of the core data, and where the core data is reordered prior to obtaining the second subset of the core data.

### Claim 19

A method operational at a receiver, comprising:
receiving a plurality of redundancy versions of encoded data, where the encoded data includes core data and non-core data, wherein each of the received redundancy versions of the encoded data includes at least a different subset of the core data;
obtaining the encoded data from one or more of the plurality of redundancy versions of encoded data; and
decoding the encoded data using a low-density parity check code to obtain decoded data.

### Claim 20 (depends on 19)

The method of claim 19, wherein each of the received redundancy versions of the encoded data includes sufficient core data to permit self-decodability of the encoded data.

### Claim 21 (depends on 19)

The method of claim 19, further comprising:
selecting the plurality of redundancy versions from a set of redundancy versions, where the set of redundancy versions and their transmission order is pre-arranged with a transmitter.

### Claim 22 (depends on 21)

The method of claim 21, wherein each of the set of redundancy versions has a first starting point for the core data and a second starting point for the non-core data, which are provided to the receiver.

### Claim 23 (depends on 19)

The method of claim 19, wherein the encoded data is obtained by combining likelihood ratios for the received plurality of redundancy versions of the encoded data.

### Claim 24 (depends on 19)

The method of claim 19, wherein a first redundancy version of the encoded data includes all of the core data, while a second redundancy version of the encoded data includes less than all the core data.

### Claim 25 (depends on 19)

The method of claim 19, wherein the non-core data includes parity data for forward error correction.

### Claim 26 (depends on 19)

The method of claim 19, wherein the low-density parity check code uses a quasi-cyclic lifting structure, where the quasi-cyclic lifting structure is a sparse bipartite graph having a core part that is more densely populated than a non-core part.

### Claim 27 (depends on 19)

The method of claim 19, wherein receiving a plurality of redundancy versions of the encoded data includes:
receiving a first redundancy version of the encoded data, wherein the first redundancy version of the encoded data includes at least a first subset of the core data; and
receiving a second redundancy version of the encoded data, wherein the second redundancy version of the encoded data includes at least a second subset of the core data different from the first subset of the core data, and where the second subset of the core data is based on a reordered version of the core data relative to the first subset of the core data.

### Claim 28 (depends on 27)

The method of claim 27, further comprising:
sending an indicator to retransmit the encoded data prior to receiving the second redundancy version of the encoded data.

### Claim 29 (depends on 19)

The method of claim 19, wherein receiving a plurality of redundancy versions of the encoded data further includes:
receiving a third redundancy version of the encoded data, wherein the third redundancy version of the encoded data includes at least a third subset of the core data different from the first and second subsets of the core data, and the second subset and third subset of the core data is based on the same reordered core data.

### Claim 30

An apparatus, comprising:
a receiver circuit for receiving a plurality of redundancy versions of encoded data, where the encoded data includes core data and non-core data, wherein each of the received redundancy versions of the encoded data includes at least a different subset of the core data;
a data aggregation circuit for obtaining the encoded data from one or more of the plurality of redundancy versions of encoded data; and
a decoding circuit for decoding the encoded data using a low-density parity check code to obtain decoded data.
