25-08-2016 дата публикации
Номер: US20160248443A1
Принадлежит:
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. 2. The transmitting method according to claim 2 , wherein:{'sub': #1,1,3', '#1,1,1', '#1,1,2', '#1,3', '#1,1', '#1,2, 'in the first parity check polynomials, a=0, (a%3, a%3) is either (1, 2) or (2, 1), and b=0, (b%3, b%3) is either (1, 2) or (2, 1);'}{'sub': #2,1,3', '#2,1,1', '#2,1,2', '#2,3', '#2,1', '#2,2, 'in the second parity check polynomials, a=0, (a%3, a%3) is either (1, 2) or (2, 1), and b=0, (b%3, b%3) is either (1, 2) or (2, 1); and'}{'sub': #3,1,3', '#3,1,1', '#3,1,2', '#3,3', '#3,1', '#3,2, 'in the third parity check polynomials, a=0, (a%3, a%3) is either (1, 2) or (2, 1), and b=0, (b%3, b%3) is either (1, 2) or (2, 1).'}4. The transmitting apparatus according to claim 3 , wherein:{'sub': #1,1,3', '#1,1,1', '#1,1,2', '#1,3', '#1,1', '#1,2, 'in the first parity check polynomials, a=0, (a%3, a%3) is either (1, 2) or (2, 1), and b=0, (b%3, b%3) is either (1, 2) or (2, 1);'}{'sub': #2,1,3', '#2,1,1', '#2,1,2', '#2,3', '#2,1', '#2,2, 'in the second parity check polynomials, a=0, (a%3, a%3) is either (1, 2) or (2, 1), and b=0, (b%3, b%3) is either (1, 2) or (2, 1); and'}{'sub': #3,1,3', '#3,1,1', '#3,1,2', '#3,3', '#3,1', '#3,2, 'in the third parity check polynomials, a=0, (a%3, a%3) is either (1, 2) or (2, 1), and b=0, (b%3, b%3) is either (1, 2) or (2, 1).'} This is a continuation application of application Ser. No. 14/255,651 filed Apr. 17, 2014, which is a continuation application of application Ser. No. 12/679,740 filed Mar. 24, 2010, now U.S. Pat. No. 8,745,471 issued Jun. 3, 2014, which is a 371 application of PCT/JP2008/002701 filed Sep. 26, 2008, ...
Подробнее