Patent ID: 8595588

Claim:
An encoding method for performing low density parity check convolutional coding (LDPC-CC) of a time varying period of q using a parity check polynomial of a coding rate of (n−1)/n (where n is an integer equal to or greater than 2), the method comprising: using a prime number greater than 3 as the time varying period of q; receiving an information sequence as input; and encoding the information sequence using equation 1 as a g-th (g=0, 1, . . . , q−1) parity check polynomial to satisfy 0: ( D a#g,1,1 +D a#g,1,2 +D a#g,1,3 ) X 1 ( D )+( D a#g,2,1 +D a#g,2,2 +D a#g,2,3 ) X 2 ( D )+ . . . +( D a#g,n−1,1 +D a#g,n−1,2 +D a#g,n−1,3 ) X n−1 ( D )+( D b#g,1 +D b#g,2 +1) P ( D )=0 (Equation 1) where, in equation 1: “%” represents a modulo and each coefficient satisfies the following with respect to k=1, 2, . . . , n−1: a #0,k,1 %q=a #1,k,1 %q=a #2,k,1 %q=a #3,k,1 %q= . . . =a #g,k,1 %q= . . . =a #q−2,k,1 %q=a #q−1,k,1 %q=v p=k (v p=k : fixed value); b #0,1 %q=b #1,1 %q=b #2,1 %q=b #3,1 %q= . . . =b #g,1 %q= . . . =b #q−2,1 %q=b #q−1,1 %q=w (w: fixed value); a #0,k,2 %q=a #1,k,2 %q=a #2,k,2 %q=a #3,k,2 %q= . . . =a #g,k,2 %q= . . . =a #q−2,k,2 %q=a #q−1,k,2 %q=y p=k (y p=k : fixed value); b #0,2 %q=b #1,2 %q=b #2,2 %q=b #3,2 %q= . . . =b #g,2 %q= . . . =b #q−2,2 %q=b #q−1,2 %q=z (z: fixed value); and a #0,k,3 %q=a #1,k,3 %q=a #2,k,3 %q=a #3,k,3 %q= . . . =a #g,k,3 %q= . . . =a #q−2,k,3 %q=a #q−1,k,3 %q=s p=k (s p=k : fixed value); a #g,k,1 , a #g,k,2 and a #g,k,3 are natural numbers equal to or greater than 1 and a #g,k,1 ≠a #g,k,2 , a #g,k,1 ≠a #g,k,3 and a #g,k,2 ≠a #g,k,3 hold true; b #g,1 and b #g,2 are natural numbers equal to or greater than 1 and b #g,1 ≠b #g,2 holds true; and v p=k and y p=k are natural numbers equal to or greater than 1.