论文部分内容阅读
本文主要工作:(1)从算法上证明了对于TCM用的一类有并行转移支路的卷积玛,其VITERBI译码算法可以作很有效的简化,而且简化不影响译码性能。(2)给出了表征算法复杂性的公式,讨论了简化效果。简化算法的复杂性约为常规算法的1/2~P。(3)用计算机模拟验证了简化算法和常规算法的等效性。因而,算法的简化不影响译码性能。
The main contributions of this dissertation are listed as follows: (1) The algorithm shows that the VITERBI decoding algorithm can effectively simplify a class of convolutional matrices with parallel branches, and its simplification does not affect the decoding performance. (2) The formulas for characterizing the complexity of the algorithm are given, and the simplification effect is discussed. The complexity of the simplified algorithm is about 1/2 ~ P of the conventional algorithm. (3) The equivalence between the simplified algorithm and the conventional algorithm is verified by computer simulation. Therefore, the simplification of the algorithm does not affect the decoding performance.