Header menu link for other important links
X
Optimal multi-antenna transmission with multiple power constraints
Published in Institute of Electrical and Electronics Engineers Inc.
2019
Volume: 18
   
Issue: 7
Pages: 3382 - 3394
Abstract
We determine the capacity-optimal transmission strategy for a multiple-input-multiple-output (MIMO) Gaussian channel under multiple power constraints, namely joint sum power constraint (SPC), per group power constraints (PGPC), and per antenna power constraints (PAPC). First, we focus on cases where we can analytically determine the optimal transmit strategy under joint SPC-PGPC-PAPC. We obtain results for the following cases: 1) nt × 1 multiple-input-single-output (MISO); 2) MIMO channel with full column rank and full rank optimal covariance matrix; and 3) 2 × nr MIMO channel. These results generalize some recent results for the special cases of PAPC only and joint SPC-PAPC. Then, we propose a projected factored gradient descent (PFGD) algorithm for the general MIMO Gaussian channel under joint SPC-PGPC-PAPC including the possibility of additional rank constraints. This algorithm matches the solution of standard convex optimization tools with lower complexity. The algorithm also overcomes the limitations of existing algorithms, in terms of accuracy and applicability to low rank channels. © 2019 IEEE.
About the journal
JournalData powered by TypesetIEEE Transactions on Wireless Communications
PublisherData powered by TypesetInstitute of Electrical and Electronics Engineers Inc.
ISSN15361276
Open AccessNo
Concepts (12)
  •  related image
    Antennas
  •  related image
    Convex optimization
  •  related image
    Covariance matrix
  •  related image
    Gradient methods
  •  related image
    Mimo systems
  •  related image
    Trellis codes
  •  related image
    Capacity
  •  related image
    PER-ANTENNA POWER CONSTRAINTS
  •  related image
    Power constraints
  •  related image
    PROJECTED GRADIENT
  •  related image
    RANK-CONSTRAINED CAPACITY
  •  related image
    Computational complexity