The Dirty MIMO Multiple-Access Channel
- Creators
- Khina, Anatoly
- Kochman, Yuval
- Erez, Uri
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.
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.Attached Files
Submitted - 1510.08018.pdf
Files
Name | Size | Download all |
---|---|---|
md5:8705f8663117ba473abe86f8f0f5f86c
|
452.2 kB | Preview Download |
Additional details
- Eprint ID
- 79318
- Resolver ID
- CaltechAUTHORS:20170725-080932416
- Feder Family Award
- Tel Aviv University
- Yitzhak and Chaya Weinstein Research Institute for Signal Processing
- Clore Israel Foundation
- 956/12
- Israel Science Foundation
- German-Israeli Foundation for Research and Development
- HUJI Cyber Security Research Center
- 1956/15
- Israel Science Foundation
- Created
-
2017-07-25Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field