On the Exact and Approximate Eigenvalue Distribution for Sum of Wishart Matrices

# On the Exact and Approximate Eigenvalue Distribution for Sum of Wishart Matrices

Santosh Kumar, Gabriel Fernando Pivaro, Gustavo Fraidenraich, and Claudio Ferreira Dias Santosh Kumar is with the Department of Physics, Shiv Nadar University, India. G. F. Pivaro, G. Fraidenraich, and C. F. Dias are with the Department of Communications, State University of Campinas (Unicamp), Brazil.
###### Abstract

The sum of Wishart matrices has an important role in multiuser communication employing multiantenna elements, such as multiple-input multiple-output (MIMO) multiple access channel (MAC), MIMO Relay channel, and other multiuser channels where the mathematical model is best described using random matrices.

In this paper, the distribution of linear combination of complex Wishart distributed matrices has been studied. We present a new closed form expression for the marginal distribution of the eigenvalues of a weighted sum of complex central Wishart matrices having covariance matrices proportional to the identity matrix. The expression is general and allows for any set of linear coefficients.

As an application example, we have used the marginal distribution expression to obtain the ergodic sum-rate capacity for the MIMO-MAC network, and the cut-set upper bound for the MIMO-Relay case, both as closed form expressions.

We also present a very simple expression to approximate the sum of Wishart matrices by one equivalent Wishart matrix. All of our results are validated by means of Monte Carlo simulations. As expected, the agreement between the exact eigenvalue distribution and simulations is perfect, whereas for the approximate solution the difference is indistinguishable.

Sum of Wishart matrices, eigenvalue distribution, multiple-input multiple-output, ergodic sum capacity, Meijer-G function.

## I Introduction

### I-a Random matrices and MIMO single-user relation

Random matrix theory has evolved into a truly multidisciplinary subject with its applications in fields as varied as communication theory, quantum transport, quantum chromodynamics, quantum information theory, string theory, econophysics, number theory, etc. [1]. It is possible to represent the operators relevant to study physical systems in matrix form and use its properties to tackle difficult problems. Communication theory is one of the prominent areas on which random matrix theory has had huge impact. Random matrices gained special attention in wireless communication field after the works of Winters[2], Foschini[3], and Telatar[4]. They have shown that the use of multiple antennas could enhance capacity in systems with limited bandwidth. In all cases, mathematical tools for matrices were employed for the analysis.

In Telatar’s paper [4], the multiple-input multiple-output (MIMO) point-to-point ergodic channel capacity has been found. He has shown that instead of dealing with the joint probability density function of a Wishart distributed matrix [5], which is not easy to handle even for small dimensions, it suffices to use the joint eigenvalue probability density function given by James [6]. Such a simplification is possible in view of the unitarily-invariant nature of the channel capacity and other metrics which are usually employed to characterize the MIMO systems. Telatar’s pioneering work was the first one to establish a connection between MIMO communication and random matrix theory. Since then, there has been a great deal of interest in exploring and comprehending the properties of Wishart matrices.

As a special case of Hermitian matrices, Wishart matrices arise in scenarios where MIMO systems are subject to Rician or Rayleigh fading. As indicated above, the performance of MIMO systems can be statistically predicted with the aid of eigenvalues distribution of Wishart matrices [4], [7]. For example, the channel matrix in a MIMO system relates to a Wishart matrix, whose eigenvalue statistics then leads to the knowledge of the ergodic capacity of the MIMO channel [4]. On the other hand, the distribution of the largest and smallest eigenvalue can be used to analyze the performance of MIMO maximal ratio combining systems and MIMO antenna selection techniques, respectively [7]. In [8], the authors have shown that the symbol error rate (SER) performance of MIMO systems employing multichannel beamforming in arbitrary-rank Ricean channels is dominated by the subchannel SER corresponding to the minimum channel singular value. Their results are based on marginal ordered eigenvalue distributions of complex noncentral Wishart matrices. Since in the slow fading scenario it is not feasible to determine the ergodic capacity, a metric denominated outage probability is required to evaluate the system performance [9]. The outage probability is related to the cumulative eigenvalue distribution function of a Wishart matrix [4], [8], [10]. Due to physical nature of wireless channel and all possible arrangements for antennas arrays, different types of Wishart matrices have been studied, such as central and noncentral, associated with Rayleigh and Rician fading, respectively; uncorrelated, semi-correlated, and double-correlated, associated with the antenna correlation at the transmitter side and at the receiver side [11], [12].

### I-B Extension for MIMO multiuser case

All the works previously mentioned are concerned with the MIMO single-user channel where the majority of the problems are already solved or at least well understood [13]. However, for the MIMO multiuser scenario there exists many open problems, such as the general capacity for the MIMO Relay channel.

