On the complexity of turbo decoding algorithms

被引：0
|
作者：
Wu, PHY [1 ]
机构：
[1] MIT, Lincoln Lab, Lexington, MA 02420 USA
来源：
IEEE VTC 53RD VEHICULAR TECHNOLOGY CONFERENCE, SPRING 2001, VOLS 1-4, PROCEEDINGS | 2001年
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper we evaluate computational complexity of several Turbo decoding algorithms: Log Maximum A Posteriori (Log-MAP), Maximum Log-MAP (Max-Log-MAP) and the Soft Output Viterbi Algorithm (SOVA). The computational complexity is analyzed in terms of mathematical operations and the results are normalized by an equivalent addition operation for easy comparison. Furthermore, these algorithms are programmed on a DSP and the number of CPU cycles per decoded bit is measured. Our approach leads to a quick complexity estimate of a Turbo decoder with respect to the conventional Viterbi decoder. Both analyzed and measured results suggest that the Max-Log-MAP algorithm is the best implementation choice because it is the least complex and exhibits only minor performance loss.
引用
收藏
页码：1439 / 1443
页数：5
相关论文
共 50 条
  • [1] Implementation complexity analysis of the turbo decoding algorithms on digital signal processor
    Romanyuk, Olexander N.
    Ivanov, Yuriy Yu.
    Bisikalo, Oleg V.
    Stukach, Oleg V.
    Ignatovska, Ruslana V.
    Romaniuk, Ryszard S.
    Azeshova, Zhanar
    PHOTONICS APPLICATIONS IN ASTRONOMY, COMMUNICATIONS, INDUSTRY, AND HIGH-ENERGY PHYSICS EXPERIMENTS 2018, 2018, 10808
  • [2] Reduced complexity sliding window BCJR decoding algorithms for turbo codes
    Gwak, J
    Shin, SK
    Kim, HM
    CRYPTOGRAPHY AND CODING, 1999, 1746 : 179 - 184
  • [3] On the Logical Computational Complexity Analysis of Turbo Decoding Algorithms for the LTE Standards
    Y. Beeharry
    T. P. Fowdur
    K. M. S. Soyjaudah
    Wireless Personal Communications, 2021, 118 : 1591 - 1619
  • [4] On the Logical Computational Complexity Analysis of Turbo Decoding Algorithms for the LTE Standards
    Beeharry, Y.
    Fowdur, T. P.
    Soyjaudah, K. M. S.
    WIRELESS PERSONAL COMMUNICATIONS, 2021, 118 (02) : 1591 - 1619
  • [5] Complexity reduction of turbo decoding
    Shibutani, A
    Suda, H
    Yamao, Y
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2001, E84B (09) : 2705 - 2709
  • [6] Fixed-point performance of low-complexity turbo decoding algorithms
    Blankenship, TK
    Classon, B
    IEEE VTC 53RD VEHICULAR TECHNOLOGY CONFERENCE, SPRING 2001, VOLS 1-4, PROCEEDINGS, 2001, : 1483 - 1487
  • [7] Reduced-complexity algorithms for near-optimal decoding of turbo TCM codes
    Sybis, M.
    Tyczka, P.
    Papaharalabos, S.
    Mathiopoulos, P. T.
    ELECTRONICS LETTERS, 2009, 45 (05) : 278 - 279
  • [8] The SC-MMSE turbo MIMO equalizer with reduced complexity decoding algorithms.
    Boukalov, A
    VTC2004-FALL: 2004 IEEE 60TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-7: WIRELESS TECHNOLOGIES FOR GLOBAL SECURITY, 2004, : 5063 - 5067
  • [9] Bifurcations and chaos in turbo decoding algorithms
    Tasev, Z
    Popovski, P
    Maggio, GM
    Kocarev, L
    BIFURCATION CONTROL: THEORY AND APPLICATIONS, 2003, 293 : 301 - 320
  • [10] A low-complexity scheduling for turbo equalization with turbo decoding
    Fonseca dos Santos, Andre
    Rave, Wolfgang
    Fettweis, Gerhard
    2007 IEEE 65TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-6, 2007, : 2160 - 2164
12345