• DocumentCode
    3344743
  • Title

    Network Coding Versus Superposition Coding for Two-Way Wireless Communication

  • Author

    Lo, Ernest S. ; Letaief, K.B.

  • Author_Institution
    Dept. of Electr. Eng., Stanford Univ., Stanford, CA
  • fYear
    2009
  • fDate
    5-8 April 2009
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Wireless network coding has attracted significant attention recently over relay channels. In this paper, we are interested in two-way wireless communication and explore the comparative advantages of two popular network coding strategies, binary network coding (NetC) and superposition coding (SupC), also named as analog network coding. In the literature, most works focused on NetC under a three-step framework and recently also SupC but under a two-step one. However, there is still little understanding on the truly optimal configuration. In addition, most works assumed channel knowledge at the transmitters while ignoring the presence of the direct link, which may not be valid in a fading environment. In this work, we focus on the outage performance instead and take into consideration also the time-varying nature of the direct link Outage regions of various schemes are theoretically characterized and their optimal operating conditions are identified, from which the best combined strategies are derived in terms of the maximum goodput and robustness to channel knowledge defects. Interesting new findings together with insightful discussions are provided.
  • Keywords
    binary codes; channel coding; radio networks; time-varying channels; binary network coding; relay channel; superposition coding; time-varying nature; two-way wireless communication; Bidirectional control; Communications Society; Fading; Network coding; Relays; Robustness; Throughput; Transmitters; Wireless communication; Wireless networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications and Networking Conference, 2009. WCNC 2009. IEEE
  • Conference_Location
    Budapest
  • ISSN
    1525-3511
  • Print_ISBN
    978-1-4244-2947-9
  • Electronic_ISBN
    1525-3511
  • Type

    conf

  • DOI
    10.1109/WCNC.2009.4917828
  • Filename
    4917828