In a wireless multiuser channel, we are generally more concerned in the overall information rate (capacity) of the system than the individual user rates as in the single user channel [14, Ch. 15]. In this way, we could define metrics associated with the joint users performance. We have, for example, symmetric capacity and sum capacity. The former is the maximum common rate at which both users can simultaneously reliably communicate; the latter is the maximum total throughput that can be achieved [9, pg. 230] and can be seen as a constraint that limits the individual rates of each user. Since sum capacity reflects an overall system performance, this metric is of great interest from analytical and practical points of view.

As can be inferred from the sum capacity name, to evaluate this metric we have to add up the rates of each user. This operation leads to a summation of Wishart matrices associated with each one of the MIMO channels involved in the multiuser system. For example, this situation occurs in two well-known multiuser channels: (i) MIMO multiple access channel (MAC), where users with multiple transmit antennas communicate with one destination also with multiple receiving antennas [15]; and (ii) MIMO Relay channel, where a MIMO transmitter communicates with a MIMO receiver with the help of a MIMO relay [16]. For MIMO MAC the sum capacity is a desired metric on performance [13]. For MIMO Relay, the sum capacity is used to determine the cut-set upper bound on the channel capacity [16].

### I-C On the Paper Contribution

Based on our discussion in the preceding section about the sum capacity, hereinafter, we will analyze this metric under fast-fading Rayleigh distribution. Therefore, our aim is to determine the ergodic sum capacity for MIMO multiuser scenario. Our idea is to use the framework identical to that of a single-user case. It means that we wish to obtain the ergodic sum capacity using the marginal eigenvalue distribution of the sum of Wishart matrices.

For a single-user case, the probability density function of the eigenvalues of a Wishart matrix was given in [6], and since then many advances have been achieved for the most variate cases of Wishart distributions. More recently, results on the product of rectangular random matrices have appeared in [17] and [18] and the authors have investigated ergodic mutual information in MIMO communication channel with multifold scattering. By contrast, the progress for the eigenvalues distribution of the sum of Wishart matrices has not been going at the same pace.

Although the most well-known result for the sum of Wishart matrices dates back to 1960’s, it is valid only for the specific case where all matrices have the same covariance matrix [19]; not much is known for the general case of arbitrary covariance matrices. In [20], the authors have considered linear combination of central Wishart matrices with positive coefficients. They have proposed approximating the distributions of the linear combination by central Wishart distributions. Furthermore, in the context of multivariate Behrens-Fisher problem, a similar approximation to solve the linear sum of Wishart matrices has been given in [21]. Therein the authors have approximated the sum by a single Wishart distribution by determining the associated degree of freedom and the parameter matrix. A very recent work in this direction is by one of the present authors, where exact matrix distribution has been computed for the sum of two Wishart matrices with arbitrary covariance matrices [22]. Moreover, explicit result for the eigenvalue statistics has been worked out for the case when one of the Wishart matrices possesses covariance matrix proportional to the identity matrix. In the present work we are concerned with the eigenvalue statistics for the sum of arbitrary number of central Wishart matrices with covariance matrices proportional to the identity matrix.

For the MIMO MAC channel, the ergodic sum rate capacity has never been obtained due to the lack of analytical results for the joint eigenvalue probability density function of sum of Wishart matrices. However, the capacity with perfect channel state information at receiver and transmitter (CSITR) sides is very well studied. With perfect CSIT and CSIR the system can be viewed as a set of parallel non interfering MIMO MACs. Thus, the ergodic capacity region can be obtained as an average of these parallel MIMO MAC capacity regions (see [13] and the references therein). Another approach is to obtain asymptotic results on the sum ergodic capacity of MIMO MAC channels. This can be done by considering that the number of receive antennas and the number of transmitters tend to infinity [13].

In order to solve these and related challenging problems, we have proposed two distinct approaches that are presented in Section III. The first approach is the derivation of an exact closed-form expression for the marginal eigenvalue distribution of the sum of Wishart matrices. The main idea behind this solution is to demonstrate that the matrix resulting from the weighted sum of Wishart matrices can be rewritten as the product of a single matrix and its conjugate transpose. This resulting Wishart matrix happens to correspond to a covariance matrix which incorporates the information about the weights. Therefore, its eigenvalue distribution follows from the pre-existing knowledge about Wishart semicorrelated matrices. The derivation of this result is given in Appendices A and B. Our second proposed solution is to approximate the sum of independent Wishart matrices by just one equivalent Wishart matrix. This approach is based on the idea of equating the cumulants, as done in [20] for the case of general covariance matrices. We have found a simple and compact closed-form expression to determine the degrees of freedom of this equivalent Wishart matrix.

