Computational Complexity Analysis of FEC Decoding on SDR Platforms

被引：9
|
作者：
Wu, Zhenzhi [1 ,2 ]
Gong, Chen [1 ]
Liu, Dake [1 ,2 ]
机构：
[1] Beijing Inst Technol, Sch Informat & Elect, Beijing 100081, Peoples R China
[2] Linkoping Univ, Inst Elect Engn, SE-58183 Linkoping, Sweden
来源：
JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY | 2017年 / 89卷 / 02期
关键词：
SDR; FEC; GOPS; Computational complexity; Convolutional code; Turbo; LDPC; Viterbi; Layered decoding; BCJR; MULTI-CORE; TURBO; ALGORITHM;
D O I：
10.1007/s11265-016-1184-8
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The computational complexity evaluation is necessary for software defined Forward Error Correction (FEC) decoders. However, currently there are a limited number of literatures concerning on the FEC complexity evaluation using analytical methods. In this paper, three high efficient coding schemes including Turbo, QC-LDPC and Convolutional code (CC) are investigated. The hardware-friendly decoding pseudo-codes are provided with explicit parallel execution and memory access procedure. For each step of the pseudo-codes, the parallelism and the operations in each processing element are given. Based on it the total amount of operations is derived. The comparison of the decoding complexity among these FEC algorithms is presented, and the percentage of each computation step is illustrated. The requirements for attaining the evaluated results and reference hardware platforms are provided. The benchmarks of state-of-the-art SDR platforms are compared with the proposed evaluations. The analytical FEC complexity results are beneficial for the design and optimization of high throughput software defined FEC decoding platforms.
引用
收藏
页码：209 / 224
页数：16
相关论文
共 50 条
  • [41] PARAMETERIZED COMPLEXITY ANALYSIS IN COMPUTATIONAL BIOLOGY
    BODLAENDER, HL
    DOWNEY, RG
    FELLOWS, MR
    HALLETT, MT
    WAREHAM, HT
    COMPUTER APPLICATIONS IN THE BIOSCIENCES, 1995, 11 (01): : 49 - 57
  • [42] Program analysis for implicit computational complexity
    Jones, ND
    PROGRAMS AS DATA OBJECTS, PROCEEDINGS, 2001, 2053 : 1 - 1
  • [43] Automated implicit computational complexity analysis
    Avanzini, Martin
    Moser, Georg
    Schnabl, Andreas
    AUTOMATED REASONING, PROCEEDINGS, 2008, 5195 : 132 - +
  • [44] Computational complexity of network vulnerability analysis
    Berberler, Murat Ersen
    ACTA UNIVERSITATIS SAPIENTIAE INFORMATICA, 2022, 14 (02) : 199 - 207
  • [45] Energy Analysis Method of Computational Complexity
    Peng, Wang
    ISCSCT 2008: INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND COMPUTATIONAL TECHNOLOGY, VOL 2, PROCEEDINGS, 2008, : 682 - 685
  • [46] Complexity analysis of interior point methods for LP decoding
    Sun, Yifan
    Dolecek, Lara
    2011 CONFERENCE RECORD OF THE FORTY-FIFTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS (ASILOMAR), 2011, : 659 - 663
  • [47] Application of erasure decoding in fiber optical systems with FEC
    Xie, B
    Guan, YL
    Chen, J
    Lu, C
    Li, ZH
    2005 Digest of the LEOS Summer Topical Meetings, 2005, : 171 - 172
  • [48] A Reconfigurable LFSR for tri-standard SDR transceiver, architecture and complexity analysis
    Alaus, Laurent
    Noguet, Dominique
    Palicot, Jacques
    11TH EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN - ARCHITECTURES, METHODS AND TOOLS : DSD 2008, PROCEEDINGS, 2008, : 61 - +
  • [49] Computational complexity and quantization effects of decoding algorithms for non-binary IDPC codes
    Wymeersch, H
    Steendam, H
    Moeneclaey, M
    2004 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL IV, PROCEEDINGS: AUDIO AND ELECTROACOUSTICS SIGNAL PROCESSING FOR COMMUNICATIONS, 2004, : 669 - 672
  • [50] Iterative Slepian-Wolf Decoding and FEC Decoding for Compress-and-forward Systems
    Qi, Yinan
    Imran, Muhamamd Ali
    Tafazolli, Rahim
    2012 IEEE VEHICULAR TECHNOLOGY CONFERENCE (VTC FALL), 2012,
12345