| 摘要 |
<P>PROBLEM TO BE SOLVED: To obtain excellent reception quality when an LDPCP-CC is generated, and an information sequence is sent after subjected to an error-correction encoding using the LDPC-CC. Ž<P>SOLUTION: In an encoding method for generating low-density parity-check convolutional codes (LDPC) of a time-variant period 3g (g: a positive integer), an LDPC-CC code word is obtained through linear operation between first to 3g-th parity check polynomials and input data for LDPC-CC defined based upon a parity check polynomial expressed by expression (1-k) [Here, X<SB>1</SB>(D), X<SB>2</SB>(D), ..., X<SB>n-1</SB>(D) are polynomial representations (n: an integer not less than 2) of information sequences X<SB>1</SB>, X<SB>2</SB>, ..., X<SB>n-1</SB>, P(D) is a polynomial representation of a parity sequence. Further, a<SB>#k.p.1</SB>, a<SB>#k.p.2</SB>, a<SB>#k.p.3</SB>(k=1, 2, 3, ..., 3g: p=1, 2, 3, ..., n-1) are integers (provided that a<SB>#k.p.1</SB>≠a<SB>#k.p.2</SB>≠a<SB>#k.p.3</SB>), and b<SB>#k.1</SB>, b<SB>#k.2</SB>, and b<SB>#k.3</SB>are integers (provided that b<SB>#k.1</SB>≠b<SB>#k.2</SB>≠b<SB>#k.3</SB>). Furthermore, c%d represents the remainder after (c) is divided by (d)]. Ž<P>COPYRIGHT: (C)2010,JPO&INPIT Ž
|
