# US 11,121,723 B2 · Transmission method, transmission apparatus, reception method and reception apparatus

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

- Number: US 11,121,723 B2
- Document ID: US11121723B2
- Status: Granted
- Kind: B2
- Application number: 16/725,629
- Filed: 2019-12-23
- Published: 2020-05-21
- Granted: 2021-09-14
- Earliest claimed: 2007-09-28
- Assignees: Panasonic Corporation
- Applicants: Panasonic Corporation
- Inventors: Yutaka Murakami; Shutai Okamura; Masayuki Orihashi; Takaaki Kishigami; Shozo Okasaka
- Web page: https://patentgrep.com/patent/US11121723B2

## CPC

- H03M 13/1154: {Low-density parity-check convolutional codes [LDPC-CC]}
- H03M 13/1102: {Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes}
- H03M 13/118: {Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure (H03M13/1165 takes precedence)}
- H03M 13/23: using convolutional codes, e.g. unit memory codes
- H03M 13/235: {Encoding of convolutional codes, e.g. methods or arrangements for parallel or block-wise encoding}
- H03M 13/6362: {by puncturing}
- H04L 1/0041: {Arrangements at the transmitter end}
- 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 low-density parity check convolution code (LDPC-CC) is made, and a signal sequence is sent after being subjected to an error-correcting encodement using the low-density parity check convolution code. In this case, a low-density parity check code of a time-variant period (3g) is created by linear operations of first to 3g-th (letter g designates a positive integer) parity check polynomials and input data.

## Claims

### Claim 1

A transmitting method using an encoding method of a low-density parity-check convolutional code (LDPC-CC) of a coding rate of (n−1)/n and a time-variant period of 3, the method comprising:
providing first to third parity check polynomials that satisfy 0;
generating a parity bit from input data and a bit sequence comprising termination bits being known bits whose values are each 0, using the first to third parity check polynomials that satisfy 0; and
transmitting, by a transmitter, the input data and the generated parity bit, wherein:
the low-density parity-check convolutional code (LDPC-CC) is defined by periodical switching of the first to third parity check polynomials that satisfy 0 by the time-variant period of 3, as the following equations;
∑
j
=
1
n
-
1
⁢
[
(
D
a
⁢
#1
,
j
,
1
+
D
a
⁢
#1
,
j
,
2
+
D
a
⁢
#1
,
j
,
3
)
⁢
X
j
⁡
(
D
)
]
+
(
D
b
⁢
#1
,
1
+
D
b
⁢
#1
,
2
+
D
b
⁢
#1
,
3
)
⁢
P
⁡
(
D
)
=
0
∑
j
=
1
n
-
1
⁢
[
(
D
a
⁢
#2
,
j
,
1
+
D
a
⁢
#2
,
j
,
2
+
D
a
⁢
#2
,
j
,
3
)
⁢
X
j
⁡
(
D
)
]
+
(
D
b
⁢
#2
,
1
+
D
b
⁢
#2
,
2
+
D
b
⁢
#2
,
3
)
⁢
P
⁡
(
D
)
=
0
∑
j
=
1
n
-
1
⁢
[
(
D
a
⁢
#3
,
j
,
1
+
D
a
⁢
#3
,
j
,
2
+
D
a
⁢
#3
,
j
,
3
)
⁢
X
j
⁡
(
D
)
]
+
(
D
b
⁢
#3
,
1
+
D
b
⁢
#3
,
2
+
D
b
⁢
#3
,
3
)
⁢
P
⁡
(
D
)
=
0
wherein:
X1(D) is a polynomial representation of an information sequence X1;
P(D) is a polynomial representation of a parity sequence;
a#k,1,1, a#k,1,2, and a#k,1,3 (where k=1, 2, 3) are integers (where a#k,1,1≠a#k, 1,2≠a#k, 1,3); and
b#k,1, b#k,2, and b#k,3 (where k=1, 2, 3) are integers (where b#k,1≠b#k,2≠b#k,3).

### Claim 2

A transmitting apparatus using an encoding method of a low-density parity-check convolutional code (LDPC-CC) of a coding rate of (n−1)/n and a time-variant period of 3, the apparatus comprising:
a memory which supplies first to third parity check polynomials that satisfy 0;
a parity calculation circuitry which, in operation, generates a parity bit from input data and a bit sequence comprising termination bits being known bits whose values are each 0, by using first to third parity check polynomials that satisfy 0; and
a modulation circuitry which, in operation, generates a transmission signal using the input data and the generated parity bit, wherein:
the low-density parity-check convolutional code (LDPC-CC) is defined by periodical switching of the first to third parity check polynomials by the time-variant period of 3, as the following equations;
∑
j
=
1
n
-
1
⁢
[
(
D
a
⁢
#1
,
j
,
1
+
D
a
⁢
#1
,
j
,
2
+
D
a
⁢
#1
,
j
,
3
)
⁢
X
j
⁡
(
D
)
]
+
(
D
b
⁢
#1
,
1
+
D
b
⁢
#1
,
2
+
D
b
⁢
#1
,
3
)
⁢
P
⁡
(
D
)
=
0
∑
j
=
1
n
-
1
⁢
[
(
D
a
⁢
#2
,
j
,
1
+
D
a
⁢
#2
,
j
,
2
+
D
a
⁢
#2
,
j
,
3
)
⁢
X
j
⁡
(
D
)
]
+
(
D
b
⁢
#2
,
1
+
D
b
⁢
#2
,
2
+
D
b
⁢
#2
,
3
)
⁢
P
⁡
(
D
)
=
0
∑
j
=
1
n
-
1
⁢
[
(
D
a
⁢
#3
,
j
,
1
+
D
a
⁢
#3
,
j
,
2
+
D
a
⁢
#3
,
j
,
3
)
⁢
X
j
⁡
(
D
)
]
+
(
D
b
⁢
#3
,
1
+
D
b
⁢
#3
,
2
+
D
b
⁢
#3
,
3
)
⁢
P
⁡
(
D
)
=
0
wherein:
X1(D) is a polynomial representation of an information sequence X1;
P(D) is a polynomial representation of a parity sequence;
a#k,1,1, a#k,1,2, and a#k,1,3 (where k=1, 2, 3) are integers (where a#k,1,1≠a#k, 1,2≠a#k,1,3); and
b#k,1, b#k,2, and b#k,3 (where k=1, 2, 3) are integers (where b#k,1 #b#k,2≠b#k,3).