Revisiting the MIMO Capacity With Per-Antenna Power Constraint: Fixed-Point Iteration and Alternating Optimization
|Title:||Revisiting the MIMO Capacity With Per-Antenna Power Constraint: Fixed-Point Iteration and Alternating Optimization||Authors:||Pham, Thuy M.; Farrell, Ronan; Tran, Le-Nam||Permanent link:||http://hdl.handle.net/10197/10683||Date:||16-Nov-2018||Online since:||2019-05-28T13:21:30Z||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 fixed-point 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 multi-user 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.||Funding Details:||European Commission - European Regional Development Fund
Science Foundation Ireland
|Type of material:||Journal Article||Publisher:||IEEE||Journal:||IEEE Transactions on Wireless Communications||Volume:||18||Issue:||1||Start page:||338||End page:||401||Copyright (published version):||2018 IEEE||Keywords:||MIMO; Fixed-point iteration; Alternating optimization; Minimax duality; Water-filling; Dirty paper coding||DOI:||10.1109/twc.2018.2880436||Language:||en||Status of Item:||Peer reviewed|
|Appears in Collections:||Electrical and Electronic Engineering Research Collection|
Show full item record
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.