In order to show that our proposed solutions are valid, we have chosen the two MIMO multiuser scenario described before, viz. MIMO MAC and MIMO Relay. First, by considering an arbitrary set of parameters, we show that the Monte Carlo simulated eigenvalue distribution of the sum of Wishart matrices is perfectly described by our exact expression. Then, we apply our approximation to find an equivalent Wishart matrix, and compare its eigenvalue distribution with the simulated results. The results are promising.

Moving a step forward, we present in Section IV a new closed-form expression for the ergodic sum capacity. This expression takes as input the exact eigenvalue distribution of the sum of Wishart matrices or the approximate eigenvalue distribution of the equivalent Wishart. We show that the analytical ergodic sum rate capacity matches the simulation results perfectly. All these results are shown in Section V and give basis for our conclusions presented in Section VI.

Besides all the sections mentioned above, we present some fundamental definitions about Wishart matrices in Section II.

## Ii Preliminaries

In this section we begin with the definition of complex Wishart distribution, which depends crucially on variance and degrees-of-freedom parameters. These are then used to construct the matrix model of our interest, namely the weighted sum of central Wishart matrices. This, in turn, is used in later sections for derivation of the probability density function and relevant metric for our problem.

Given a random -dimensional non-negative definite matrix with degrees of freedom . The distribution law of ,

 PWi(Wi)∝det(Wi)pi−miexp(−\,tr\,Σ−1iWi), (1)

is called complex central Wishart distribution [6, 23], and is denoted by

 Wi∼CWmi(pi,Σi). (2)

Here, is the covariance matrix, and tr represent determinant and trace operators, respectively. In the following we will consider , where is the identity matrix of dimension .

Consider independent matrices with the distribution given by (2). We are interested in the eigenvalue statistics of the weighted sum of these matrices normalized by their respective degrees of freedom, viz.,

 ¯¯¯¯¯¯¯W=K∑i=1aipiWi (3)

where . Note that the above sum is possible only if the ’s are identical, say .

It is known for the general case of , with , that ; see[19, Theorem 7.3.2.]. On the other hand, if the covariance matrices ’s are not proportional to identity matrix, then obtaining the distribution of and its eigenvalues is nontrivial; see for example [22]. However, if ’s are proportional to identity matrix, then as shown in appendix A, actually corresponds to a semicorrelated Wishart distributed case [24].

For the scenario , without loss of any generality we may consider , as different values can be absorbed in 111 may also be absorbed in . Therefore, corresponds essentially to an uncorrelated Wishart case.. Let us define

 vi =(ai/pi)σ2,  i=1,...,K; (4) p =K∑i=1pi. (5)

With these definitions we now present the exact as well as approximate solution concerning the eigenvalue statistics of .

## Iii Proposed Solution

This section presents our contribution to determine the eigenvalue distribution for the weighted sum of Wishart matrices, as defined above. First, we present a new exact closed-form expression. Then, we propose an approximation that replaces the weighted sum of Wishart matrices by an equivalent matrix.

### Iii-a Exact closed-form expression for the marginal eigenvalue distribution

The main result of our paper is given in the following proposition.

Proposition 1: The marginal density of eigenvalues of defined in (3) is given by

 Pλ(λ)=cdet⎡⎢⎣0[fj1(v1,λ)]j1=1,...,p1⋯[fjK(vK,λ)]jK=1,...,pK[gi(λ)]i=1,..,p[hi1,j1(v1)]i1=1,...,pj1=1,...,p1⋯[hiK,jK(vK)]iK=1,...,pjK=1,...,pK⎤⎥⎦. (6)

The entries inside the determinant in the above expression are respectively given by

 fj(v,λ)=Γ(j)vj−m−1exp(−λ/v)L(m−j+1)j−1(λ/v), (7) gi(λ)=λm−i/Γ(m−i+1), (8) hi,j(v)=Γ(i)Γ(i−j+1)vj−i. (9)

Here is the Gamma function given by , and are the associated Laguerre polynomials [25, eq. 22.5.38]. The normalization in (6) is obtained using

 c−1 =−mdet[[hi1,j1(v1)]i1=1,...,pj1=1,...,p1   ⋯   [hiK,jK(vK)]iK=1,...,pjK=1,...,pK]. (10)

Proof: See Appendix A.

### Iii-B Approximation for Sum of Wishart matrices

Proposition 2: Given the weighted sum of Wishart matrices normalized by their respective degrees of freedom as (3), we propose the following approximation

 ¯¯¯¯¯¯¯W≈S(∑Ki=1ai)ps, (11)

