In this paper lower bound on the capacity of multi-dimensional linear interference channels is derived, when the input is taken from a finite size alphabet. The bounds are based on the QR decomposition of the channel matrix, and hold for any input distribution that is independent across dimensions. Calculation of the bounds can be performed on a per-dimensions basis via look-up tables of the information rates of 1D channels.
|Title of host publication||Proceedings of 8th Workshop on Information Theoretic Methods in Science and Engineering|
|Publication status||Published - 2015|
|Event||The Eighth Workshop on Information Theoretic Methods in Science and Engineering - Copenhagen, Denmark|
Duration: 24 Jun 2015 → 26 Jun 2015
|Conference||The Eighth Workshop on Information Theoretic Methods in Science and Engineering|
|Period||24/06/2015 → 26/06/2015|
Yankov, M. P., & Forchhammer, S. (2015). Achievable Information Rates on Linear Interference Channels with Discrete Input. In Proceedings of 8th Workshop on Information Theoretic Methods in Science and Engineering (pp. 46-49)