{'fraction_non_alphanumeric': 0.04478511179542107, 'fraction_numerical': 0.011915919132413978, 'mean_word_length': 4.176195426195426, 'pattern_counts': {'":': 0, '<': 11, '<?xml version=': 0, '>': 9, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 12, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
MIMO Capacity with Average Total and Per-Antenna Power Constraints

MIMO capacity with a joint total and per-antenna average power constraint is considered in this work. The problem arises when, besides having a limited available power at the transmitter, also the individual antennas cannot radiate power beyond the limits of their corresponding RF chains. Closed-form results are illustrated in specific cases and, in particular, in the unit-rank channel matrix case. Lower-complexity optimization problems are derived for the other cases. Numerical complexity is derived in terms of the number of equivalent real variables for the optimization problem and a general formula is provided depending on the channel matrix rank. Numerical results are included to validate and illustrate the application of the proposed optimization algorithms and also to evaluate the time complexity of its implementation.


I. INTRODUCTION
The capacity of multipe-input multiple-output (MIMO) channels is commonly evaluated under a total average power constraint [1]- [3] in order to account for the limited availability of transmission power to be sent to the transmitting antennas. Under the assumption of known channel matrix at both the transmitter and receiver endpoints, i.e., with perfect Channel State Information at the Transmitter (CSIT) and at the Receiver (CSIR), the capacity is obtained by applying the water-filling algorithm [1] to the equivalent eigen-channels describing the MIMO channel itself. The resulting solution is very simple and elegant and its derivation is quite straightforward after the application of a singular value decomposition (SVD) to the channel matrix itself. The water-filling algorithm implementation is very simple and efficient and it solves completely the optimization problem behind the evaluation of the channel capacity. However, arXiv:1902.01817v1 [cs.IT] 5 Feb 2019 2 some implementations of MIMO transmitters rely on separate RF chains feeding the different transmit antennas so that the average transmit power from every antenna is subject to a specific constraint [4], [5]. Also in he case of distributed MIMO systems, where transmitting antennas are located at different places, power limitations affect different antennas separately and there is no overall power constraint [5]. These scenarios are opposite, for example, to the case of an implementation based on a common amplifier followed by a passive beamforming network.
To summarize, power limitation on a MIMO transmitter can be of two different types: i) total average power (TP) constrained or ii) per-antenna average power (PAP) constrained. We can also figure out a hybrid situation where both constraints have to be enforced (TP and PAP): the individual antenna power amplifiers may trade-off some of their available power or may drain their power supply from a common source [4], [9]. This motivates the study of the MIMO channel capacity under TP and PAP constraints.
The existing literature offers many works on the MIMO channel capacity with TP and/or PAP constraints. One of the earliest results is due to Vu, who developed an iterative algorithm for the PAP-only MIMO case in [5], [6]. Her approach is based on the solution of the KKT equations relevant to the PAP constrained optimization problem addressing the maximization of the MIMO channel's mutual information. The approach is ingenious and relies on the particular structure of the optimizing covariance matrix, which is split into different signature components leading to an efficient iterative algorithm. Nevertheless, the TP constraint is not considered and there is limited discussion of complexity and convergence issues. More recently, in [10], the PAPonly constrained MIMO capacity has also been considered and a closed-form solution for the optimal input covariance matrix has been derived when the channel matrix and the optimal input covariance matrix have full rank. This result was anticipated in [5, eq. (23)] in an equivalent form without giving the explicit conditions required. Finally, Loyka [4] and [8] considered the joint TP and PAP constrained capacity problem in the multiple-input single-output (MISO) case and obtained a closed-form solutions for the capacity-achieving input covariance matrix in this case.
In this work we address the evaluation of the capacity of a MIMO channel with perfect CSIT/CSIR under a joint TP and PAP constraint. The paper extends in a nontrivial way the results of [5] and provides an algorithmic solution for this problem, which is still open for MIMO channels under a joint TP and PAP constraint (see [4]). The contributions of the paper can be summarized as follows.
We emphasize the different type of optimization problems arising when the channel matrix has full rank (equal to the number of transmit antennas) or not. We refer to the former as the full-rank case and to the latter as the singular case. In both cases we show that the capacity-achieving covariance matrix has a specific form depending on a number of real positive parameters not greater than the number of transmit antennas and on the Gramian of the channel matrix. Moreover, we show that in the full-rank case the TP constraint is active at the optimum (i.e., the constraint is met with equality) while it may be inactive in the singular case.
The solution of the KKT equations leading to the main results discussed above is different from [5] for several reasons: i) the Lagrangian function is extended to encompass the TP constraint; ii) we provide a robust justification of the positivity of the diagonal Lagrange multiplier matrix D, corresponding to the set of real positive parameters determining the optimum covariance matrix. 1 iii) we simplify the derivation of the optimality conditions and obtain a specific relationship between the matrix F to the matrix R (matrix notation is consistent with [5]).
The derivation of a specific structure of the capacity-achieving covariance matrix is a key contribution of this work. This reduces dramatically the complexity of the optimization problem. In fact, we are considering the minimization of a strictly convex function (the negative mutual information) over a convex set (intersection of the TP, PAP, and positive semidefiniteness constraints on the input covariance matrix), which corresponds to a convex optimization problem.
As such, its solution is global and unique [11]. Then, any standard optimization algorithm (e.g., interior point) provides the capacity over the variable space corresponding to the input covariance matrix. A general closed-form solution appears to be out of question, except in the case when specific conditions are satisfied, as also evidences in [10] for the PAP-only case. We derive specific conditions for the existence of a closed-form solution in the joint TP and PAP case.
Since we resort to numerical algorithms for the derivation of the channel capacity, a metric of interest is complexity. We note that the proposed algorithm for the full-rank case reduces dramatically complexity because i) the optimization is based on a diagonal matrix determined by n T real parameters instead of the n 2 T real parameters characterizing the input covariance matrix; and ii) positive semidefiniteness of the input covariance matrix is automatically enforced. 1 The argument used in [5] to show that the Lagrange multipliers di are real and positive is incorrect. The paper claims that the positivity of the di's derives from the complementary slackness condition and the fact that the optimum solution corresponds to active constraints (inequalities met as equalities). However, if di ≥ 0, di((Q)ii − Pi) = 0, and (Q)ii = Pi, we cannot be sure that di > 0 because di = 0 is also compatible with all the equations. This property is crucial to the existence ofĎ D −1 .
We also deal extensively with the singular case (when the channel matrix rank is lower than the number of transmit antennas). It is worth mentioning that this case was not addressed in [5] for the PAP-only case though some progress was made in an unpublished work by the same author [7]. The singular case was addressed, only in the MISO case, in [4], [8].
The remainder of the paper is organized as follows. Section II introduces the channel model along with the definition of TP and PAP constraints. A basic form of the general optimization problem based on real variables is reported in (1). Section III derives the equivalent optimization problems in the full-rank and singular cases (Theorems 1 and 2, respectively). Here, full-rank means that the channel matrix rank is equal to the number of transmit antennas and singular corresponds to the opposite condition. Explicit conditions for the existence of a closed-form solution are given in Corollary 1. A general complexity measure defined in terms of the number of equivalent real variables required by the optimization problem is provided in Corollary 2. The rank of the capacity-achieving covariance matrix is shown to be smaller than the channel matrix rank in Corollary 3. Finally, Theorem 3 provides an explicit solution for the joint TP and PAP case applicable to the case of unit rank channel matrix. This theorem extends the results from [4] applicable to the MISO case. Algorithm 1 describes how to solve the optimization problem in this case and obtain the corresponding capacity-achieving input covariance matrix. Section IV provides numerical results to illustrate the capacity evaluation. First, to validate the methods, numerical results are reported to reproduce results from [5] and [4]. Next, a few MIMO scenarios are presented to illustrate the applicability of the optimization proposed, in particular concerning the PAP constraint increase required to attain the water-filling capacity corresponding to the TP-only constraint. Then, complexity evaluation is reported by considering a large number of channel matrix instances and measuring the complexity of the proposed form of the optimization problem (6) against the basic general form 1. Concluding remarks are reported in Section V.