where , , and given by

 ps=⎢⎢ ⎢ ⎢ ⎢ ⎢⎣(∑Ki=1ai)2∑Ki=1a2ipi⎤⎥ ⎥ ⎥ ⎥ ⎥⎥, (12)

with representing the nearest integer operator.

Proof: The rationality for the approximation is as follow. The expected value of given in (2) is given by [23, 26]

 E[Wi]=piΣi, (13)

The variance of the main diagonal elements are given by [26]

 var[Wi(j,j)]=piσ4, (14)

where we have dropped the subscript of as explained before.

Also, the expected value of in (3) is given by

 E[¯¯¯¯¯¯¯W]=E[K∑i=1aipiWi]=K∑i=1aipipiΣi=K∑i=1aiΣi=σ2ImK∑i=1ai, (15)

and the variance of the main diagonal elements is given by

 var[¯¯¯¯¯¯¯W(j,j)] =var[K∑i=1aipiWi(j,j)]=K∑i=1a2ip2ipiσ4=σ4K∑i=1a2ipi. (16)

Notice that the expectation value of RHS of (11) is given by

 (17)

and the variance of the main diagonal elements is given by

 var⎡⎢ ⎢⎣(∑Ki=1ai)psS(j,j)⎤⎥ ⎥⎦ =σ4ps(∑Ki=1ai)2p2s=σ4(∑Ki=1ai)2ps. (18)

Here, we call attention to the similarities of results of (15) and (17), as well as (16) and (18). Therefore, it is possible to state a relation between the degrees of freedom of different Wishart distributions by equating (16) and (18) and obtaining the closed-form expression for given by (12). Also, since is related with the number of columns of the , it should be an integer number, and this is why we have to apply the nearest integer operation in (12).

## Iv Application

Generally, a single user communication under fading conditions has a received signal expression given by [9, (5.86)]

 y=hx+z (19)

where is the noise, is the Gaussian distributed input signal with power constraint , and is the channel gain. Herein, we assume , therefore, the channel is under Rayleigh fading. Now, suppose that the source has transmitting antennas, and the destination has receiving antennas. Hence, the wireless channel is described by the complex by random matrix , and the received signal is given by [9, (7.1)]

 y=Hix+z (20)

