南京通信工程学院,江苏,南京,210016
纸质出版:2001
移动端阅览
崔 龙, 凌 聪, 吴晓富. 基于改进型SOVA的Turbo译码[J]. 电子学报, 2001,29(7):923-926.
CUI Long, LING Cong, WU Xiao-fu. Modified SOVA-Based Turbo Decoding[J]. Acta Electronica Sinica, 2001, 29(7): 923-926.
第三代移动通信系统IMT-2000的高速率业务倾向于选择Turbo码
这就要求采用低时延、低复杂度的迭代译码技术
主要是软输出Viterbi算法(SOVA)和Max-Log-MAP算法.在先验等概和无限译码深度条件下
已证明略加修改的SOVA等效于Max-Log-MAP算法.由于在迭代译码中
先验概率须不断更新
本文证明了在存在先验概率的条件下改进型SOVA与Max-Log-MAP也是等效的
并讨论了有限译码深度限制下改进型SOVA与滑动窗口Max-Log-MAP算法的等效性.
Turbo codes are preferred for high rate data services in the third generation mobile communication system IMT-2000.Thus low decoding delay and low complexity iterative decoding are of paramount importance.The modiffied soft output Viterbi algorithm(SOVA)and the Max-Log-MAP algorithm are such decoding techniques.The equivalence of the modified SOVA and Max-Log-MAP algorithm has been proven under the condition of no a priori information and infinite decoding depth.Since the a priori information has to be updated in iterative decoding
we prove their equivalence when there exists a priori information in the paper.We also discuss the relationship between the sliding window Max-Log-MAP algorithm and the modified SOVA for finite decoding depth.
0
浏览量
927
下载量
2
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621