A. Notation
We denote matrices by uppercase boldface letters (e.g., A) and column vectors by lowercase boldface letters (e.g., a). We denote the entry at the ith row and jth column of A as (A) ij .
We denote by a i and A i the ith column and the ith row of the matrix A, respectively, unless otherwise explicitly stated. We denote by 0 m×n an all-zero matrix of dimensions m × n. We denote by I n the n × n identity matrix. Matrix inequalities imply that the matrices involved are Hermitian and follow the standard definitions from [12]: is positive semidefinite. The Frobenius norm of a matrix A is denoted by A (similarly for a vector). Notation diag(a 1 , . . . , a n ) denotes a diagonal matrix whose elements on the main diagonal are a 1 , . . . , a n ; diag(a) denotes a diagonal matrix whose elements on the main diagonal are taken from the vector a; diag(A) denotes a diagonal matrix whose elements are taken from the diagonal elements of the matrix A.

II. CHANNEL MODEL
We consider an n T ×n R MIMO channel with n T transmit and n R receive antennas, characterized by the standard channel equation where H is the n R ×n T channel matrix, x is the transmitted symbol vector, z is the received noise sample vector with joint circularly symmetric complex Gaussian distribution z ∼ CN (0, I n R ), and y is the received signal sample vector.
The channel matrix is assumed to be known exactly at both the transmitter and the receiver endpoints (i.e., we have perfect CSIT/CSIR). Every column of H contains at least one nonzero element and hence has positive norm (otherwise the corresponding transmitted signal would be useless).
In accordance with the previous assumptions, the mutual information corresponding to an input covariance matrix Q is given by [1] I(x; y) = log det(I n R + HQH H ) when x ∼ CN (0, Q), and represents the maximum achievable rate over the MIMO channel under the input covariance constraint.
Hereafter, we consider the joint TP and PAP constrained MIMO channel capacity where P tot characterizes the TP constraint, i.e., the maximum average transmitted power from all the antennas, which is represented by the trace of the input covariance matrix Q. Moreover, P is a diagonal matrix containing the PAP upper bounds to the average power transmitted by every antenna. If P = diag(P 1 , . . . , P n T ), the constraints are given by (Q) ii ≤ P i , i = 1, . . . , n T , individually, or by diag(Q) ≤ P in compact matrix form. We shall assume that because otherwise the TP constraint would be unattainable.
The function log det(I n R + HQH H ) is strictly concave over the convex set of positive semidefinite matrices Q ≥ 0 [1]. Since also the TP and PAP constraints lead to convex sets, the optimization problem is convex and can be solved by solving the KKT equations. Moreover, since the objective function is strictly concave and the optimization problem is convex, its solution is global and unique [11].
Remark 1 Optimization problem (1) can be solved directly by using one of the several optimization algorithms proposed in the literature for nonlinear convex optimization (e.g., interior-point, sequential quadratic programming, active-set optimization algorithms) [14]. Since the matrix Q is Hermitian and may have complex elements, one may consider the following equivalent real optimization problem: A closed-form general solution is out of question in the general MIMO case, whereas it is feasible in the MISO case [4] and in a special full-rank case [5], [10]. Nevertheless, the KKT equations can be used to decrease the complexity of the optimization problem itself by turning it into an equivalent one with a smaller number of unknowns.