where is the white Gaussian noise vector at a symbol time (not show here by simplicity), , and . The entries of are , with and . Define a matrix as [4]

 Wi={HiH†i  Ni

where denotes the transpose conjugated matrix operator. Hence, has real, non-negative eigenvalues [27]. The matrix is distributed as (2) with and .

Telatar has shown in his canonical paper [4], that the ergodic capacity for the system described by (20) is given by

 C=EWi[log2det(Imi+aipiWi)]=mi∫∞0log2(1+λ)Pλ(λ) dλ. (22)

where is the the marginal density of eigenvalues. Since in this work we are interested in multiuser scenario instead of a single user described above, we should adapt the capacity equations for a multiuser case.

The first scenario is the MIMO MAC depicted in Fig. 1. The channel capacity for a MIMO MAC network with sources and one destination under Rayleigh fading is given by [13]

 CMAC =EWi[log2det(Im+K∑i=1aipiWi)] =E¯¯¯¯¯¯W[log2det(Im+¯¯¯¯¯¯¯W)] =E¯¯¯¯¯¯W[\,tr\,log2(Im+¯¯¯¯¯¯¯W)] (23)

where we have used first the equality given in (3), and then the property of matrices that asserts that [28].

In order to solve given in (23), we can use the eigenvalue distribution given in (6) to obtain a closed-form expression for the ergodic sum rate capacity given in (25) with the appropriated parameters of the Wishart matrices given in the problem statement. In terms of the marginal density of eigenvalues of , we can write

 CMAC=m∫∞0Pλ(λ)log2(1+λ) dλ. (24)

As shown in the appendices, an exact closed form expression for the ergodic capacity can be obtained in determinantal form involving Meijer-G functions, and is given by

 CMAC=−mcm∑μ=1det[[ψ(μ)i1,j1(v1)]i1=1,...,pj1=1,...,p1...[ψ(μ)iK,jK(vK)]iK=1,...,pjK=1,...,pK], (25)

where is given by

 ψ(μ)i,j(v)={Gi,j(v),i=μ,hi,j(v),i≠μ, (26)

with

 (27)

and as in (9).

On the other hand, by using the proposed approximation given in (11), (23) becomes

 CMAC=EWi[log2det(Im+K∑i=1aipiWi)] ≈ES[log2det(Im+∑Ki=1aipsS)] (28)

Hence, we can use (25) with and , and then set to obtain .

Now, let’s turn our attention to the MIMO Relay channel shown in Fig. 2. This channel can be viewed as a composition of a MAC and broadcast channel (BC) with . Suppose that the channel gains are known at the corresponding receivers only (CSI). In this scenario, an upper bound on the ergodic capacity of the MIMO relay channel is given by [16, Theorem 4.1]

 Cupper=min(CBC,CMAC% ) (29)

where

 CBC=EWi[log2det(Imi+a1p1W1+a2p2W2)], (30)

and as in (23). Notice that is similar to given in (23). Therefore a similar procedure can be implemented to obtain .

## V Numerical Results

In this section we have obtained numerical results for the closed form expressions and for the proposed approximation. The results are compared with Monte Carlo simulations to validate the analytical expressions. For each one of the simulations, 40,000 channel realizations were performed. In all cases, there is a perfect agreement between analytical and simulation results. We have chosen three arbitrary scenarios and one well-known scenario from [16].

Consider a MIMO MAC scenario shown in Fig. 1 with users, each one with transmitting antennas, where . Destination node D has receiving antennas. The normalized signal to noise ratios at destination were arbitrarily chosen, and are shown in Table I (Case I). The marginal eigenvalue distribution is shown in Fig. 3. Notice the perfect agreement between the simulation and analytical results. The approximate ergodic sum rate capacity was also computed using the equivalent matrix (with degrees of freedom) and is shown in the last column of Table I. The eigenvalue distribution for the approximation is also shown in Fig. 3. Note how close the approximation and the ergodic sum rate capacity are to the exact values.

In the next scenario we have increased the number of users to with MIMO . The coefficients are given in Case II of Table I. Notice again in Fig. 4 a perfect match between analytical and simulation results. The ergodic capacity results also agree, as can be seen in Table I. The eigenvalue distribution from the approximation is shown in Fig. 4 as well.

Now let us move on to a more involved scenario depicted in Fig. 2. The ergodic capacity was originally calculated in [16] using convex programming. The parameters used are depicted in Case III of Table I and the plot for the eigenvalue distribution is given in Fig. 5. Fig. 6 shows the eigenvalue distribution for the MAC channel with the following parameters . The upper bound on ergodic capacity, as mentioned before, is the minimum of the capacity of BC and MAC, as given in Table I.

Besides the Case III, we have also reproduced the scenario given in [16, Fig. 5] for MIMO Relay channel. This scenario is well known because the upper bound and the lower bound “converge”. That is to say, the ergodic capacity of the MIMO relay channel over Rayleigh fading can be characterized under this SNR condition [16]. The constraints for this scenario are , , and dB. The ergodic capacity results for Monte Carlo simulation and the proposed approximation are given in Fig. 7. Notice again the perfect agreement of the results.

The results in Table I and in Fig. 7 show that the proposed approximation results in a very small difference from the exact result for all mentioned scenarios. Since the approximation depends on the weight factor of each matrix, or in other words depends on the SNR of each channel, it would be interesting to investigate cases where these weight factors varies. Fig. 8 shows the percentage error as the ratio varies from 0 to 15 dB. Note that the error is less than 1 for and .

## Vi Conclusions

In this work we uncovered a one to one correspondence between the weighted sum of arbitrary number of uncorrelated central Wishart matrices and a single semicorrelated Wishart matrix. Using this observation we presented a closed form expression for the marginal distribution of the eigenvalues for the weighted sum of complex central Wishart matrices. To the best of our knowledge this problem has not been tackled before. Here the motivation for establishing a result emerged from the multiuser information theory area. However, since Wishart matrices play crucial role in diverse fields, we believe that our results are relevant to these as well. We would like to remark that it is also possible to obtain results for the joint probability density of all eigenvalues, and correlation functions involving distribution of two or more eigenvalues.

We applied our new closed-form expression for analyzing the ergodic sum rate capacity of MIMO multiuser channels. Moreover, we also derived a closed form expression for the ergodic channel capacity and used it to obtain the capacities for MIMO MAC and MIMO Relay channel. Besides the closed form exact expression for marginal distribution, we also proposed an approximation that is very simple and presents promising results when used to obtain ergodic sum capacity. In addition, we confirmed the validity of all our analytical expressions by Monte Carlo simulations.

## Appendix A Mapping to a semicorrelated Wishart distribution

Consider dimensional complex matrices , , from the normal distribution:

 Pi(Hi)∝exp(\,tr\,HiΣi−1H†i), (31)

where . Then -dimensional matrices , are respectively from the complex-Wishart distribution given in (2). The matrix can be written as

 ¯¯¯¯¯¯¯W =[H†1H†2…H†K]⎡⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢⎣a1p1Ip10⋯00a2p2Ip2⋯0⋮⋱⋮00⋯aKpKIpK⎤⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥⎦⎡⎢ ⎢ ⎢ ⎢⎣H1H2⋮HK⎤⎥ ⎥ ⎥ ⎥⎦ =H†DH≡G†G. (32)

We defined here

 H†=[H†1H†2…H†K], (33) D=\,diag\,[a1p1Ip1,⋯,aKpKIpK], (34) G=D1/2H. (35)

With the above information it is clear that satisfies the distribution

 PG(G)∝exp[−\,tr\,(G†V−1G)], (36)

where , with (and ) as defined in (5). Therefore, we are looking essentially at a semicorrelated Wishart case, with the diagonal-covariance matrix possessing some equal-value entries (multiplicities/degeneracies). Thus, the problem boils down to determining the eigenvalue statistics of . We start with the case of a diagonal covariance matrix with unequal entries along the diagonal, i.e., we will use in the above distribution instead of , work out the results for this case, and eventually take adequate limits to obtain the case of .

For the semicorrelated Wishart matrices, exact result for the marginal density of eigenvalues is available from several notable works [29, 30, 31, 32]. We use here the form derived in [31, 32]. Consider dimensional complex matrices taken from the distribution (36), but with the covariance matrix as defined above. The marginal density of eigenvalues of , for , is given to be

 (37)

Here is the Vandermonde determinant. Since and share the same nonzero eigenvalues, the above result holds for as well, with the factor appearing in the denominator of the prefactor replaced by . Moreover, in this case the bottom entries of the first column in the determinant comprise diverging gamma function in the denominator, and hence become zero.

We now use the relation (22) to derive the ergodic channel capacity. To this end we expand (37) using the first column and obtain

 Pλ(λ)=−1mΔp({^v−1})m∑μ=1(−1)μλm−μΓ(m−μ+1)det⎡⎢ ⎢ ⎢ ⎢⎣[exp(−λ/^vj)^vmj]j=1,...,p[^v−i+1j]i,j=1,...,p(i≠μ)⎤⎥ ⎥ ⎥ ⎥⎦. (38)

Next we bring in the factors occurring before the determinants to the respective first rows, i.e., with . This gives

 Pλ(λ)=−1mΔp({^v−1})m∑μ=1(−1)μdet⎡⎢ ⎢ ⎢ ⎢⎣[λm−μΓ(m−μ+1)exp(−λ/^vj)^vmj]j=1,...,p[^v−i+1j]i,j=1,...,p(i≠μ)⎤⎥ ⎥ ⎥ ⎥⎦. (39)

The above equation serves as yet another expression for the marginal density.

For ergodic capacity we use (22) and obtain the following expression by interchanging the -integral and the summation:

 (40)

The -integral can be brought into the first row of the determinant, along with the factor to yield

 C=−1Δp({^v−1})m∑μ=1(−1)μdet⎡⎢ ⎢⎣[Gμ,j(^v)]j=1,...,p[^v−i+1j]i,j=1,...,p(i≠μ)⎤⎥ ⎥⎦, (41)

where

 Gμ,j(^v)=∫∞0dλλm−μΓ(m−μ+1)exp(−λ/^vj)^vmjlog2(1+λ). (42)

This integral can be expressed in a closed form with the aid of Meijer-G function [33]. This is facilitated by considering the following special cases of Meijer-G functions:

 G1,00,1(_β∣∣∣z)=zβe−z,      G1,22,2(1,11,0∣∣∣z)=ln(1+z), (43)

We also use the convolution integral satisfied by Meijer-G function:

 ∫∞0dzGm,np,q(a1,⋯apb1,⋯bq∣∣∣ηz)Gμ,νσ,τ(c1,⋯cσd1,⋯dτ∣∣∣ωz) (44)

The restrictions on the indices for this integration formula can be found in [33]. Therefore, we obtain a closed form expression for as given below in (47). Afterwards we perform row interchanges in the determinants to bring in the respective th row. This leads to the removal of factor. Consequently, we arrive at the following expression for ergodic channel capacity:

 C=−1det[^v1−ij]i,j=1,...,pm∑μ=1det[ψ(μ)i,j(^v)]i,j=1,...,p. (45)

Here

 ψ(μ)i,j(^v)={Gi,j(^v),i=μ^v−i+1j,i≠μ. (46)

with

 (47)

## Appendix B Proofs for equations (6) and (25)

To obtain equations (6) and (25) we need to assign in (37) and (45). However, direct substitution of these values makes the determinant in the numerator, as well as the determinant in the denominator to become zero. Therefore, we must carry out this substitution in a limiting manner, as described below.

Let us pay attention to the columns involving up to in (37). The ratio of the determinants appears as

 (48)

Consider for , with small , and Taylor-expand up to :

 (^v−1j)me^v−1jλ≈j−1∑r=0δrjr!∂r∂(^v−11)r(^v−11)me^v−11λ
 (^v−1j)i−1≈j−1∑r=0δrjr!∂r∂(^v−11)r(^v−11)i−1

Now, applying adequate column operations we obtain

 det⎡⎢ ⎢ ⎢ ⎢⎣0(^v−11)me^v−11λδj1!∂∂(^v−11)(^v−11)me^v−11λ…δj−1j(j−1)!∂j−1∂(^v−11)j−1(^v−11)me^v−11λ…λm−iΓ(m−i+1)(^v−11)i−1δj1!∂∂(^v−11)(^v−11)i−1…δj−1j(j−1)!∂j−1∂(^v−11)j−1(^v−11)i−1…⎤⎥ ⎥ ⎥ ⎥⎦det[(^v−11)i−1δj1!∂∂(^v−11)(^v−11)i−1…δj−1j(j−1)!∂j−1∂(^v−11)j−1(^v−11)i−1…] (49)

The factors containing and factorial can be canceled out after being pulled out of the columns, both from numerator and denominator. Therefore, we are left with

 (50)

We have . The derivatives of can be evaluated with the aid of Rodrigues’ formula for the associated Laguerre polynomials,

 L(β)k(z)=z−βezk!∂k∂zk(zk+βe−z), (51)

using adequate scaling of the variables. By implementing similar steps for rest of the columns, we arrive at (6).

Similar steps can be used to arrive at (25), starting from (45). The derivative of Meijer-G follows from the result

 (52)

which is a special case of the following more general identity [33]:

 zr∂r∂zrGm,np,q(a1,⋯,apb1,⋯,bq∣∣∣z)=Gm,n+1p+1,q+1(0,a1,⋯,apb1,⋯,bq,r∣∣∣z). (53)

## References

• [1] G. Akemann, J. Baik, and P. Di Francesco, The Oxford handbook of random matrix theory.   Oxford; New York: Oxford University Press, 2011.
• [2] J. Winters, “On the capacity of radio communication systems with diversity in a rayleigh fading environment,” Selected Areas in Communications, IEEE Journal on, vol. 5, no. 5, pp. 871–878, 1987.
• [3] G. J. Foschini, “Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas,” Bell labs technical journal, vol. 1, no. 2, pp. 41–59, 1996.
• [4] E. Telatar, “Capacity of multi-antenna gaussian channels,” European transactions on telecommunications, vol. 10, no. 6, pp. 585–595, 1999.
• [5] J. Wishart, “The Generalised Product Moment Distribution in Samples from a Normal Multivariate Population,” Biometrika, vol. 20A, no. 1-2, pp. 32–52, 1928.
• [6] A. T. James, “The Distribution of the Latent Roots of the Covariance Matrix,” The Annals of Mathematical Statistics, vol. 31, no. 1, pp. 151–158, Mar. 1960.
• [7] A. Zanella, M. Chiani, and M. Win, “On the marginal distribution of the eigenvalues of wishart matrices,” IEEE Transactions on Communications, vol. 57, no. 4, pp. 1050–1060, Apr. 2009.
• [8] S. Jin, M. R. Mckay, X. Gao, and I. B. Collings, “MIMO multichannel beamforming: SER and outage using new eigenvalue distributions of complex noncentral Wishart matrices,” IEEE Transactions on Communications, vol. 56, no. 3, pp. 424–434, Mar. 2008.
• [9] D. Tse, Fundamentals of wireless communication.   Cambridge university press, 2005.
• [10] Z. Wang and G. Giannakis, “Outage Mutual Information of Space?Time MIMO Channels,” IEEE Transactions on Information Theory, vol. 50, no. 4, pp. 657–662, Apr. 2004.
• [11] L. Ordoez, D. Palomar, and J. Fonollosa, “Ordered Eigenvalues of a General Class of Hermitian Random Matrices With Application to the Performance Analysis of MIMO Systems,” IEEE Transactions on Signal Processing, vol. 57, no. 2, pp. 672–689, 2009.
• [12] P. Smith, S. Roy, and M. Shafi, “Capacity of MIMO systems with semicorrelated flat fading,” IEEE Transactions on Information Theory, vol. 49, no. 10, pp. 2781–2788, 2003.
• [13] A. Goldsmith, S. Jafar, N. Jindal, and S. Vishwanath, “Capacity limits of mimo channels,” Selected Areas in Communications, IEEE Journal on, vol. 21, no. 5, pp. 684–702, June 2003.
• [14] T. Cover and J. Thomas, Elements of Information Theory, ser. A Wiley-Interscience publication.   Wiley, 2006.
• [15] B. Hochwald and S. Vishwanath, “Space-time multiple access: Linear growth in the sum rate,” in in Proc. 40th Annual Allerton Conf. Communications, Control and Computing, 2002.
• [16] B. Wang, J. Zhang, and A. Host-Madsen, “On the capacity of MIMO relay channels,” IEEE Transactions on Information Theory, vol. 51, no. 1, pp. 29–43, Jan. 2005.
• [17] G. Akemann, J. R. Ipsen, and M. Kieburg, “Products of rectangular random matrices: Singular values and progressive scattering,” Phys. Rev. E, vol. 88, p. 052118, Nov 2013.
• [18] G. Akemann, M. Kieburg, and L. Wei, “Singular value correlation functions for products of wishart random matrices,” Journal of Physics A: Mathematical and Theoretical, vol. 46, no. 27, p. 275205, 2013. [Online]. Available: http://stacks.iop.org/1751-8121/46/i=27/a=275205
• [19] T. W. Anderson, An Introduction to Multivariate Statistical Analysis.   Wiley, 1958.
• [20] W. Tan and R. Gupta, “On approximating a linear combination of central wishart matrices with positive coefficients,” Communications in Statistics - Theory and Methods, vol. 12, no. 22, pp. 2589–2600, 1983.
• [21] D. Nel and C. Van Der Merwe, “A solution to the multivariate behrens-fisher problem,” Communications in Statistics - Theory and Methods, vol. 15, no. 12, pp. 3719–3735, 1986.
• [22] S. Kumar, “Eigenvalue statistics for the sum of two complex wishart matrices,” EPL (Europhysics Letters), vol. 107, no. 6, p. 60002, 2014.
• [23] N. R. Goodman, “Statistical Analysis Based on a Certain Multivariate Complex Gaussian Distribution (An Introduction),” The Annals of Mathematical Statistics, vol. 34, no. 1, pp. 152–177, Mar. 1963.
• [24] M. Ivrlac, W. Utschick, and J. Nossek, “Fading correlations in wireless mimo communication systems,” Selected Areas in Communications, IEEE Journal on, vol. 21, no. 5, pp. 819–828, June 2003.
• [25] M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions: with Formulas, Graphs, and Mathematical Tables, ser. Dover Books on Mathematics.   Dover Publications, 2012.
• [26] D. Maiwald and D. Kraus, “On moments of complex wishart and complex inverse wishart distributed matrices,” in Acoustics, Speech, and Signal Processing, 1997. ICASSP-97., 1997 IEEE International Conference on, vol. 5, Apr 1997, pp. 3817–3820 vol.5.
• [27] A. T. James, “Distributions of Matrix Variates and Latent Roots Derived from Normal Samples,” The Annals of Mathematical Statistics, vol. 35, no. 2, pp. 475–501, Jun. 1964.
• [28] R. A. Horn and C. R. Johnson, Matrix Analysis.   Cambridge University Press, 1990.
• [29] G. Alfano, A. Tulino, A. Lozano, and S. Verdu, “Capacity of MIMO channels with one-sided correlation,” in Eighth IEEE International Symposium on Spread Spectrum Techniques and Applications - Programme and Book of Abstracts (IEEE Cat. No.04TH8738).   IEEE, 2004, pp. 515–519.
• [30] S. Simon, A. Moustakas, and L. Marinelli, “Capacity and character expansions: Moment-generating function and other exact results for mimo correlated channels,” Information Theory, IEEE Transactions on, vol. 52, no. 12, pp. 5336–5351, Dec 2006.
• [31] C. Recher, M. Kieburg, and T. Guhr, “Eigenvalue densities of real and complex wishart correlation matrices.” Phys Rev Lett, vol. 105, no. 24, p. 244101, 2010.
• [32] C. Recher, M. Kieburg, T. Guhr, and M. Zirnbauer, “Supersymmetry approach to wishart correlation matrices: Exact results,” Journal of Statistical Physics, vol. 148, no. 6, pp. 981–998, 2012.
• [33] A. P. Prudnikov, Y. A. Brychkov, O. I. Marichev, and G. G. Gould, Integrals and series, Vol. 3: More special functions.   London: Gordon and Breach Science Publishers, 1990.
You are adding the first comment!
How to quickly get a good reply:
• Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
• Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
• Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters