| 摘要 |
PROBLEM TO BE SOLVED: To solve the problem that decoding performance is deteriorated in the case of performing Viterbi decoding by collectively executing arithmetic processing for a decoded word consisting of a plurality of bits. SOLUTION: Processing for selecting a maximum likelihood path for a decoded word which is a convolution code on the basis of a state metric value and a branch metric value in each state is executed up to the final time of the decoded word, and in the case of executing decoding by tracing back the decoded word from the 0 state, the processing for selecting the maximum likelihood is executed in each n-bits (n is an integer≥2), and at the time of starting tracing-back when the total number of bits of the decoded word is not n's multiple, paths to be candidates for selection are limited to specific paths p, q which can be candidates by the number of bits of n bits or less. COPYRIGHT: (C)2006,JPO&NCIPI
|
