# US 2013/0297993 A1 · Encoding method, and decoding method

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

- Number: US 2013/0297993 A1
- Document ID: US20130297993A1
- Status: Published application
- Kind: A1
- Application number: 13/979,571
- Filed: 2012-01-19
- Published: 2013-11-07
- Earliest claimed: 2011-01-21
- Assignees: Panasonic Corporation
- Inventors: Yutaka Murakami
- Web page: https://patentgrep.com/patent/US20130297993A1

## CPC

- 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/036: {Heuristic code construction methods, i.e. code construction or code search based on using trial-and-error}
- H03M 13/1111: {Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms}
- H03M 13/1154: {Low-density parity-check convolutional codes [LDPC-CC]}
- H03M 13/23: using convolutional codes, e.g. unit memory codes
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- H03M 13/635: {Error control coding in combination with rate matching}
- 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

An encoding method generates an encoded sequence by performing encoding of a given coding rate according to a predetermined parity check matrix. The predetermined parity check matrix is a first parity check matrix or a second parity check matrix. The first parity check matrix corresponds to a low-density parity check (LDPC) convolutional code using a plurality of parity check polynomials. The second parity check matrix is generated by performing at least one of row permutation and column permutation with respect to the first parity check matrix. An eth parity check polynomial that satisfies zero, of the LDPC convolutional code, is expressible by using a predetermined mathematical formula.

## Claims

### Claim 1

An encoding method comprising
generating an encoded sequence comprising: n−1 information sequences denoted as X1 through Xn−1; and a parity sequence denoted as P, by encoding the n−1 information sequences at a (n−1)/n coding rate according to a predetermined parity check matrix having m×z rows and n×m×z columns, n being an integer no less than two, m being an integer no less than two, and z being a natural number, wherein
the predetermined parity check matrix is a first parity check matrix or a second parity check matrix, the first parity check matrix corresponding to a low-density parity check (LDPC) convolutional code using a plurality of parity check polynomials, the second parity check matrix generated by performing at least one of row permutation and column permutation with respect to the first parity check matrix, and
given e denoting an integer no less than zero and no greater than m×z−1, α denoting an integer no less than one and no greater than m×z, and i being a variable denoting an integer that is no less than zero and no greater than m−1 and satisfies i=e % m where % denotes a modulo operator,
when e≠α−1, an eth parity check polynomial that satisfies zero, of the LDPC convolutional code, is expressed as
(
D
b


1
,
i
+
1
)

P

(
D
)
+
∑
k
=
1
n
-
1


{
(
1
+
∑
j
=
1
rk


D
ak
,
i
,
j
)

X
k

(
D
)
}
=
0
(
Math
.

1
)
where b1,i is a natural number, and
when e=α−1, the eth parity check polynomial that satisfies zero, of the LDPC convolutional code, is expressed as
P

(
D
)
+
∑
k
=
1
n
-
1


{
(
1
+
∑
j
=
1
rk


D
ak
,
(
α
-
1
)

%

m
,
j
)

X
k

(
D
)
}
=
0
(
Math
.

2
)
where, in Math. 1 and Math. 2,
p denotes an integer no less than one and no greater than n−1, q denotes an integer no less than one and no greater than rp, and rp denotes an integer no less than three,
D denotes a delay operator, Xp(D) denotes a polynomial representation of an information sequence Xp among the n−1 information sequences, and P(D) denotes a polynomial representation of the parity sequence P, and
ap,i,q denotes a natural number, and
when x and y are integers no less than one and no greater than rp and satisfy x≠y, ap,i,x=ap,i,y holds true for all x and y.

### Claim 2

A decoding method comprising:
generating an encoded sequence comprising: n−1 information sequences denoted as X1 through Xn−1; and a parity sequence denoted as P, by encoding the n−1 information sequences at a (n−1)/n coding rate according to a predetermined parity check matrix having m×z rows and n×m×z columns, n being an integer no less than two, m being an integer no less than two, and z being a natural number; and
decoding the encoded sequence according to the predetermined parity check matrix by employing belief propagation (BP), wherein
the predetermined parity check matrix is a first parity check matrix or a second parity check matrix, the first parity check matrix corresponding to a low-density parity check (LDPC) convolutional code using a plurality of parity check polynomials, the second parity check matrix generated by performing at least one of row permutation and column permutation with respect to the first parity check matrix, and
given e denoting an integer no less than zero and no greater than m×z−1, a denoting an integer no less than one and no greater than m×z, and i being a variable denoting an integer that is no less than zero and no greater than m−1 and satisfies i=e % m where % denotes a modulo operator,
when e≠a−1, an eth parity check polynomial that satisfies zero, of the LDPC convolutional code, is expressed as
(
D
b


1
,
i
+
1
)

P

(
D
)
+
∑
k
=
1
n
-
1


{
(
1
+
∑
j
=
1
rk


D
ak
,
i
,
j
)

X
k

(
D
)
}
=
0
(
Math
.

1
)
where b1,i is a natural number, and
when e=α−1, the eth parity check polynomial that satisfies zero, of the LDPC convolutional code, is expressed as
P

(
D
)
+
∑
k
=
1
n
-
1


{
(
1
+
∑
j
=
1
rk


D
ak
,
(
α
-
1
)

%

m
,
j
)

X
k

(
D
)
}
=
0
(
Math
.

2
)
where, in Math. 1 and Math. 2,
p denotes an integer no less than one and no greater than n−1, q denotes an integer no less than one and no greater than rp, and rp denotes an integer no less than three,
D denotes a delay operator, Xp(D) denotes a polynomial representation of an information sequence Xp among the n−1 information sequences, and P(D) denotes a polynomial representation of the parity sequence P, and
ap,i,q denotes a natural number, and
when x and y are integers no less than one and no greater than rp and satisfy x≠y, ap,i,x=ap,i,y holds true for all x and y.
