| 摘要 |
PROBLEM TO BE SOLVED: To restrain an increase of the number of recursive computing times due to learning even if the number of pipeline stages when decoding a turbo code by pipelining and improve decoding throughput and energy efficiency. SOLUTION: A turbo decoding method of a sequence length T=K×N (K and N are positive integer numbers), which curries out repetitive decoding of the turbo code comprises: a step of forming K forward calculation paths from a first forward calculation path for starting forward repetitive decoding calculation from a sequence number (k-1)×N+1 (k=1, 2, ..., K) to a K-th forward calculation path; and a K-1 forward overwriting processes from a first forward overwriting process to a (K-1)-th forward overwriting process in which a forward state metric calculation result of a (a+1)-th forward calculation path (a=1, 2, ..., K-1) is overwritten with a forward state metric calculation result of an a-th forward calculation path. COPYRIGHT: (C)2011,JPO&INPIT |
