MURAL - Maynooth University Research Archive Library



    Revisiting the MIMO Capacity with Per-antenna Power Constraint: Fixed-point Iteration and Alternating Optimization


    Pham, Thuy M. and Farrell, Ronan and Tran, Le-Nam (2018) Revisiting the MIMO Capacity with Per-antenna Power Constraint: Fixed-point Iteration and Alternating Optimization. IEEE Transactions on Wireless Communications, 18 (1). pp. 338-401. ISSN 1536-1276

    [img]
    Preview
    Download (344kB) | Preview


    Share your research

    Twitter Facebook LinkedIn GooglePlus Email more...



    Add this article to your Mendeley library


    Abstract

    In this paper, we revisit the fundamental problem of computing MIMO capacity under per-antenna power constraint (PAPC). Unlike the sum power constraint counterpart which likely admits water-filling-like solutions, MIMO capacity with PAPC has been largely studied under the framework of generic convex optimization. The two main shortcomings of these approaches are (i) their complexity scales quickly with the problem size, which is not appealing for large-scale antenna systems, and/or (ii) their convergence properties are sensitive to the problem data. As a starting point, we first consider a single user MIMO scenario and propose two provably-convergent iterative algorithms to find its capacity, the first method based on fixedpoint iteration and the other based on alternating optimization and minimax duality. In particular, the two proposed methods can leverage the water-filling algorithm in each iteration and converge faster, compared to current methods. We then extend the proposed solutions to multiuser MIMO systems with dirty paper coding (DPC) based transmission strategies. In this regard, capacity regions of Gaussian broadcast channels with PAPC are also computed using closed-form expressions. Numerical results are provided to demonstrate the outperformance of the proposed solutions over existing approaches.

    Item Type: Article
    Keywords: MIMO; fixed-point iteration; alternating optimization; minimax duality; water-filling; dirty paper coding;
    Academic Unit: Faculty of Science and Engineering > Electronic Engineering
    Item ID: 13073
    Identification Number: https://doi.org/10.1109/twc.2018.2880436
    Depositing User: Ronan Farrell
    Date Deposited: 19 Jun 2020 15:02
    Journal or Publication Title: IEEE Transactions on Wireless Communications
    Publisher: IEEE
    Refereed: Yes
    URI:
    Use Licence: This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

    Repository Staff Only(login required)

    View Item Item control page

    Downloads

    Downloads per month over past year

    Origin of downloads