CaltechAUTHORS
  A Caltech Library Service

The Dirty MIMO Multiple-Access Channel

Khina, Anatoly and Kochman, Yuval and Erez, Uri (2017) The Dirty MIMO Multiple-Access Channel. IEEE Transactions on Information Theory, 63 (9). pp. 6031-6040. ISSN 0018-9448. https://resolver.caltech.edu/CaltechAUTHORS:20170725-080932416

[img] PDF - Submitted Version
See Usage Policy.

441Kb

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

Abstract

In the scalar dirty multiple-access channel, in addition to Gaussian noise, two additive interference signals are present, each known non-causally to a single transmitter. It was shown by Philosof et al.. that for strong interferences, an i.i.d. ensemble of codes does not achieve the capacity region. Rather, a structured-codes approach was presented, that was shown to be optimal in the limit of high signal-to-noise ratios, where the sum-capacity is dictated by the minimal (“bottleneck”) channel gain. In the present work, we consider the multipleinput multiple-output (MIMO) variant of this setting. In order to incorporate structured codes in this case, one can utilize matrix decompositions, which transform the channel into effective parallel scalar dirty multiple-access channels. This approach however suffers from a “bottleneck” effect for each effective scalar channel and therefore the achievable rates strongly depend on the chosen decomposition. It is shown that a recently proposed decomposition, where the diagonals of the effective channel matrices are equal up to a scaling factor, is optimal at high signal-to-noise ratios, under an equal rank assumption. This approach is then extended to any number of transmitters. Finally, an application to physical-layer network coding for the MIMO two-way relay channel is presented.


Item Type:Article
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/TIT.2017.2698443DOIArticle
http://ieeexplore.ieee.org/document/7913617/PublisherArticle
https://arxiv.org/abs/1510.08018arXivDiscussion Paper
http://resolver.caltech.edu/CaltechAUTHORS:20160823-160229741Related ItemConference Paper
ORCID:
AuthorORCID
Khina, Anatoly0000-0003-2359-1678
Additional Information:© 2017 IEEE. March 10, 2017. Date of publication April 27, 2017; date of current version August 16, 2017. Manuscript received October 25, 2015; revised January 9, 2017; accepted March 10, 2017. Date of publication April 27, 2017; date of current version August 16, 2017. A. Khina was supported in part by the Feder Family Award, in part by the Trotsky Foundation at Tel Aviv University, in part by the Yitzhak and Chaya Weinstein Research Institute for Signal Processing, and in part by the Clore Israel Foundation. Y. Kochman was supported in part by the Israeli Science Foundation under Grant #956/12, in part by the German–Israeli Foundation for Scientific Research and Development, and in part by the HUJI Cyber Security Research Center in conjunction with the Israel National Cyber Bureau in the Prime Minister’s Office. U. Erez was supported by the ISF under Grant 1956/15. This paper was presented in part at the 2011 IEEE International Symposium of Information Theory and at the 2016 IEEE International Symposium of Information Theory.
Funders:
Funding AgencyGrant Number
Feder Family AwardUNSPECIFIED
Tel Aviv UniversityUNSPECIFIED
Yitzhak and Chaya Weinstein Research Institute for Signal ProcessingUNSPECIFIED
Clore Israel FoundationUNSPECIFIED
Israel Science Foundation956/12
German-Israeli Foundation for Research and DevelopmentUNSPECIFIED
HUJI Cyber Security Research CenterUNSPECIFIED
Israel Science Foundation1956/15
Subject Keywords:Multiple-access channel, dirty-paper coding, multiple-input multiple-output channel, matrix decomposition, physical-layer network coding, two-way relay channel
Issue or Number:9
Record Number:CaltechAUTHORS:20170725-080932416
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20170725-080932416
Official Citation:A. Khina, Y. Kochman and U. Erez, "The Dirty MIMO Multiple-Access Channel," in IEEE Transactions on Information Theory, vol. 63, no. 9, pp. 6031-6040, Sept. 2017. doi: 10.1109/TIT.2017.2698443 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7913617&isnumber=8011574
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:79318
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:25 Jul 2017 16:28
Last Modified:03 Oct 2019 18:18

Repository Staff Only: item control page