用于Turbo迭代譯碼的log-MAP算法的簡化
SIMPLIFICATION OF LOG-MAP ALGORITHM USED FOR TURBO ITERATIVE DECODING
-
摘要: 對用于Turbo迭代譯碼的對數(shù)最大后驗概率(log-MAP)譯碼算法進行了分析和推導(dǎo)。根據(jù)Turbo編譯碼特點以及對格圖中分支路徑量度特性的分析,得到了簡化分支路徑量度和外部信息計算的方法。并就log-MAP算法中形如ln(ex+ey)的計算作了分析和化簡,進一步減小log-MAP算法的復(fù)雜性。最后給出仿真結(jié)果并進行了分析。
-
關(guān)鍵詞:
- Turbo碼; log-MAP算法; 迭代譯碼; 外部信息
Abstract: In this paper, logarithm MAP algorithm used for turbo iterative decoding is analyzed and deduced. Based on the characteristic of turbo coding and decoding and the analysis of branch metric in the trellis, methods of simplifying computation of branch metric and extrinsic information are obtained. And then it is done with the computation of ln(ex+ey) in the log-MAP algorithm to further simplify the complexity of log-MAP. Finally, simulation results and analysis are carried out. -
C. Berrou.[J].A. Glavieux, P. Thitimajshima, Near Shannon limit error correcting coding and decoding: Turbo-codes(1), In ICC93, Geneva, Switzerland, May.1993,:-[2]S. Benedetto, D. Divsalar, G. Montorsi, F. Pollara, Soft-output decoding algorithms in iterative decoding of turbo codes, TDA Progress Report 42-119, February, 1996, 63-87.[3]L.R. Bahl, J. Cocke, F. Jeinek, J. Raviv, Optimal decoding of linear codes for minimizing symbol error rate, IEEE Trans. on IT, 1974, IT-20(3), 248-287.[4]S. Benedetto, D. Divsalar, G. Montorsi, F. Pollara, A soft-input soft-output maximum a posteriori(MAP) module to decode parallel and serial concatenated codes, TDA Progress Report 42-127,November 1996, 1-20.[5]P. Robertson.[J].E. Villebrum, P. Hoeher, A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain, In ICC95, Seattle, Washington, June.1009,1995:- -
計量
- 文章訪問數(shù): 2567
- HTML全文瀏覽量: 129
- PDF下載量: 576
- 被引次數(shù): 0
下載:
