Viterbi decoding algorithm for convolutional codes with repeat request
Viterbi decoding algorithm for convolutional codes with repeat request
复制标题
具有重复请求的卷积码维特比译码算法
DOI：
10.1109/tit.1980.1056245
复制
发表时间：
1980
期刊：
影响因子：
--
通讯作者：
K. Itoh
中科院分区：
文献类型：
--
作者：
Hirosuke Yamamoto;K. Itoh
本文提出了一种卷积码的Viterbi译码算法，并利用随机编码和生成函数参数对该算法的性能进行了分析和仿真。结果表明，该译码算法的可靠性函数渐近地是无重复请求的Viterbi译码算法的2倍，并且在一定的实际情况下，在给定性能的前提下，该译码算法比普通Viterbi译码算法节省约50%的约束长度.
Using the Viterbi decoding algorithm with repeat request for convolutional codes is proposed, and the resulting performance is analyzed by random coding and generating function arguments and by simulation. It is shown that the reliability function of the proposed decoding algorithm is asymptotically twice that of the Viterbi decoding algorithm without repeat request, and that in certain practical situations the proposed algorithm can save about 50 percent in constraint length over the ordinary Viterbi algorithm for a given performance.