Design of Network Codes for Multiple-User Multiple-Relay Wireless Networks

被引:71
作者
Xiao, Ming [1 ,2 ]
Kliewer, Joerg [3 ]
Skoglund, Mikael [1 ,2 ]
机构
[1] Royal Inst Technol, Commun Theory Sch Elect Engn, Stockholm, Sweden
[2] Royal Inst Technol, ACCESS Linnaeus Ctr, Sch Elect Engn, Stockholm, Sweden
[3] New Mexico State Univ, Klipsch Sch Elect & Comp Engn, Las Cruces, NM 88003 USA
基金
美国国家科学基金会;
关键词
Network coding; relay; finite field; MDS codes; diversity order; COOPERATIVE DIVERSITY; CAPACITY THEOREMS; PROTOCOLS;
D O I
10.1109/TCOMM.2012.091012.110121
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We investigate the design of network codes for multiple-user multiple-relay (MUMR) wireless networks with slow fading (quasi-static) channels. In these networks, M users have independent information to be transmitted to a common base station (BS) with the help of N relays, where M >= 2 and N >= 1 are arbitrary integers. We investigate such networks in terms of diversity order to measure asymptotic performance. For networks with orthogonal channels, we show that network codes based on maximum distance separable (MDS) codes can achieve the maximum diversity order of N + 1. We further show that the MDS coding construction of network codes is also necessary to obtain full diversity for linear finite field network coding (FFNC). Then, we compare the performance of the FFNC approach with superposition coding (SC) at the relays. The results show that the FFNC based on MDS codes has better performance than SC in both the high rate and the high SNR regime. Further, we discuss networks without direct source-to-BS channels for N >= M. We show that the proposed FFNC can obtain the diversity order N - M + 1, which is equivalent to achieving the Singleton bound for network error-correction codes. Finally, we study the network with nonorthogonal channels and show our codes can still achieve a diversity order of N + 1, which cannot be achieved by a scheme based on SC.
引用
收藏
页码:3755 / 3766
页数:12
相关论文
共 30 条
  • [1] Network information flow
    Ahlswede, R
    Cai, N
    Li, SYR
    Yeung, RW
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) : 1204 - 1216
  • [2] DIVERSITY CODING OR TRANSPARENT SELF-HEALING AND FAULT-TOLERANT COMMUNICATION-NETWORKS
    AYANOGLU, E
    I, CL
    GITLIN, RD
    MAZO, JE
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1993, 41 (11) : 1677 - 1686
  • [3] NEW ARRAY CODES FOR MULTIPLE PHASED BURST CORRECTION
    BLAUM, M
    ROTH, RM
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (01) : 66 - 77
  • [4] Cai N, 2006, COMMUN INF SYST, V6, P37
  • [5] Chen YD, 2006, IEEE WCNC, P1681
  • [6] COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084
  • [7] Dahlman E., 2008, 3G EVOLUTION, V2nd
  • [8] Duyck D, 2010, EURASIP J WIRELESS C
  • [9] Hausl C, 2005, P 2005 IEEE ALL C CO
  • [10] Embracing wireless interference: Analog network coding
    Katti, Sachin
    Gollakota, Shyamnath
    Katabi, Dina
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2007, 37 (04) : 397 - 408