Design criteria for reduced-complexity joint multiuser detection and group decoding

被引:0
|
作者
Corral-Briones, G [1 ]
机构
[1] Natl Univ Cordoba, Digital Commun Res Lab, Cordoba, Argentina
关键词
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Decision feedback multiuser detection with trellis code modulation (TCM) has been proposed to increase spectral efficiency of bandlimited multiple-access channel (MAC) [1, 2]. In this paper, we investigate design criteria to achieve good tradeoffs between performance and complexity for joint multiuser detection and group decoding (MD-GD) [2, 3]. Two approaches are considered to improve performance: reduced state algorithms and generalized Viterbi (GV) algorithms. In channels where the main perturbation is multiple-access interference, we show that performance can be further improved increasing the number of states of the channel rather than exploiting the coding information of more users. However, if error propagation is mitigated, additional coding information significantly improves performance. Numerical results show the good performance and low complexity of the MD-GD schemes designed from the new criteria introduced in this paper.
引用
收藏
页码:424 / 430
页数:7
相关论文
共 50 条
  • [41] SIMPLIFIED QUADRATURE CODING SCHEME AND ITS REDUCED-COMPLEXITY DECODING
    SUN, W
    ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS, 1992, 47 (1-2): : 64 - 72
  • [42] Design of low complexity multiuser detection using information theoretic criteria
    Wu, ML
    Fang, WHS
    Chen, JTS
    GLOBECOM '01: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6, 2001, : 254 - 258
  • [43] Linear detection in iterative joint multiuser decoding
    Rasmussen, Lars K.
    2008 3RD INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS, CONTROL AND SIGNAL PROCESSING, VOLS 1-3, 2008, : 753 - 757
  • [44] Reduced-Complexity Linear Programming Decoding Based on ADMM for LDPC Codes
    Wei, Haoyuan
    Jiao, Xiaopeng
    Mu, Jianjun
    IEEE COMMUNICATIONS LETTERS, 2015, 19 (06) : 909 - 912
  • [45] Reduced-Complexity LDPC Decoding for Next-Generation IoT Networks
    Asif, Muhammad
    Khan, Wali Ullah
    Afzal, H. M. Rehan
    Nebhen, Jamel
    Ullah, Inam
    Rehman, Ateeq Ur
    Kaabar, Mohammed K. A.
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2021, 2021
  • [46] REDUCED-COMPLEXITY DECODING ALGORITHMS FOR UNITARY SPACE-TIME CODES
    Su Xin* ** Yi Kechu* Tian Bin* Sun Yongjun* *(State Key Laboratory of Integrated Service Networks
    JournalofElectronics(China), 2007, (01) : 112 - 115
  • [47] A Reduced-Complexity Successive-Cancellation Decoding Algorithm for Polar Codes
    Xing, Chao
    Wang, Bei
    Zhao, Shengmei
    2013 6TH INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING (CISP), VOLS 1-3, 2013, : 1221 - 1225
  • [48] Approaching MIMO channel capacity with reduced-complexity soft sphere decoding
    Wang, RQ
    Giannakis, GB
    2004 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-4: BROADBAND WIRELESS - THE TIME IS NOW, 2004, : 1620 - 1625
  • [49] Reduced-complexity iterative decoding of high-rate turbo codes
    Minowa, T
    Imai, H
    GLOBECOM '00: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1- 3, 2000, : 193 - 197
  • [50] Optimization of a reduced-complexity decoding algorithm for LDPC codes by density evolution
    Richter, G
    Schmidt, G
    Bossert, M
    Costa, E
    ICC 2005: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, 2005, : 642 - 646