Approximating the constellation constrained capacity of the MIMO channel with discrete input

Metodi Plamenov Yankov, Søren Forchhammer, Knud J. Larsen, Lars P. B. Christensen

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

    707 Downloads (Pure)

    Abstract

    In this paper the capacity of a Multiple Input Multiple Output (MIMO) channel is considered, subject to average power constraint, for multi-dimensional discrete input, in the case when no channel state information is available at the transmitter. We prove that when the constellation size grows, the QAM constrained capacity converges to Gaussian capacity, directly extending the AWGN result from [1]. Simulations show that for a given constellation size, a rate close to the Gaussian capacity can be achieved up to a certain SNR point, which can be found efficiently by optimizing the constellation for the equivalent orthogonal channel, obtained by the singular value decomposition. Furthermore, lower bounds on the constrained capacity are derived for the cases of square and tall MIMO matrix, by optimizing the constellation for the equivalent channel, obtained by QR decomposition.
    Original languageEnglish
    Title of host publicationProceedings of IEEE International Conference on Communicaitons
    PublisherIEEE
    Publication date2015
    Pages4018-4023
    ISBN (Print)978-1-4673-6432-4
    DOIs
    Publication statusPublished - 2015
    Event2015 IEEE International Conference on Communications - London, United Kingdom
    Duration: 8 Jun 201512 Jun 2015
    https://ieeexplore.ieee.org/xpl/conhome/7225357/proceeding

    Conference

    Conference2015 IEEE International Conference on Communications
    Country/TerritoryUnited Kingdom
    CityLondon
    Period08/06/201512/06/2015
    Internet address

    Fingerprint

    Dive into the research topics of 'Approximating the constellation constrained capacity of the MIMO channel with discrete input'. Together they form a unique fingerprint.

    Cite this