III. SOLUTION OF THE OPTIMIZATION PROBLEM
The optimization problem corresponding to the derivation of the MIMO channel capacity under a joint TP and PAP constraint can be written in the following standard form [11]: This optimization problem is convex because of the strict convexity of the objective function − log det(I n R +HQH H ) [1] and of the convexity of the domain (intersection of convex domains).
The solution of the optimization problem (4) depends on the rank of the channel matrix, which can be classified in two different cases.
1) The full-rank case, when the channel matrix rank is equal to the number of transmit antennas.
2) The singular case, when the channel matrix rank is smaller than the number of transmit antennas.
The latter case occurs whenever, though not exclusively, n R < n T , as in the MISO case. Both cases will be addressed in the following sections.
The solution of the optimization problem (4) depends on the rank of the channel matrix H.
In the case of full rank of H it can be characterized by the following theorem.
The capacity-achieving input covariance matrix for a MIMO channel with a joint TP and PAP constraint is given by where K (H H H) 1/2 is the full-rank matrix square root of the Gramian of the channel matrix H andĎ opt is derived by the solution of the optimization problem This optimization problem can be solved by a standard convex optimization algorithm (e.g., interior point). In order to initialize the matrixĎ we notice that, from the proof of Theorem 1 Thus, we can initializeĎ byĎ for some α < 1. The choice of α affects the convergence properties of the iterative algorithm.
As noted in [5], and subsequently in [10], for the PAP-only case, a special case occurs when it is possible to solve in closed form the optimization problem of Theorem 1. With the joint TP and PAP constraints we have the the following result.
Corollary 1 (rank(H) = n T ) The capacity-achieving input covariance matrix for a MIMO channel with joint TP and PAP constraints is where K (H H H) 1/2 , if the following conditions hold: The capacity is Proof: Assume thatĎ > K −2 and maximize det(Ď) by the scaled identity matrix in the proof of Theorem 1.

