| 摘要 |
PROBLEM TO BE SOLVED: To reduce a calculation amount necessary for calculating a base sequence for interchanging in rows as to an interleaver of turbo codes and to shorten processing time. SOLUTION: A base sequence S(j) is not directly calculated but is indirectly calculated by using a sequence M(n)=[v*n] mod p. The value of M(n) can be calculated from a recurrence formula without using remainder operation and the calculated value is stored in a memory. The M(n) satisfies S(j)=M(S(j-1)). By determining an initial value of S(j) and interleaving the value of M(n) stored in the memory, the base sequence (Sj) can be calculated without performing the remainder operation. COPYRIGHT: (C)2005,JPO&NCIPI
|
