On the MIMO Capacity With Joint Sum and Per-Antenna Power Constraints: A New Efficient Numerical Method

We propose a semi-closed-form solution to the problem of computing the capacity and optimal signaling for a Gaussian MIMO channel under a joint sum power constraint (SPC) and per-antenna power constraint (PAPC). Existing efficient solutions to this fundamental problem are only applicable to some special cases: multiple-input single-output (MISO) systems, or full column rank MIMO channels with sufficiently high transmit power, or full-rank optimal signaling. For the general case, we present an efficient numerical method to solve the considered problem which does not make any assumptions on the rank of the channel matrix or the maximum transmit power. To achieve this, the considered problem is transformed into an equivalent minimax problem. We then exploit the special structure of the minimax problem to derive a closed-form solution based on a concave-convex procedure (CCP)-like algorithm. Extensive simulation results show that our proposed algorithm outperforms the existing solutions in terms of complexity and generality.