The multiway relay channel

Deniz Gunduz, Aylin Yener, Andrea Goldsmith, H. Vincent Poor

    Research output: Contribution to journalArticle

    125 Citations (Scopus)

    Abstract

    The multiuser communication channel, in which multiple users exchange information with the help of a relay terminal, termed the multiway relay channel (mRC), is introduced. In this model, multiple interfering clusters of users communicate simultaneously, such that the users within the same cluster wish to exchange messages among themselves, i.e., each user multicasts its message to all the other users in its own cluster. It is assumed that the users cannot receive each other's signals directly. Hence, the relay terminal in this model is the enabler of communication. In particular, restricted encoders are considered, such that the encoding function of each user depends only on its own message and the received signal is used only for decoding the messages of the other users in the cluster. Achievable rate regions and an outer bound are characterized for the Gaussian mRC, and their comparison is presented in terms of the exchange rate, the symmetric rate point in the capacity region in a symmetric Gaussian mRC scenario. It is shown that the compress-and-forward (CF) protocol achieves exchange rates within a constant bit offset of the optimal exchange rate, independent of the power constraints of the terminals in the network. A finite bit gap between the exchange rates achieved by the CF and the amplify-and-forward protocols is also shown. The two special cases of the mRC, the full data exchange model, in which every user wants to receive messages of all other users, and the pairwise data exchange model which consists of multiple two-way relay channels, are investigated in detail. In particular for the pairwise data exchange model, in addition to the proposed random coding-based achievable schemes, a nested lattice coding-based scheme is also presented and is shown to achieve exchange rates within a constant bit gap of the exchange capacity.

    Original languageEnglish (US)
    Article number6303911
    Pages (from-to)51-63
    Number of pages13
    JournalIEEE Transactions on Information Theory
    Volume59
    Issue number1
    DOIs
    StatePublished - Jan 7 2013

    Fingerprint

    Electronic data interchange
    data exchange
    Decoding
    coding
    communication
    information exchange
    Communication
    scenario

    All Science Journal Classification (ASJC) codes

    • Information Systems
    • Computer Science Applications
    • Library and Information Sciences

    Cite this

    Gunduz, D., Yener, A., Goldsmith, A., & Poor, H. V. (2013). The multiway relay channel. IEEE Transactions on Information Theory, 59(1), 51-63. [6303911]. https://doi.org/10.1109/TIT.2012.2219156
    Gunduz, Deniz ; Yener, Aylin ; Goldsmith, Andrea ; Poor, H. Vincent. / The multiway relay channel. In: IEEE Transactions on Information Theory. 2013 ; Vol. 59, No. 1. pp. 51-63.
    @article{faae483e1b16483ca2eed0c74c5ab417,
    title = "The multiway relay channel",
    abstract = "The multiuser communication channel, in which multiple users exchange information with the help of a relay terminal, termed the multiway relay channel (mRC), is introduced. In this model, multiple interfering clusters of users communicate simultaneously, such that the users within the same cluster wish to exchange messages among themselves, i.e., each user multicasts its message to all the other users in its own cluster. It is assumed that the users cannot receive each other's signals directly. Hence, the relay terminal in this model is the enabler of communication. In particular, restricted encoders are considered, such that the encoding function of each user depends only on its own message and the received signal is used only for decoding the messages of the other users in the cluster. Achievable rate regions and an outer bound are characterized for the Gaussian mRC, and their comparison is presented in terms of the exchange rate, the symmetric rate point in the capacity region in a symmetric Gaussian mRC scenario. It is shown that the compress-and-forward (CF) protocol achieves exchange rates within a constant bit offset of the optimal exchange rate, independent of the power constraints of the terminals in the network. A finite bit gap between the exchange rates achieved by the CF and the amplify-and-forward protocols is also shown. The two special cases of the mRC, the full data exchange model, in which every user wants to receive messages of all other users, and the pairwise data exchange model which consists of multiple two-way relay channels, are investigated in detail. In particular for the pairwise data exchange model, in addition to the proposed random coding-based achievable schemes, a nested lattice coding-based scheme is also presented and is shown to achieve exchange rates within a constant bit gap of the exchange capacity.",
    author = "Deniz Gunduz and Aylin Yener and Andrea Goldsmith and Poor, {H. Vincent}",
    year = "2013",
    month = "1",
    day = "7",
    doi = "10.1109/TIT.2012.2219156",
    language = "English (US)",
    volume = "59",
    pages = "51--63",
    journal = "IEEE Transactions on Information Theory",
    issn = "0018-9448",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "1",

    }

    Gunduz, D, Yener, A, Goldsmith, A & Poor, HV 2013, 'The multiway relay channel', IEEE Transactions on Information Theory, vol. 59, no. 1, 6303911, pp. 51-63. https://doi.org/10.1109/TIT.2012.2219156

    The multiway relay channel. / Gunduz, Deniz; Yener, Aylin; Goldsmith, Andrea; Poor, H. Vincent.

    In: IEEE Transactions on Information Theory, Vol. 59, No. 1, 6303911, 07.01.2013, p. 51-63.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - The multiway relay channel

    AU - Gunduz, Deniz

    AU - Yener, Aylin

    AU - Goldsmith, Andrea

    AU - Poor, H. Vincent

    PY - 2013/1/7

    Y1 - 2013/1/7

    N2 - The multiuser communication channel, in which multiple users exchange information with the help of a relay terminal, termed the multiway relay channel (mRC), is introduced. In this model, multiple interfering clusters of users communicate simultaneously, such that the users within the same cluster wish to exchange messages among themselves, i.e., each user multicasts its message to all the other users in its own cluster. It is assumed that the users cannot receive each other's signals directly. Hence, the relay terminal in this model is the enabler of communication. In particular, restricted encoders are considered, such that the encoding function of each user depends only on its own message and the received signal is used only for decoding the messages of the other users in the cluster. Achievable rate regions and an outer bound are characterized for the Gaussian mRC, and their comparison is presented in terms of the exchange rate, the symmetric rate point in the capacity region in a symmetric Gaussian mRC scenario. It is shown that the compress-and-forward (CF) protocol achieves exchange rates within a constant bit offset of the optimal exchange rate, independent of the power constraints of the terminals in the network. A finite bit gap between the exchange rates achieved by the CF and the amplify-and-forward protocols is also shown. The two special cases of the mRC, the full data exchange model, in which every user wants to receive messages of all other users, and the pairwise data exchange model which consists of multiple two-way relay channels, are investigated in detail. In particular for the pairwise data exchange model, in addition to the proposed random coding-based achievable schemes, a nested lattice coding-based scheme is also presented and is shown to achieve exchange rates within a constant bit gap of the exchange capacity.

    AB - The multiuser communication channel, in which multiple users exchange information with the help of a relay terminal, termed the multiway relay channel (mRC), is introduced. In this model, multiple interfering clusters of users communicate simultaneously, such that the users within the same cluster wish to exchange messages among themselves, i.e., each user multicasts its message to all the other users in its own cluster. It is assumed that the users cannot receive each other's signals directly. Hence, the relay terminal in this model is the enabler of communication. In particular, restricted encoders are considered, such that the encoding function of each user depends only on its own message and the received signal is used only for decoding the messages of the other users in the cluster. Achievable rate regions and an outer bound are characterized for the Gaussian mRC, and their comparison is presented in terms of the exchange rate, the symmetric rate point in the capacity region in a symmetric Gaussian mRC scenario. It is shown that the compress-and-forward (CF) protocol achieves exchange rates within a constant bit offset of the optimal exchange rate, independent of the power constraints of the terminals in the network. A finite bit gap between the exchange rates achieved by the CF and the amplify-and-forward protocols is also shown. The two special cases of the mRC, the full data exchange model, in which every user wants to receive messages of all other users, and the pairwise data exchange model which consists of multiple two-way relay channels, are investigated in detail. In particular for the pairwise data exchange model, in addition to the proposed random coding-based achievable schemes, a nested lattice coding-based scheme is also presented and is shown to achieve exchange rates within a constant bit gap of the exchange capacity.

    UR - http://www.scopus.com/inward/record.url?scp=84871802866&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84871802866&partnerID=8YFLogxK

    U2 - 10.1109/TIT.2012.2219156

    DO - 10.1109/TIT.2012.2219156

    M3 - Article

    VL - 59

    SP - 51

    EP - 63

    JO - IEEE Transactions on Information Theory

    JF - IEEE Transactions on Information Theory

    SN - 0018-9448

    IS - 1

    M1 - 6303911

    ER -