A Soft-Network-Coded Multilevel Forwarding Scheme for Multiple-Access Relay Systems

被引:9
|
作者
Jayakody, Dushantha N. K. [1 ,2 ]
Li, Jun [3 ]
Flanagan, Mark F. [1 ]
机构
[1] Univ Coll Dublin, Sch Elect Elect & Commun Engn, Dublin, Ireland
[2] Univ Tartu, Coding & Informat Transmiss Grp, Tartu, Estonia
[3] Univ Sydney, Sch Elect Engn & Telecommun, Kensington, NSW 2033, Australia
关键词
Cooperative communications; low-density parity-check coding; network coding; relaying; MITIGATING ERROR PROPAGATION; PARITY-CHECK CODES; COOPERATIVE DIVERSITY; PERFORMANCE; PROTOCOLS; CHANNELS;
D O I
10.1109/TVT.2015.2443253
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper proposes the novel technique of multilevel-threshold-based soft quantization (MLT-SQ) for a multiple-access relay system (MARS). The scheme is suitable for systems using binary phase-shift keying (BPSK) and network coding at the relay. In the proposed MLT-SQ protocol, the relay evaluates the reliabilities, which are expressed as log-likelihood ratios (LLRs), of the received signals from the two sources. It then computes the LLRs of the network-coded packet and quantizes these using a set of optimized multilevel thresholds, forwarding the resulting "quantized soft symbols" to the destination. We provide the derivation for the bit error rate (BER) at the destination, and based on this, we optimize the multilevel thresholds to minimize the BER. Simulation results are provided for the proposed MLT-SQ system, both without coding and for the case where low-density parity-check (LDPC) coding is employed. The proposed system achieves full diversity order. Compared with competing schemes, the performance of our system is superior in terms of BER when the same amount of channel state information (CSI) is exploited.
引用
收藏
页码:3430 / 3439
页数:10
相关论文
共 50 条
  • [21] Resource Allocation for OFDM Multiple-Access Relay Channels with Network Coding
    Han, Bin
    Zhao, Zhongyuan
    Peng, Mugen
    Li, Yong
    Wang, Wenbo
    2012 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2012, : 4701 - 4706
  • [22] Design of Generalized Analog Network Coding for a Multiple-Access Relay Channel
    Wei, Sha
    Li, Jun
    Chen, Wen
    Zheng, Lizhong
    Su, Hang
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2015, 63 (01) : 170 - 185
  • [23] Analog Network Coding Mappings in Gaussian Multiple-Access Relay Channels
    Yao, Sha
    Skoglund, Mikael
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2010, 58 (07) : 1939 - 1949
  • [24] Effect of network topology on the secrecy capacity in multiple-access relay channel
    Zhao, Su
    Chen, Min
    Meng, Qingmin
    Tian, Feng
    Yue, Wenjing
    Journal of Information and Computational Science, 2014, 11 (04): : 1233 - 1241
  • [25] An Adaptive Compress-and-Forward Scheme for the Orthogonal Multiple-Access Relay Channel
    Zeitler, Georg
    Koetter, Ralf
    Bauch, Gerhard
    Widmer, Joerg
    2009 IEEE 20TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, 2009, : 1838 - 1842
  • [26] Physical-layer Network Coding and Information Combining for the Multiple-access Relay Network
    Yang, Lei
    Yang, Tao
    Xie, Yixuan
    Yuan, Jinhong
    An, Jianping
    2016 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2016,
  • [27] A COMPARISON OF TRELLIS CODED VERSUS CONVOLUTIONALLY CODED SPREAD-SPECTRUM MULTIPLE-ACCESS SYSTEMS
    BOUDREAU, GD
    FALCONER, DD
    MAHMOUD, SA
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1990, 8 (04) : 628 - 640
  • [28] On The Physical Layer Network Coded LDPC Codes for A Multiple-Access Relaying System
    Li, Jun
    Lin, Zihuai
    Xu, Jin
    Vucetic, Branka
    2013 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2013, : 2943 - 2948
  • [29] On multiple-access relay channel with common message
    Osmani-Bojd, Mohammad
    Hodtani, Ghosheh Abed
    TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 2016, 27 (08): : 1030 - 1043
  • [30] Cooperative Multiple-Access in Fading Relay Channels
    Yilmaz, A. Ozgur
    2006 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-12, 2006, : 4532 - 4537