Advanced Search
Volume 30 Issue 10
Jan.  2011
Turn off MathJax
Article Contents
Zhao Hong-Yu, Fan Ping-Zhi. An Efficient Improved MAP Decoding Algorithm for Turbo Codes[J]. Journal of Electronics & Information Technology, 2008, 30(10): 2397-2401. doi: 10.3724/SP.J.1146.2007.00390
Citation: Zhao Hong-Yu, Fan Ping-Zhi. An Efficient Improved MAP Decoding Algorithm for Turbo Codes[J]. Journal of Electronics & Information Technology, 2008, 30(10): 2397-2401. doi: 10.3724/SP.J.1146.2007.00390

An Efficient Improved MAP Decoding Algorithm for Turbo Codes

doi: 10.3724/SP.J.1146.2007.00390
  • Received Date: 2007-03-19
  • Rev Recd Date: 2007-08-22
  • Publish Date: 2008-10-19
  • This paper presents an improved maximum a posteriori probability (MAP) decoding algorithm for optimal decoding of parallel concatenated convolutional codes (Turbo codes). Compared with the Log-MAP algorithms based on logarithm domain, the proposed algorithm does not introduce logarithm domain, but it can eliminate large amount of exponential and logarithm arithmetic operations required with the standard MAP algorithm in the iterative decoding process. Simulations demonstrate that he proposed algorithm, with optimal error correction performance, can significantly reduce the running time, such that its decoding efficiency is even slightly superior to that of the fastest logarithm domain MAP algorithm(Max-Log-MAP) which sacrifices considerable error correction performance.
  • loading
  • [1] Berrou C, Glavieux A, and Thitimajshima P. Near Shannonlimit error-correcting coding and decoding. Proc. of IEEEInt. Conf. on Communications 1993, Geneva, 1993:1064-1070. [2] 3rd Generation Partnership Project, Multiplexing andchannel coding(FDD), 3G TS 25.212, June 1999. [3] Robertson P, Villebrun E, and Hoecher P. A comparison ofoptimal and sub-optimal MAP decoding algorithmsoperation in the Log Domain. Proc. of Int. Conf. onCommunications 1995, Seattle, Gateway to Globalization,1995: 1009-1013. [4] Cheng J-F and Ottosson T. Linearly approximatedLog-MAP algorithms for turbo decoding. Vehicular Tech.Conf. Proceedings 2000, Tokyo, 2000, 3: 2252-2256. [5] Valenti M C. An efficient software radio implementation ofthe UMTS turbo code, Proc. of 2001 12th IEEEInternational Symposium on Personal, Indoor and MobileRadio Comm. 2001, 2: G-108-G-113. [6] Offer H E and Papke L. Iterative decoding of binary blockand convolutional codes[J].IEEE Trans. on Inform. Theory.1996, 42(2):429-445 [7] Montorsi G and Benedetto S. Design of fixed-point iterativedecoders for concatenated codes with interleavers[J].IEEEJournal on Selected Areas in Comm.2001, 19(Issue 5):871-881 [8] Park S J. Combined Max-Log-MAP and Log-MAP of turbocodes[J].IEE Electronics Letters.2004, 40(4):251-252 [9] Papaharalabos S, Sweeney P, and Evans B G. SISOalgorithm based on combined max/max* operations forturbo decoding[J].IEE Electronics Letters.2005, 41(3):142-143 [10] Hall E K and Wilson S G. Design and analysis of turbo codeson Rayleigh fading channels[J].IEEE Journal on Selected Areasin Comm.1998, 16(Issue 2):160-174 [11] 王新梅,肖国镇. 纠错码原理与方法(修订版). 西安:西安电子科技大学出版社,2001: 505-532.Wang X M and Xiao G Z. Correcting Error Codes Principles and Methods (Amended version), Xian: XianElectronics Science and Technology University Press, 2001:505-532.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (3685) PDF downloads(909) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return