Transmission method, transmission apparatus, reception method and reception apparatus
AssigneePanasonic Corporation
InventorsYutaka Murakami, Shutai Okamura, Masayuki Orihashi, Takaaki Kishigami, Shozo Okasaka
Life of this patent
Estimating the term…
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.
Claims2
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).
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).
Dependencies are inferred from the claim text.