CaltechAUTHORS
  A Caltech Library Service

Divide-and-Conquer: Approaching the Capacity of the Two-Pair Bidirectional Gaussian Relay Network

Sezgin, Aydin and Avestimehr, A. Salman and Khajehnejad, M. Amin and Hassibi, Babak (2012) Divide-and-Conquer: Approaching the Capacity of the Two-Pair Bidirectional Gaussian Relay Network. IEEE Transactions on Information Theory, 58 (4). pp. 2434-2454. ISSN 0018-9448. https://resolver.caltech.edu/CaltechAUTHORS:20120502-151314658

[img] PDF - Submitted Version
See Usage Policy.

508Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20120502-151314658

Abstract

The capacity region of multi-pair bidirectional relay networks, in which a relay node facilitates the communication between multiple pairs of users, is studied. This problem is first examined in the context of the linear shift deterministic channel model. The capacity region of this network when the relay is operating at either full-duplex mode or half-duplex mode for arbitrary number of pairs is characterized. It is shown that the cut-set upper-bound is tight and the capacity region is achieved by a so called divide-and- conquer relaying strategy. The insights gained from the deterministic network are then used for the Gaussian bidirectional relay network. The strategy in the deterministic channel translates to a specific superposition of lattice codes and random Gaussian codes at the source nodes and successive interference cancelation at the receiving nodes for the Gaussian network. The achievable rate of this scheme with two pairs is analyzed and it is shown that for all channel gains it achieves to within 3 bits/sec/Hz per user of the cut-set upper-bound. Hence, the capacity region of the two-pair bidirectional Gaussian relay network to within 3 bits/sec/Hz per user is characterized.


Item Type:Article
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/TIT.2011.2177773 DOIArticle
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6169200PublisherArticle
http://arxiv.org/abs/1001.4271v3arXivDiscussion Paper
Additional Information:© 2012 IEEE. Manuscript received January 18, 2010; revised April 05, 2011; accepted September 12, 2011. Date of current version March 13, 2012. The work of A. Sezgin was supported by the DFG under Grant 1697/3. The work of A. S. Avestimehr was supported in part by the NSF CAREER Award 0953117. This paper was presented in part at the 2009 IEEE Information Theory Workshop and the 2009 IEEE International Symposium on Information Theory. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Suhas Diggavi.
Funders:
Funding AgencyGrant Number
Deutsche Forschungsgemeinschaft (DFG)1697/3
NSF CAREER0953117
Subject Keywords:Bidirectional communication; capacity region; deterministic approach; multi-pair relay network; two-way
Other Numbering System:
Other Numbering System NameOther Numbering System ID
INSPEC Accession Number12592406
Issue or Number:4
Record Number:CaltechAUTHORS:20120502-151314658
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20120502-151314658
Official Citation:Sezgin, A.; Avestimehr, A.S.; Khajehnejad, M.A.; Hassibi, B.; , "Divide-and-Conquer: Approaching the Capacity of the Two-Pair Bidirectional Gaussian Relay Network," Information Theory, IEEE Transactions on , vol.58, no.4, pp.2434-2454, April 2012 doi: 10.1109/TIT.2011.2177773 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6169200&isnumber=6169172
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:31282
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:02 May 2012 22:57
Last Modified:03 Oct 2019 03:50

Repository Staff Only: item control page