# US 2018/0323800 A1 · Reception apparatus and associated method of receiving encoded data

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

- Number: US 2018/0323800 A1
- Document ID: US20180323800A1
- Status: Published application
- Kind: A1
- Application number: 16/019,387
- Filed: 2018-06-26
- Published: 2018-11-08
- Earliest claimed: 2008-04-09
- Assignees: Panasonic Corporation
- Applicants: Panasonic Corporation
- Inventors: Yutaka Murakami; Shutai Okamura; Masayuki Orihashi; Takaaki Kishigami; Shozo Okasaka
- Web page: https://patentgrep.com/patent/US20180323800A1

## CPC

- H03M 13/1154: {Low-density parity-check convolutional codes [LDPC-CC]}
- 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/13: Linear codes
- H03M 13/235: {Encoding of convolutional codes, e.g. methods or arrangements for parallel or block-wise encoding}
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- H03M 13/617: {Polynomial operations, e.g. operations related to generator polynomials or parity-check polynomials}
- 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/635: {Error control coding in combination with rate matching}
- H03M 13/6356: {by repetition or insertion of dummy data, i.e. rate reduction}
- H03M 13/6516: {Support of multiple code parameters, e.g. generalized Reed-Solomon decoder for a variety of generator polynomials or Galois fields}
- H03M 13/6527: {IEEE 802.11 [WLAN]}
- H04B 3/542: {the information being in digital form}
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0058: {Block-coded modulation}
- 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)
- H04B: TRANSMISSION
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A transmission apparatus includes an encoder that codes a data sequence with a parity check matrix, wherein the data sequence includes a final information bit sequence and virtual information bits, and outputs the final information bit sequence and a parity sequence, as LDPC codes, and a transmitter that transmits the LDPC codes as a transmission data. A column length of the parity check matrix is longer than a total length of the final information bit sequence and the parity sequence, by a length of the virtual information bits that are set to “0” and are not transmitted. The total length of the final information bit sequence and the parity sequence has a sequence length corresponding to a length from a first column to a determined column of the parity check matrix. The encoder generates the LDPC codes by using the first column to the determined column among one or more column(s) of the parity check matrix.

## Claims

### Claim 1

A reception apparatus comprising:
a receiver, which, in operation, receives low-density parity-check (LDPC) encoded data which is encoded by a transmission apparatus and transmitted through a power line communication; and
a decoder, which, in operation, decodes the LDPC encoded data based on a parity check matrix in which “n” number of (where n is an integer equal to or greater than 1) parity check equation groups including a plurality of parity check polynomials are arranged, wherein each of the plurality of parity check polynomials satisfies zero, wherein
the LDPC encoded data includes a parity sequence and an information sequence, the parity sequence comprises low-density parity-check (LDPC) encoded data which is generated by LDPC-encoding the information sequence using the parity check matrix, and the parity sequence is generated by using a first column to a determined column of the parity check matrix for the information sequence having a sequence length that corresponds to a length from the first column to the determined column among one or more column(s) of the parity check matrix, wherein the determined column varies depending on a coding rate; and
the parity check equation groups support coding rates of (r−1)/r (where r equals to or more than 2 and equals to or less than q, where q is a natural number equal to or more than 3), support a time varying period of g (where g is an integer equal to or more 2), and are arranged repeatedly at every gth row of the parity check matrix, the parity check polynomial being represented as:
AX1,k(D)X1(D)+AX2,k(D)X2(D)+Λ+AXq−1,k(D)Xq−1(D)+Bk(D)P(D)=0(k=i mod g) (Equation 1)
where, in Equation 1, X1(D), X2(D), Xq−1(D) are polynomial representations of data X1, X2, . . . , Xq−1 respectively, P(D) is a polynomial representation of parity P, AXr,k(D) is a term of Xr(D) in the parity check polynomial for “k=i mod g” at time i where the coding rate is (r−1)/r, Bk(D) is a term of P(D) in the parity check polynomial for “k=i mod g” at time i, where “i mod g” is a remainder after dividing i by g, and the highest order of D included in Bk(D) is equal to or higher than half of the highest order of D included in the AXr,k(D).

### Claim 2

A reception method comprising:
receiving low-density parity-check (LDPC) encoded data which is encoded by a transmission apparatus and transmitted through a power line communication;
decoding the LDPC encoded data based on a parity check matrix in which “n” number of (where n is an integer equal to or greater than 1) parity check equation groups including a plurality of parity check polynomials are arranged, wherein each of the plurality of parity check polynomials satisfies zero, wherein
the LDPC encoded data includes a parity sequence and an information sequence, the parity sequence comprises low-density parity-check (LDPC) encoded data which is generated by LDPC-encoding the information sequence using the parity check matrix, and the parity sequence is generated by using a first column to a determined column of the parity check matrix for the information sequence having a sequence length that corresponds to a length from the first column to the determined column among one or more column(s) of the parity check matrix, wherein the determined column varies depending on a coding rate; and
the parity check equation groups support coding rates of (r−1)/r (where r equals to or more than 2 and equals to or less than q, where q is a natural number equal to or more than 3), support a time varying period of g (where g is an integer equal to or more 2), and are arranged repeatedly at every gth row of the parity check matrix, the parity check polynomial being represented as:
AX1,k(D)X1(D)+AX2,k(D)X2(D)+Λ+AXq−1,k(D)Xq−1(D)+Bk(D)P(D)=0 (k=i mod g) (Equation 2)
where, in Equation 2, X1(D), X2(D), . . . , Xq−1(D) are polynomial representations of data X1, X2, . . . , Xq−1 respectively, P(D) is a polynomial representation of parity P, AXr,k(D) is a term of Xr(D) in the parity check polynomial for “k=i mod g” at time i where the coding rate is (r−1)/r, Bk(D) is a term of P(D) in the parity check polynomial for “k=i mod g” at time i, where “i mod g” is a remainder after dividing i by g, and the highest order of D included in Bk(D) is equal to or below half of the highest order of D included in the AXr,k(D).