B. Singular Case (rank(H) < n T )
Here, we consider the case of a channel matrix with rank strictly lower than the number of columns, i.e., the number of transmit antennas n T . The following theorem characterizes the capacity-achieving covariance matrix in the singular case.
Theorem 2 (rank(H) < n T ) The capacity-achieving input covariance matrix for a MIMO channel with joint TP and PAP constraints and channel matrix with rank ν < n T , the number of transmit antennas, is obtained by solving the following optimization problem.
where we used the reduced-size SVD of the channel matrix H = U H Λ H V H H , where Λ H is a ν ×ν positive definite diagonal matrix and U H , V H are n T × ν and n R × ν partial unitary matrices, Proof: See Appendix B Remark 2 Notice that, in the singular case, the TP constraint is not necessarily met with equality because the relative argument used in the case of nonsingular K (deriving from the inequality diag(Q) ≤ P ) fails to hold in this case where the PAP constraints implies that diag(V +Q+ V H + ) ≤ P . This has a major impact on the capacity, which can be substantially lower in this case because meeting the PAP constraints prevents to exploit the total available power according to the TP constraint.
Corollary 2 (Complexity) The complexity of the equivalent optimization problem derived in Ths. 1 and 2, in terms of cardinality of the variable space, is given by Proof: See Appendix B.
Remark 3 It is interesting to notice that the worst-case complexity of the optimization algorithm corresponds to the case of rank ν = n T /2 or the closest integer. Compared to the fixed complexity of the basic form of the optimization problem (3), the complexity of the optimization algorithm in the full-rank case is n T times lower. When ν = n T /2, the complexity is still reduced by a factor 2 and when ν = 1, the reduction is by a factor n T /3, approximately. However, in this last case, the use of Algorithm 1 from Appendix C dramatically reduces complexity and provides an exact result without the need of numerical algorithms like interior-point.

Corollary 3 (Rank)
The capacity-achieving input covariance matrix Q for a MIMO channel with joint TP and PAP constraints and channel matrix with rank ν < n T satisfies the following inequalities: Proof: See Appendix B.

C. Unit-Rank Singular Case
In this section we consider a MIMO channel with channel matrix having unit rank, i.e., ν = 1.
The MISO channel is a special case where ν = n R = 1. More generally, a unit-rank MIMO channel has a channel matrix which can be expressed as where u, v are unit-norm column vectors.
The special MISO case has been dealt with in the literature (see, in particular, [4], [8]) where closed-form expressions have been proposed. Our approach extends these results and our findings are summarized in the following theorem. where u = v = 1, the channel capacity with joint TP and PAP constraints is given by where v i , q i are the ith elements of the vectors v, q, respectively, for i = 1, . . . , n T , and the vector q is obtained by setting where α is obtained by solving the equation The unit-rank capacity-achieving covariance matrix is and the TP constraint is always attained with equality.
Proof: See Appendix C. The appendix reports an algorithm for the solution of (15), Algorithm 1.  [4], [8]. It is also closely related to the algorithm used to solve the water-filling equation.

IV. NUMERICAL RESULTS
In this section we report some numerical results obtained by applying the proposed optimization algorithm implemented in Matlab. (26)] in the following cases: PAP: PAP constraint with P 1 from the abscissa and P 2 = 1 − P 1 ;

A. Validation
TP: TP constraint with P tot = 1 (water-filling solution); MC: Q = diag(P 1 , 1 − P 1 ). It can be seen that the curves coincide exactly with those reported in [5].

Figs. 2-3 validate the results from Algorithm 1 against those of [4, Figs.1-2]. The former
reports the capacity versus the TP constraint P tot and the latter reports the n T = 4 normalized amplitudes [(Q) ii /P * ] 1/2 for i = 1, . . . , n T of the capacity-achieving covariance matrix after defining P * min(P tot , tr(P )). It can be seen that the curves coincide exactly with those reported in [4].

