• DocumentCode
    2044895
  • Title

    Joint user decoding: A technique to enhance the benefits of coding in a multi-way relay channel

  • Author

    Islam, Shama N. ; Sadeghi, Parastoo

  • Author_Institution
    Res. Sch. of Eng., Australian Nat. Univ. (ANU), Canberra, ACT, Australia
  • fYear
    2012
  • fDate
    12-14 Dec. 2012
  • Firstpage
    1
  • Lastpage
    7
  • Abstract
    In this paper, a comparative analysis between joint and disjoint user decoding of the network and channel coded symbols in a multi-way relay channel is presented. The joint user decoding mechanism implements belief propagation algorithm to utilize the correlation between adjacent network coded symbols of user pairs, whereas, disjoint decoding disregards this correlation. This feature enables joint user decoding to support larger number of users than disjoint decoding in synchronous and asynchronous, additive white Gaussian noise and fading channels. Even, this novel mechanism allows almost the same level of average bit error rate performance for small and large number of users in asynchronous fading channel. Thus, to maximize the benefits of channel coding in practical propagation environments, joint user decoding in the relay node is essential.
  • Keywords
    AWGN channels; belief networks; decoding; error statistics; fading channels; additive white Gaussian noise channels; asynchronous disjoint decoding; asynchronous fading channel; belief propagation algorithm; bit error rate performance; channel coded symbols; disjoint user decoding; joint user decoding; joint user decoding mechanism; multiway relay channel; network coded symbols; practical propagation environments; relay node; synchronous disjoint decoding; Belief propagation (BP); error propagation; joint decoding; multi-way relaying; repeat accumulate (RA) code;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing and Communication Systems (ICSPCS), 2012 6th International Conference on
  • Conference_Location
    Gold Coast, QLD
  • Print_ISBN
    978-1-4673-2392-5
  • Electronic_ISBN
    978-1-4673-2391-8
  • Type

    conf

  • DOI
    10.1109/ICSPCS.2012.6507958
  • Filename
    6507958