A reduced-complexity algorithm for combined equalization and decoding

被引:7
|
作者
Raphaeli, D [1 ]
Kaitz, T
机构
[1] Tel Aviv Univ, Dept Elect Engn, IL-69978 Tel Aviv, Israel
[2] BreezeCOM Ltd, IL-61131 Tel Aviv, Israel
关键词
adaptive equalizers; decision-feedback equalizers; maximum-likelihood decoding; trellis-coded modulation;
D O I
10.1109/26.886470
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper presents a new application of a suboptimal trellis decoding algorithm for combined equalization and decoding. The proposed algorithm can outperform the reduced-state sequence estimator (RSSE) of the same carder of complexity. The algorithm, termed estimated future decision-feedback algorithm (EFDFA), was originally proposed for the problem of noncoherent decoding with multiple-symbol overlapped observations and is now reformulated for the problem of intersymbol interference inflicted channels. The EFDFA uses the RSSE as a building block. The performance improvement is achieved by using estimated future symbols in the decision process. The estimated future symbols are obtained by RSSE decoding time-reversed blocks of the input, The same technique can be used to greatly enhance the performance of the conventional decision-feedback equalizer. An analysis of the performance of the EFDFA based on the performance of the RSSE is described. The EFDFA can be configured as an adaptive equalizer capable of operating in a time-varying environment, and is shown to perform well in fading conditions,With only minor additional complexity, the EFDFA is also capable of producing soft outputs.
引用
收藏
页码:1797 / 1807
页数:11
相关论文
共 50 条
  • [1] Reduced-complexity BCJR algorithm for turbo equalization
    Fertonani, Dario
    Barbieri, Alan
    Colavolpe, Giulio
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2007, 55 (12) : 2279 - 2287
  • [2] Reduced-Complexity BCJR Algorithm for Turbo Equalization
    Fertonani, Dario
    Barbieri, Alan
    Colavolpe, Giulio
    2006 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-12, 2006, : 1237 - 1242
  • [3] A new reduced-complexity decoding algorithm for LDPC codes
    Sun, Guohui
    Jin, Jing
    Yao, Wenbin
    Yang, Hongwen
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2007, E90B (07) : 1835 - 1838
  • [4] Sliding-Window Turbo Equalization and Its Reduced-Complexity Decoding Techniques
    Khittiwitchayakul, Sirawit
    Phakphisut, Watid
    IEEE ACCESS, 2022, 10 : 46558 - 46570
  • [5] Reduced-complexity equalization techniques for ISI and MIMO wireless channels in iterative decoding
    Wong, Kitty K. Y.
    McLane, Peter J.
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2008, 26 (02) : 256 - 268
  • [6] A Reduced-Complexity ADMM Based Decoding Algorithm for LDPC Codes
    Liang, Zhibiao
    Chen, Xiang
    Sun, Xinghua
    Zhai, Lijun
    2019 11TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS AND SIGNAL PROCESSING (WCSP), 2019,
  • [7] Reduced-Complexity Decoding of LT Codes
    Albayrak, Cenk
    Turk, Kadir
    WIRELESS PERSONAL COMMUNICATIONS, 2017, 94 (03) : 969 - 975
  • [8] Reduced-Complexity Lattice Spherical Decoding
    Mejri, Asma
    Rekaya-Ben Othman, Ghaya
    2015 12TH INTERNATIONAL SYMPOSIUM ON WIRELESS COMMUNICATION SYSTEMS (ISWCS), 2015,
  • [9] NEW APPROACHES TO REDUCED-COMPLEXITY DECODING
    COFFEY, JT
    GOODMAN, RM
    FARRELL, PG
    DISCRETE APPLIED MATHEMATICS, 1991, 33 (1-3) : 43 - 60
  • [10] Reduced-Complexity Decoding of LT Codes
    Cenk Albayrak
    Kadir Turk
    Wireless Personal Communications, 2017, 94 : 969 - 975