B. Applications
Next, we illustrate the application of the algorithms proposed in Theorem 1 and 2 by considering the 3 × 4 and 3 × 2 channel matrices obtained in Matlab by the following commands: • rng(1);H1=randn(4,3)+1i * randn(4,3); • rng(1);H2=randn(2,3)+1i * randn(2,3); The matrices obtained are given in eqs. (17) and (18). H 1 corresponds to an instance of full-rank MIMO since rank(H 1 ) = n T = 3 and H 1 corresponds to an instance of singular MIMO since rank(H 1 ) = 2 < n T = 3. In both cases we assume P = diag(0.1, 0.1, 1) and plot the capacity with respect to P tot . The results obtained are illustrated in Fig. 4. We can see that the rank of the capacity-achieving covariance matrices increases with the TP constraint up to the maximum predicted by Corollary 3. Also, the capacity with the joint constraint saturates when the TP constraint exceeds the sum of the PAP constraints, which is equal to 1.2 in this example.
Another illustration of the joint TP and PAP constrained capacity calculation is given in Fig.   5. The figure considers a 3 × 3 and a 4 × 4 MIMO channel with channel matrices given in (19) and (20), respectively. The TP constraint is P tot = 3 and 4, respectively, and the PAP constraint is in the abscissa, constant for every antenna. It can be seen that equal power allocation achieves a lower capacity than variable power allocation based on water-filling and the TP constraint, as expected. Increasing the PAP constraint increases the capacity up to the water-filling limit imposed by the TP constraint, as illustrated by the curves of Fig. 5. Similarly, Figs. 6 and 7 illustrate the same scenario with TP constraint reduced by a factor 10 and 100, respectively. The figures show that, as the TP constraint decreases, the PAP constraint must increase more and more in order to achieve the maximum capacity corresponding to a TP-only constrained system. This is a consequence of the fact that the water-filling power distribution increases its dynamic  range as the TP constraint decreases.

C. Complexity
The time complexity of numerical optimization is illustrated in Fig. 8. that the variable space is n T -dimensional. The basic optimization algorithm based on problem (1) is far more expensive in terms of cpu-time complexity. The simulation results show a more than cubic growth with n T , more than the increased dimension of the variable space, which is n 2 T in this case. This excessive growth can be partly explained by noting that the basic algorithm requires a positive definiteness test in the constraint equations, whose complexity is cubic in the matrix size. Needless to say, the analytic complexity evaluation of optimization algorithms is a hard topic and we limit ourselves to make a comparison based on simulation results. In the unit-rank case, Algorithm 1 attains the minimum time complexity, several orders of magnitude lower than the complexity of solving the optimization problems (1) and (10).

V. CONCLUSIONS
In this work we addressed the derivation of the capacity of a MIMO channel under joint total and per-antenna average power constraints. We have considered separately the full-rank and singular cases, which consist, respectively, of having the channel matrix rank equal to or lower than the number of transmit antennas.
Closed-form results have been provided in a special full-rank case (Corollary 1) and for the general unit-rank MIMO case (Theorem 3). The unit-rank case is supported by an iterative algorithm similar to the water-filling algorithm leading to the unit-rank capacity achieving covariance matrix (Algorithm 1).
When the channel rank is greater than one, numerical optimization seems to be the only way to find the channel capacity. Then, we focused on the complexity of numerical optimization, identified by the number of equivaent real variables in the optimization problem. First, we noticed that the general case can be always solved by an optimization problem depending on n 2 T real variables, i.e., problem (1). Then, we derived equivalent optimization problems with a smaller number of equivalent real parameters for the full-rank case (Theorem 1) and for the singular The KKT equations can be written as follows: The diagonal matrix λI n T + Λ is positive definite since The inequalities depend on the fact that M ≥ 0 (hence (M ) ii ≥ 0) and that I n R + HQH H > 0 (since Q ≥ 0). The last inequality holds unless h i = 0, which would imply no signal transmission from the i-th antenna. Next, we define the diagonal matrix From the KKT equations (21) we get the following equations: Now, the constraint (23-d) must be met with equality. Assume, on the contrary, that the optimum covariance matrix Q opt satisfies the inequality tr(Q opt ) < P tot . Then, we consider a covariance matrix Q(α) defined by It is plain to see that Q(α) ≥ 0. Moreover, Q(0) ≡ Q opt and Q(1) > Q opt since at least for (2)). Next, we define We can see that τ (α) is a continuous monotonically increasing real function of α for α ≥ 0.
Moreover, τ (0) = tr(Q opt ) < P tot by assumption, and by inequality (2). Hence, there existsα ∈ (0, 1) such that τ (α) = P tot and Q(α) > Q opt satisfying the total power constraint with equality and attaining a greater mutual information log det(I n R + HQ(α)H H ) > log det(I n R + HQ opt H H ), contrary to the assumed optimality of As a consequence, the optimization problem to be solved to find the capacity is given by: where (Q) ii < P i for at least one index i ∈ {1, . . . , n T }.
The matrices K, F , R are Hermitian, K, F are positive definite and Q ≥ 0. Since we have from [12, Th.1.3.12] that F , R are simultaneously unitarily diagonalizable, i.e., for some unitary matrix U and diagonal matrices Λ F , Λ R . Thus, we can rewrite (25-c) as Given Λ F we can see that Λ R = (Λ F − I n T ) + . In fact, since Λ F and Λ R are diagonal matrices, we can consider any given diagonal position where the scalar equation is Since Q ≥ 0 andĎ > 0, λ R ≥ 0 and λ F ≥ 0. If λ F > 1, the equation has two possible solutions: λ R = 0 or λ R = λ F − 1. Since our goal is maximizing the mutual information, we choose the latter. Otherwise, if λ F ≤ 1, λ R = 0 is the only possible solution. Therefore, our chosen solution is λ R = (λ F − 1) + . The extension to the matrix solution is direct.
Since K is nonsingular, we have which proves eq. (5) of the Theorem and leads to the optimization problem (6).

