# US 9,882,749 B2 · Transmission method, transmitter, reception method, and receiver

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

- Number: US 9,882,749 B2
- Document ID: US9882749B2
- Status: Granted
- Kind: B2
- Application number: 15/484,421
- Filed: 2017-04-11
- Published: 2017-08-03
- Granted: 2018-01-30
- Earliest claimed: 2012-07-27
- Assignees: Sun Patent Trust
- Applicants: Sun Patent Trust
- Inventors: Mihail Petrov
- Web page: https://patentgrep.com/patent/US9882749B2

## CPC

- H04L 27/2649: {Demodulators}
- H03M 13/116: {Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices}
- H03M 13/1165: {QC-LDPC codes as defined for the digital video broadcasting [DVB] specifications, e.g. DVB-Satellite [DVB-S2]}
- H03M 13/1185: {wherein the parity-check matrix comprises a part with a double-diagonal}
- H03M 13/255: {with Low Density Parity Check [LDPC] codes}
- H03M 13/2707: {Simple row-column interleaver, i.e. pure block interleaving}
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- H04L 25/0391: {construction details of matrices}
- H04L 27/2627: {Modulators}
- H04L 27/366: {Arrangements for compensating undesirable properties of the transmission path between the modulator and the demodulator}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- 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

In order to transmit a codeword that is generated based on a quasi-cyclic low-density parity-check coding scheme and consists of N cyclic blocks each consisting of Q bits, a bit permutation is applied to the bits of the codeword, a plurality of constellation blocks each consisting of G×M bits are generated, and a block permutation is applied to the constellation blocks. The bit permutation is adopted for each of N/M sections each consisting M cyclic blocks such that the constellation blocks each consist of G×M bits from M distinct cyclic blocks of the associated section. The block permutation is equivalent to writing the constellation blocks into a matrix with R rows and (Q/(k×G)) columns and reading out the constellation blocks column by column from the matrix, where R is k×(N/M), and k is a positive integer.

## Claims

### Claim 1

A transmission method for transmitting a codeword generated based on a quasi-cyclic low-density parity-check coding scheme including a repeat-accumulate quasi-cyclic low-density parity-check coding scheme, the codeword consisting of N bit groups, the bit groups each consisting of Q bits, the transmission method comprising the steps of:
generating, using a generator, a plurality of constellation blocks from the codeword, each of the plurality of constellation blocks being generated from G×M bits;
applying, using a constellation block interleaver, a constellation block permutation to the constellation blocks; and
transmitting, using a transmission unit, the permuted constellation blocks,
wherein each of the bit groups is allocated to one of N/M sections, each section consisting of M different bit groups,
each of the constellation blocks consists of G bits from each of the M different bit groups, and
the constellation block permutation is equivalent to writing the constellation blocks row by row into a matrix with R rows and (Q/(k×G)) columns and reading out the constellation blocks column by column from the matrix, where R is k×(N/M), and k, N, Q, G, M, and R are positive integers.

### Claim 2

A reception method for receiving a codeword generated based on a quasi-cyclic low-density parity-check coding scheme including a repeat-accumulate quasi-cyclic low-density parity-check coding scheme, the codeword consisting of N bit groups, the bit groups each consisting of Q bits, the codeword undergoing predetermined processing and then being transmitted by a transmitter, the predetermined processing including:
generating a plurality of constellation blocks from the codeword, each of the plurality of constellation blocks being generated from G×M bits; and
permuting the constellation blocks,
wherein each of the bit groups is allocated to one of N/M sections, each section consisting of M different bit groups,
each of the constellation blocks consists of G bits from each of the M different bit groups, and
the permuting of the constellation blocks is equivalent to writing the constellation blocks row by row into a matrix with R rows and (Q/(k×G)) columns and reading out the constellation blocks column by column from the matrix, where R is k×(N/M), and k, N, Q, G, M, and R are positive integers,
the reception method comprising the steps of:
receiving, using a reception unit, a plurality of constellation blocks that have undergone a constellation block permutation on a transmission side, the constellation blocks each consisting of G×M bits;
applying, using a constellation block deinterleaver, an inverse constellation block permutation to the received constellation blocks; and
transforming, using a transformer, the constellation blocks, which have undergone the inverse constellation block permutation, into bits of a codeword;
wherein the inverse constellation block permutation is restoration of an order of the constellation blocks that have been permuted in the constellation block permutation.

### Claim 3

A transmitter for transmitting a codeword generated based on a quasi-cyclic low-density parity-check coding scheme including a repeat-accumulate quasi-cyclic low-density parity-check coding scheme, the codeword consisting of N bit groups, the bit groups each consisting of Q bits, the transmitter comprising:
a generator generating a plurality of constellation blocks from the codeword, each of the plurality of constellation blocks being generated from G×M bits;
a constellation block interleaver applying a constellation block permutation to the constellation blocks; and
a transmission unit transmitting the permuted constellation blocks,
wherein each of the bit groups is allocated to one of N/M sections, each section consisting of M bit groups,
each of the constellation blocks consists of G bits from each of the M different bit groups, and
the constellation block permutation is equivalent to writing the constellation blocks row by row into a matrix with R rows and (Q/(k×G)) columns and reading out the constellation blocks column by column from the matrix, where R is k×(N/M), and k, N, Q, G, M, and R are positive integers.

### Claim 4

A receiver for receiving a codeword generated based on a quasi-cyclic low-density parity-check coding scheme including a repeat-accumulate quasi-cyclic low-density parity-check coding scheme, the codeword consisting of N bit groups, the bit groups each consisting of Q bits, the codeword undergoing predetermined processing and then being transmitted by a transmitter, the predetermined processing including:
generating a plurality of constellation blocks from the codeword, each of the plurality of constellation blocks being generated from G×M bits; and
permuting the constellation blocks,
wherein the codeword is divided into N/M sections each consisting of M quasi-cyclic blocks,
each of the constellation blocks consists of G bits from each of the M different bit groups, and
the permuting of the constellation blocks is equivalent to writing the constellation blocks row by row into a matrix with R rows and (Q/(k×G)) columns and reading out the constellation blocks column by column from the matrix, where R is k×(N/M), and k, N, Q, G, M, and R are positive integers,
the receiver comprising:
a reception unit receiving a plurality of constellation blocks that have undergone a constellation block permutation on a transmission side, the constellation blocks each consisting of G×M bits;
a constellation block deinterleaver applying an inverse constellation block permutation to the received constellation blocks; and
a transformer transforming the constellation blocks, which have undergone the inverse constellation block permutation, into bits of a codeword;
wherein,
the inverse constellation block permutation is restoration of an order of the constellation blocks that have been permuted in the constellation block permutation.