Achievable Information Rates on Linear Interference Channels with Discrete Input

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Abstract

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.
Original languageEnglish
Title of host publicationProceedings of 8th Workshop on Information Theoretic Methods in Science and Engineering
Publication date2015
Pages46-49
Publication statusPublished - 2015
EventThe Eighth Workshop on Information Theoretic Methods in Science and Engineering - Copenhagen, Denmark
Duration: 24 Jun 201526 Jun 2015

Conference

ConferenceThe Eighth Workshop on Information Theoretic Methods in Science and Engineering
CountryDenmark
CityCopenhagen
Period24/06/201526/06/2015

Cite this

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)