APPENDIX B PROOF OF THEOREM 2
Proof: A preliminary part of this proof is equivalent to that of Theorem 1 but the sequel is different because in this case the rank of H is smaller than n T and hence H H H is singular.
As in the proof of Theorem 6, we obtain the equivalent optimization problem (24). Then, we have the following equivalent expression of (24-a): with a different definition of the matrices F , R: From the same arguments used after (26), we can see that Λ R = (Λ F − I ν ) + . Then, from the reduced-size SVD H = U H Λ H V H H , we obtain, for a given matrixĎ, The proof of the Theorem follows.
As far as concerns the rank of the capacity-achieving covariance matrix Q, we recall two of the KKT equations (21): Thus, we have Λ M Λ Q = 0 and then inequality (32) implies that Obviously, rank(Q) ≥ 1 otherwise Q would be the all-zero matrix. This proves (12) of Corollary

3.
Additionally, we note that the covariance matrix Q is not determined only byĎ, which is specified by ν real parameters (the diagonal entries). Since the capacity-achieving Q has rank not greater than ν it can be specified by (2n T − ν)ν real parameters. Conditions (30) correspond to ν 2 independent real equations so that the number of real variables in this optimization problem is given by n T + (2n T − ν)ν − ν 2 = 2(n T − ν)ν + n T , which proves (11) in Corollary 2. Then, from Corollary 3, the capacity-achieving covariance matrix has unit rank and we set Q = qq H .
Then, we notice that log det(I n R + HQH H ) = log det(I n R + H 2 uv H Qvu H ) = log(1 + H 2 |v H q| 2 ). Since where v i (v) i , q i (q) i , δ i ∠q i − ∠v i , we can see that The maximum is attained when δ i is any constant so that we can set δ i = 0. This implies that the maximum value of |v H q| is attained when ∠q i = ∠v i .
Once we found the phases of the q i we need the absolute values w i |q i |, which can be found by considering the optimization problem w i − P i ≤ 0, i = 1, . . . , n T (33-c) The corresponding Lagrangian function is The corresponding KKT equations are −|v i | − λ i + µ i + 2λw i = 0 i = 1, . . . , n T (34-a) 0 ≤ w i ≤ P i i = 1, . . . , n T (34-b) λ ≥ 0, λ i , µ i ≥ 0 i = 1, . . . , n T (34-f) From (34-a) we get The case λ = 0 implies that the solution of (34-a) is undefined so that it must be discarded. As a consequence, from (34-e), the TP constraint (34-d) must be attained with equality. Next, we can see from (34-a) that w i = 0 is not possible since |v i | > 0, λ i ≥ 0, µ i = 0.
If w i < √ P i , then If w i = √ P i , then These conditions can be summarized by setting Defining the unknown α 1/(2λ) 2 , we have w 2 i = min(α i |v i | 2 , P i ) and get equation (15). The lhs of this equation is a monotonically nondecreasing function of α, which is equal to 0 when α = 0 and is equal to n T i=1 P i when α → ∞. Thus, we have a single solution for α, which can be found by Algorithm 1, which is based on rewriting (15) in the equivalent form n T i=1 min(α, ρ π(i) )|v π(i) | 2 = P tot where ρ i P i /|v i | 2 and π is the permutation of the set {1, . . . , n T } such that ρ π(i) ≤ ρ π(i+1) for i = 1, . . . , n T − 1. The solution is based on successive trials based on the assumption that α ≤ ρ π(i) for i = 1, . . . , n T .