This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Sum Capacity Loss Quantification With Optimal and Sub-Optimal Precoding in Heterogeneous Multiuser Channels

Harsh Tataria*, Mansoor Shafi, and Dino Pjanić*
*Ericsson AB, Lund, Sweden
Spark New Zealand, Wellington, New Zealand
e-mail: {harsh.tataria, dino.pjanic}@ericsson.com, and mansoor.shafi@spark.co.nz
Abstract

We analytically approximate the expected sum capacity loss between the optimal downlink precoding technique of dirty paper coding (DPC), and the sub-optimal technique of zero-forcing precoding, for multiuser channels. We also consider the most general case of multi-stream transmission to multiple users, where we evaluate the expected sum capacity loss between DPC and block diagonalization precoding. Unlike previously, assuming heterogeneous Ricean fading, we utilize the well known affine approximation to predict the expected sum capacity difference between both precoder types (optimal and sub-optimal) over a wide range of system and propagation parameters. Furthermore, for single-stream transmission, we consider the problem of weighted sum capacity maximization, where a similar quantification of the sum capacity difference between the two precoder types is presented. In doing so, we disclose that power allocation to different users proportional to their individual weights asymptotically maximizes the weighted sum capacity. Numerical simulations are presented to demonstrate the tightness of the developed expressions relative to their simulated counterparts.

I Introduction

Since the inception of massive multiple-input multiple-output (MIMO) systems, the downlink multiuser broadcast channel has, yet again, been under intense research limelight [1]. It is now well understood that dirty paper coding (DPC) – an optimal precoding technique pioneered by Costa in [2], achieves the capacity region of the multiuser broadcast channel [1]. Nonetheless, practical implementation of DPC requires substantial complexity for ordered decoding and interference cancellation with precise channel state information at both the cellular base station (BS) and user terminals [1]. This has paved the way for reduced complexity, yet sub-optimal, linear precoding techniques such as zero-forcing (ZF) and block diagonalization (BD) for multiuser transmission with single and/or multiple streams. Due to their sub-optimal nature, linear precoding techniques incur an absolute expected (average) sum capacity penalty (a.k.a. expected sum capacity offset) relative to DPC, reducing the achievable performance [3]. With massive MIMO systems, linear precoding can achieve up to 98% of DPC performance if the number of BS antennas exceeds at least 10×\times the total number of user antennas [1].

Despite the many research advances on multiuser broadcast channels (see e.g., [4, 5, 6] and references therein), understanding and quantifying the fundamental difference in the expected sum capacity with optimal and sub-optimal precoding techniques remains a sparsely investigated area. The focus of the paper is to close this research gap. The authors of [6, 7] present some preliminary results on this topic for point-to-point and multiuser MIMO systems for simple uncorrelated Rayleigh fading channels. Nevertheless, such analysis do not capture, to the full extent, the heterogeneity present in multiuser channels due to wide ranging propagation conditions. In reality, some users may experience the presence of dominant line-of-sight (LOS) components, while others may be experience heavy non-LOS (NLOS) conditions. In contrast to [6, 7], we consider the general case of a heterogeneous Ricean fading channel, where each terminal has a unique Ricean KK-factor and LOS component steering angle. For single-stream transmission, we analyze the expected sum capacity loss between DPC and ZF, and for multi-stream transmission, we consider BD precoding expected sum capacity performance relative to DPC over a wide range of operating signal-to-noise ratios (SNRs), BS/user antenna numbers, and Ricean KK-factors. Our analysis leverages the affine approximation to sum capacity developed in [8], which states that C(SNR)𝒮[log2(SNR)]+𝒪(1)C(\textrm{SNR})\approx\mathcal{S}_{\infty}[\hskip 1.0pt\log_{2}(\textrm{SNR})-\mathcal{L}_{\infty}]+\mathcal{O}(1). Here, 𝒮[]\mathcal{S}_{\infty}[\cdot] denotes the multiplexing gain (additional bits/sec/Hz for every 3 dB increase in SNR), \mathcal{L}_{\infty} denotes the sum capacity offset and 𝒪(1)\mathcal{O}(1) represents an order one term. Though this approximation is exact at asymptotically high SNRs (see [6, 7]), it is seen to provide tight results over a wide range of SNRs. When applying this approximation to the DPC and ZF sum capacity, the same 𝒮\mathcal{S}_{\infty} terms are obtained, with different \mathcal{L}_{\infty} terms allowing us to characterize the difference in sum capacity between optimal and sub-optimal precoding. By averaging the per-channel realization sum capacity offset over the myriad of Ricean fading, we are able to derive simple, yet accurate, expressions for the expected sum capacity difference as a function of system and propagation parameters. While the studies in [9, 10] have analyzed the ratio between sum capacity obtained with non-linear and linear precoding for Rayleigh fading multiuser channels, we study the absolute difference between these to quantify the sum capacity loss.

In addition the expected sum capacity loss quantification, we also investigate the weighted sum capacity maximization problem using DPC and ZF for single-stream transmission providing simple expressions for the capacity offsets. We show that the weighted sum capacity is maximized at asymptotically high SNRs by allocating power in direct proportion to the user weights. This result generalizes the well understood property that equal power allocation (e.g., across users and fading states) asymptotically maximizes the sum capacity of heterogeneous multiuser channels.

Notation. Upper and lower boldface letters represent matrices and vectors. The M×MM\times{}M identity matrix is denoted as 𝐈M\mathbf{I}_{M}, while the M×MM\times{}M zero matrix is denoted by 𝟎M\mathbf{0}_{M}. The (i,j)(i,j)-th entry of the matrix X is denoted by (𝐗)i,j(\mathbf{X})_{i,j}, while the transpose, Hermitian transpose, inverse and trace operators are denoted by ()T(\cdot)^{T}, ()H(\cdot)^{H}, ()1(\cdot)^{-1} and Tr[]\textrm{Tr}[\cdot], respectively. Moreover, ||||||\cdot|| and |||\cdot| denote the Euclidian vector norm and determinant operator of a matrix. We use 𝐡𝒞𝒩(𝐦,𝐑)\mathbf{h}\sim\mathcal{CN}(\mathbf{m},\mathbf{R}) to denote a complex Gaussian distribution for 𝐡\mathbf{h} with mean 𝐦\mathbf{m} and covariance matrix 𝐑\mathbf{R}. Finally, we write 𝔼{}\mathbb{E}\{\cdot\} to denote the statistical expectation, and max{f(x)}\textrm{max}\{f(x)\} to denote the maximum value of the function f(x)f(x), where xx is a scalar value.

II System Model

We consider a downlink of an LL user MIMO broadcast channel, in which the BS has a uniform linear array (ULA) of MM electronically steerable antenna elements. For maximizing generality, each user terminal is equipped with NN antennas, where MLNM\geq{}LN. The N×1N\times{}1 received signal observed at the NN antennas of the \ell-th user terminal can then be written as

𝐲=ρ12𝐇𝐱+𝐧,\mathbf{y}_{\ell}=\rho^{\frac{1}{2}}\hskip 1.0pt\mathbf{H}_{\ell}\hskip 1.0pt\mathbf{x}+\mathbf{n}_{\ell},\vspace{-5pt} (1)

where ρ\rho denotes the average transmit power from the BS and 𝐇\mathbf{H}_{\ell} denotes the N×MN\times{}M downlink propagation channel matrix to terminal \ell from the BS encapsulating the effects of small-scale fading (discussed later in the text). Additionally, 𝐱\mathbf{x} is the M×1M\times{}1 transmitted signal vector from the MM BS antennas having the total average power constraint Tr[𝔼{𝐱𝐱H}]ρ\textrm{Tr}[\mathbb{E}\{\mathbf{x}\mathbf{x}^{H}\}]\leq{}\rho, and 𝐧\mathbf{n}_{\ell} is the N×1N\times{}1 additive white Gaussian noise with unit variance per-component, such that 𝔼{𝐧𝐧H}=𝐈N\mathbb{E}\{\mathbf{n}_{\ell}\mathbf{n}_{\ell}^{H}\}=\mathbf{I}_{N}. Without loss of generality, we assume the same noise covariance matrix for each user. To this end, we define the operating SNR as the ratio of the average transmit power to the per-user noise variance, i.e., SNR=ρ\textrm{SNR}=\rho. To facilitate the analysis of the expected sum capacity loss between DPC and ZF precoding, as well as BD precoding, we assume that the BS has knowledge of all propagation channel matrices, and each user terminal has knowledge of its individual propagation channel matrix. At first glance, this assumption may come across as rather idealistic. However, such an assumption is necessary to make analytical progress, and the results derived here can be regarded as a useful upper bound in performance relative to what is obtainable with estimated channels. We denote the composite LN×MLN\times{}M channel by 𝐇H=[𝐇1H,𝐇2H,,𝐇LH]\mathbf{H}^{H}=[\mathbf{H}_{1}^{H},\mathbf{H}_{2}^{H},\dots,\mathbf{H}_{L}^{H}], which can be further decomposed as 𝐇H=[(𝐡1,1H𝐡1,2H,,𝐡1,NH)(𝐡L,1H,𝐡L,2H,,𝐡L,NH)]\mathbf{H}^{H}=[\hskip 1.0pt(\mathbf{h}_{1,1}^{H}\hskip 3.0pt\mathbf{h}_{1,2}^{H},\dots,\mathbf{h}_{1,N}^{H})\dots(\mathbf{h}_{L,1}^{H},\mathbf{h}_{L,2}^{H},\dots,\mathbf{h}_{L,N}^{H})\hskip 1.0pt], where 𝐡,n\mathbf{h}_{\ell,n} is the 1×M1\times{}M nn-th row vector of 𝐇\mathbf{H_{\ell}}. The small-scale fading matrix for user \ell, 𝐇\mathbf{H}_{\ell}, follows a Ricean distribution, which can be expressed as [11]

𝐇=𝐇¯κκ+1+𝐇~11+κ.\mathbf{H}_{\ell}=\bar{\mathbf{H}}_{\ell}\hskip 2.0pt\sqrt{\frac{\kappa_{\ell}}{\kappa_{\ell}+1}}\hskip 2.0pt+\hskip 2.0pt\tilde{\mathbf{H}}_{\ell}\hskip 2.0pt\sqrt{\frac{1}{1+\kappa_{\ell}}}.\vspace{-2pt} (2)

Here, 𝐇¯\bar{\mathbf{H}}_{\ell} is the deterministic component modelling the presence of LOS or dominant components in the propagation channel, with its (n,m)(n,m)-th entry governed by

(𝐇¯)n,m=exp(j(n1)2πdλ~sin(ϕm)).\left(\hskip 1.0pt\bar{\mathbf{H}}\hskip 1.0pt\right)_{n,m}=\textrm{exp}\left(-j\left(n-1\right)\frac{2\pi{}d}{\tilde{\lambda}}\sin\left(\phi_{m}\right)\right).\vspace{-4pt} (3)

We note that dd represents the inter-element spacing between successive antenna elements of the ULA, λ~\tilde{\lambda} denotes the carrier wavelength and ϕm\phi_{m} is the angle-of-departure (AOD) from the mm-th antenna element at the BS. Moreover, κ\kappa_{\ell} denotes the Ricean KK-factor of terminal \ell governing the ratio of LOS to NLOS power [11]. The NLOS, i.e., purely stochastic component of the channel for user \ell is modelled via the N×MN\times{}M matrix, 𝐇~\tilde{\mathbf{H}}_{\ell}, the entries of which are independent and identically distributed Gaussian random variables with zero-mean and unit variance. Thus, 𝐇~𝒞𝒩(0,𝐈M)\tilde{\mathbf{H}}_{\ell}\sim\mathcal{CN}(0,\mathbf{I}_{M}). To maximize clarity, exact parameterization of above quantities is given in Sec. V, where further details are presented. In what follows, we present the methodology for the expected sum capacity loss quantification between DPC and ZF, as well as BD precoding.

III Expected Sum Capacity Loss Quantification Methodology

III-A Dirty Paper Coding Sum Capacity Analysis

The DPC sum capacity hits the multiuser broadcast channel capacity region, which can be expressed from the landmark results of [12] on the broadcast to multiple access channel duality. This allows us to express the DPC sum capacity as

CDPC(𝐇,ρ)=max=1LTr[𝐐]ρ{log2|𝐈M+=1L𝐇H𝐐𝐇|},C_{\textrm{DPC}}\left(\mathbf{H},\rho\right)=\underset{\sum\nolimits_{\ell=1}^{L}\textrm{Tr}\left[\mathbf{Q}_{\ell}\right]\leq{}\rho}{\textrm{max}}\left\{\log_{2}\left|\hskip 1.0pt\mathbf{I}_{M}+\sum\limits_{\ell=1}^{L}\mathbf{H}_{\ell}^{H}\mathbf{Q}_{\ell}\mathbf{H}_{\ell}\right|\hskip 1.0pt\right\},\vspace{-2pt} (4)

where 𝐐\mathbf{Q}_{\ell} is the N×NN\times{}N covariance matrix of the dual multiple access channel. It is well known that no closed-form solution to (4) exists, yet it has been shown in [12] that CDPC(𝐇,ρ)C_{\textrm{DPC}}(\mathbf{H},\rho) converges in the absolute sense to the capacity of a point-to-point MIMO propagation channel with propagation matrix 𝐇\mathbf{H}, when MLNM\geq{}LN. As ρ\rho\rightarrow\infty [5],

limρ{CDPC(𝐇,ρ)log2|𝐈M+ρLN𝐇H𝐇|}=0.\underset{\rho\rightarrow{}\infty}{\textrm{lim}}\left\{C_{\textrm{DPC}}\left(\mathbf{H},\rho\right)-\log_{2}\left|\hskip 1.0pt\mathbf{I}_{M}+\frac{\rho}{LN}\mathbf{H}^{H}\mathbf{H}\hskip 1.0pt\right|\hskip 1.0pt\right\}=0.\vspace{-2pt} (5)

One can discover a corollary of this result if the covariance matrices are designed such that 𝐐=(ρ/LN)𝐈N\mathbf{Q}_{\ell}=(\rho/LN)\mathbf{I}_{N}, leading to an asymptotically optimal solution to (4). As such, an affine approximation (stated in the Sec. I) can be applied, such that the DPC sum capacity can be approximated as

CDPC(𝐇,ρ)LN[log2ρlog2LN]+log2|𝐇H𝐇|.C_{\textrm{DPC}}\left(\mathbf{H},\rho\right)\approx{}LN\left[\hskip 1.0pt\log_{2}\rho-\log_{2}LN\hskip 1.0pt\right]+\log_{2}\left|\mathbf{H}^{H}\mathbf{H}\right|.\vspace{-3pt} (6)

While this result becomes exact in the limit of high SNRs, we note that the high SNR sum capacity primarily depends on the product of the number of user terminals (LL), and the number of receive antennas per-user (NN). The effects of other parameters such as the number of BS antennas (MM), the Ricean KK-factors and LOS steering angles are captured in the |𝐇H𝐇||\mathbf{H}^{H}\mathbf{H}| term.

III-B Linear/Sub-Optimal Precoding Sum Capacity Analysis

We now evaluate the affine approximation to the linear precoding sum capacity using ZF and BD processing, and quantify the sum capacity offset relative to DPC. With linear precoding, the transmitted signal vector, 𝐱\mathbf{x}, can be written as

𝐱==1L𝐖𝐬.\mathbf{x}=\sum\limits_{\ell=1}^{L}\mathbf{W}_{\ell}\hskip 2.0pt\mathbf{s}_{\ell}.\vspace{-3pt} (7)

Here, 𝐬\mathbf{s}_{\ell} is the N×1N\times{}1 vector of data symbols intended for user terminal \ell, and 𝐖\mathbf{W}_{\ell} is the M×NM\times{}N precoding matrix for user \ell. The received signal at user \ell can then be written as

𝐲=ρ12𝐇𝐖𝐬+ρ12i=1iL𝐇𝐖i𝐬i+𝐧,\mathbf{y}_{\ell}=\rho^{\frac{1}{2}}\hskip 1.0pt\mathbf{H}_{\ell}\mathbf{W}_{\ell}\hskip 2.0pt\mathbf{s}_{\ell}+\rho^{\frac{1}{2}}\hskip 2.0pt\sum\limits_{\begin{subarray}{c}i=1\\ i\neq{}\ell\end{subarray}}^{L}\hskip 1.0pt\mathbf{H}_{\ell}\mathbf{W}_{i}\hskip 1.0pt\mathbf{s}_{i}+\mathbf{n}_{\ell},\vspace{-5pt} (8)

where the first term denotes the desired signal power, while the second and third terms denote the multiuser interference (including multi-stream interference) and additive white Gaussian noise. In the case of BD precoding (multi-stream transmission), multiuser interference is nulled by designing the individual user precoding matrices such that 𝐇𝐖i=𝟎N\mathbf{H}_{\ell}\mathbf{W}_{i}=\mathbf{0}_{N}, i[1,L]\forall{}i\neq{}\ell\in{}[1,L]. On the otherhand, for single-stream transmission, ZF precoders can be designed such that 𝐡,n𝐰i,p=0\mathbf{h}_{\ell,n}\mathbf{w}_{i,p}=0, i[1,L]\forall{}i\neq{}\ell\in[1,L] and n,p[1,N]\forall{}n,p\in[1,N]. Here, 𝐰i,p\mathbf{w}_{i,p} denotes the pp-th column vector of 𝐖i\mathbf{W}_{i}. Keeping this in mind, the received signal at the nn-th antenna of the \ell-th user terminal is given by

y,n=𝐡,n𝐰,n𝐬+n,n,n=1,2,,N.y_{\ell,n}=\mathbf{h}_{\ell,n}\mathbf{w}_{\ell,n}\mathbf{s}_{\ell}+n_{\ell,n},\hskip 8.0ptn=1,2,\dots,N.\vspace{-3pt} (9)

As such, ZF precoding converts the system into LNLN parallel channels with an equivalent channel entry g,n=𝐡,n𝐰,ng_{\ell,n}=\mathbf{h}_{\ell,n}\mathbf{w}_{\ell,n}.111We exercise a slight abuse of notation here and denote n,nn_{\ell,n} as the additive white Gaussian noise to the observation received at the nn-th receive antenna of the \ell-th user terminal. We caution the reader to be mindful of this. To maximize sum capacity, optimal power allocation across the LNLN channels should take place. Doing this would yield

CZF(𝐇,ρ)=max=1Ln=1Nρ,nρ=1Ln=1Nlog21+δ,n,C_{\textrm{ZF}}\left(\mathbf{H},\rho\right)\hskip 1.0pt=\underset{\sum\nolimits_{\ell=1}^{L}\sum\nolimits_{n=1}^{N}\rho_{\ell,n}\leq{}\rho}{\textrm{max}}\hskip 3.0pt\sum\limits_{\ell=1}^{L}\sum\limits_{n=1}^{N}\log_{2}1+\delta_{\ell,n},\vspace{-3pt} (10)

where δ,n=ρ,n|g,n|2\delta_{\ell,n}=\rho_{\ell,n}\left|g_{\ell,n}\right|^{2}. Since uniform power allocation coefficients converge to optimal power allocation at asymptotically high SNRs [3], applying the affine approximation,

CZF(𝐇,ρ)α+log2=1Ln=1N|g,n|2,C_{\textrm{ZF}}\left(\mathbf{H},\rho\right)\approx{}\alpha+\log_{2}\hskip 2.0pt\prod\limits_{\ell=1}^{L}\prod\limits_{n=1}^{N}\hskip 1.0pt\left|\hskip 1.0ptg_{\ell,n}\right|^{2},\vspace{-2pt} (11)

where α=LN[log2ρlog2LN]\alpha=LN[\hskip 1.0pt\log_{2}\rho-\log_{2}LN]. The expression in (11) has the same form of that derived for DPC sum capacity in (6), with the exception of the second term on the right-hand side (RHS) of (11), which is specific to ZF processing. As such, we define the asymptotic sum capacity loss as the difference between the DPC and ZF capacity. This can be expressed as

ClossDPC-ZF(𝐇)=\displaystyle C_{\textrm{loss}}^{\textrm{DPC-ZF}}\left(\mathbf{H}\right)= limρ{CDPC(𝐇,ρ)CZF(𝐇,ρ)}\displaystyle\underset{\rho\rightarrow{}\infty}{\textrm{lim}}\left\{C_{\textrm{DPC}}\left(\mathbf{H},\rho\right)-C_{\textrm{ZF}}\left(\mathbf{H},\rho\right)\right\}
=\displaystyle=\hskip 2.0pt log2|𝐇H𝐇|=1Ln=1N|g,n|2.\displaystyle\log_{2}\frac{\left|\mathbf{H}^{H}\mathbf{H}\right|}{\prod\limits_{\ell=1}^{L}\prod\limits_{n=1}^{N}\left|g_{\ell,n}\right|^{2}}. (12)

While the above metric denotes the sum capacity loss per-realization of 𝐇\mathbf{H}, we can also determine the expected capacity loss across the myriad of small-scale fading. That is,

𝔼{ClossDPC-ZF(𝐇)}𝔼{log21γ|𝐇H𝐇|},\mathbb{E}\{C_{\textrm{loss}}^{\textrm{DPC-ZF}}\left(\mathbf{H}\right)\}\approx\mathbb{E}\left\{\log_{2}\frac{1}{\gamma}\left|\mathbf{H}^{H}\mathbf{H}\hskip 1.0pt\right|\right\},\vspace{-2pt} (13)

where γ==1Ln=1N|g,n|2\gamma=\prod\nolimits_{\ell=1}^{L}\prod\nolimits_{n=1}^{N}|g_{\ell,n}|^{2}. In general, it is extremely difficult (if not intractable) to exactly analyze the expected value of (12), due to the heterogeneity present in the composite multiuser channel. To this end, we employ the well characterized (see e.g., [13, 14] and references therein) first-order Laplace approximation, which takes the form as shown in (13). The accuracy of such an approximation relies on the denominator of (13) having a small second moment relative to its first moment. This can be seen via application of a multivariate Taylor series expansion of (13) around its first moment value. The approximation in (13) has shown to give tight results when MM and LL start to grow (the case for massive MIMO), since the implicit averaging in the denominator of (13) gives rise to the required variance reduction [13, 14]. The result in (13) can equivalently be written as

𝔼{ClossDPC-ZF(𝐇)}𝔼{log21γ}+𝔼{log2|𝐇H𝐇|}.\mathbb{E}\{C_{\textrm{loss}}^{\textrm{DPC-ZF}}\left(\mathbf{H}\right)\}\approx\mathbb{E}\left\{\log_{2}\frac{1}{\gamma}\right\}+\mathbb{E}\left\{\log_{2}\left|\mathbf{H}^{H}\mathbf{H}\hskip 1.0pt\right|\right\}.\vspace{-1pt} (14)

Analyzing the second term on the RHS of (14), we can observe that 𝐇H𝐇\mathbf{H}^{H}\mathbf{H} follows an uncorrelated non-central Wishart distribution denoted by 𝐇H𝐇𝒲L(M,𝐏,𝚺)\mathbf{H}^{H}\mathbf{H}\sim\mathcal{W}_{L}(M,\mathbf{P},\mathbf{\Sigma}) [15]. Here by definition, we note that 𝐏=𝐇¯[𝜿(𝜿+𝐈L)1]1/2\mathbf{P}=\bar{\mathbf{H}}\hskip 1.0pt[\hskip 1.0pt\boldsymbol{\kappa}(\boldsymbol{\kappa}+\mathbf{I}_{L})^{-1}]^{1/2} is the mean matrix of 𝐇\mathbf{H} with 𝐇¯\bar{\mathbf{H}} capturing each user’s LOS channel matrix. Additionally, 𝜿\boldsymbol{\kappa} is an L×LL\times{}L diagonal matrix containing KK-factors for all users, and 𝚺=(𝜿+𝐈L)1\mathbf{\Sigma}=(\boldsymbol{\kappa}+\mathbf{I}_{L})^{-1} is the covariance matrix of the row vectors of 𝐇\mathbf{H}. Leveraging the results in [16] on the expected log-determinants of non-central Wishart matrices, the second term of the RHS of (14) is given by

𝔼{log2|𝐇H𝐇|}==1LNΔM(λ),\mathbb{E}\left\{\log_{2}\left|\mathbf{H}^{H}\mathbf{H}\hskip 1.0pt\right|\right\}=\sum\limits_{\ell=1}^{LN}\Delta_{M}\left(\lambda_{\ell}\right),\vspace{-2pt} (15)

where λ\lambda_{\ell} is the \ell-th eigenvalue of 𝐇¯H𝐇¯\bar{\mathbf{H}}^{H}\bar{\mathbf{H}}. Note that ΔM(λ)\Delta_{M}(\lambda_{\ell}) is defined in (16) on the top of the following page for reasons of space, where Ei()\textrm{Ei}(\cdot) denotes the exponential integral function and ()!(\cdot)\hskip 1.0pt! denotes the factorial operation [17].

ΔM(λ)=log2λEi(λ)+=1M1(1λ)[exp(λ)(1)!(M1)!(M1)!].\Delta_{M}\left(\lambda_{\ell}\right)=\log_{2}{\lambda_{\ell}}-\textrm{Ei}\left(-\lambda_{\ell}\right)+\sum\limits_{\ell=1}^{M-1}\left(\frac{-1}{\lambda_{\ell}}\right)^{\ell}\left[\hskip 1.0pt\textrm{exp}\left(\lambda_{\ell}\right)\left(\ell-1\right)\hskip 1.0pt!-\frac{\left(M-1\right)\hskip 1.0pt!}{\ell\left(M-1-\ell\right)\hskip 1.0pt!}\right]. (16)

In contrast to this, the first term of the RHS of (14) is obtained by approximating the structure of 𝐇H𝐇\mathbf{H}^{H}\mathbf{H} by the often used (see e.g., [11, 14]) uncorrelated central Wishart distribution with a shift in the covariance matrix 𝚺\mathbf{\Sigma} (following the methodology in [14])222Detailed investigation into the accuracy of the quoted approximation from non-central to central Wishart matrices can be found in [14]. to

𝚺^=\displaystyle\widehat{\mathbf{\Sigma}}= (𝜿+𝐈L)1+1M[𝜿(𝜿+𝐈L)1\displaystyle\left(\boldsymbol{\kappa}+\mathbf{I}_{L}\right)^{-1}+\frac{1}{M}\Bigg{[}\sqrt{\boldsymbol{\kappa}\left(\boldsymbol{\kappa}+\mathbf{I}_{L}\right)^{-1}}\hskip 2.0pt
×𝐇¯H𝐇¯𝜿(𝜿+𝐈L)1].\displaystyle\hskip 20.0pt\times{}\bar{\mathbf{H}}^{H}\bar{\mathbf{H}}\hskip 3.0pt\sqrt{\boldsymbol{\kappa}\left(\boldsymbol{\kappa}+\mathbf{I}_{L}\right)^{-1}}\hskip 1.0pt\Bigg{]}. (17)

Considering the above, one can recognize that |g,n|2|g_{\ell,n}|^{2} is a chi-squared random variable with MLN+1M-LN+1 degrees-of-freedom. Applying the standard probability density of the chi-squared random variable together with some straightforward algebraic manipulations, we can express the first term of the RHS of (14) as follows; where

𝔼{log21γ}LN[log2(𝚺^1)(,n),(,n)MLN].\mathbb{E}\left\{\log_{2}\frac{1}{\gamma}\right\}\hskip 1.0pt\approx{}\hskip 1.0ptLN\left[\log_{2}\frac{\left(\widehat{\mathbf{\Sigma}}^{-1}\right)_{\left(\ell,n\right),\left(\ell,n\right)}}{M-LN}\right]\hskip 2.0pt.\vspace{-5pt} (18)

Adding the result in (18) with (15) yields the expected sum capacity loss between DPC and ZF precoding as stated in (14). We note that this is a rather simple result for an extremely general and complex scenario of multiuser channels having user specific heterogeneity and parameters. Due to aforementioned mathematical difficulties, analysis of this type has been missing from the literature. In Sec. V, we evaluate the accuracy of the derived expected sum capacity loss by comparing it to its simulated counterpart for a wide range of system and propagation parameters.

Similar to ZF precoding, with BD precoding, LL parallel channels are formed with N×NN\times{}N equivalent channel matrices 𝐆=𝐇𝐖\mathbf{G}_{\ell}=\mathbf{H}_{\ell}\mathbf{W}_{\ell}, =1,2,,L\forall{}\ell=1,2,\dots,L. To this end, the BD sum capacity over all LL users can be written as [3, 9]

CBD(𝐇,ρ)=max=1LTr(𝐐)ρ=1Llog2|𝐈N+𝐆H𝐐𝐆|,C_{\textrm{BD}}\left(\mathbf{H},\rho\right)=\underset{\sum\nolimits_{\ell=1}^{L}\textrm{Tr}\left(\mathbf{Q}_{\ell}\right)\leq{}\rho}{\textrm{max}}\hskip 1.0pt\sum\limits_{\ell=1}^{L}\hskip 1.0pt\log_{2}\left|\hskip 1.0pt\mathbf{I}_{N}+\mathbf{G}_{\ell}^{H}\mathbf{Q}_{\ell}\hskip 1.0pt\mathbf{G}_{\ell}\right|,\vspace{-2pt} (19)

and the sum capacity can be approximated under the same constraints as for ZF processing via the affine approximation as

CBD(𝐇,ρ)α+log2=1L|𝐆H𝐆|.C_{\textrm{BD}}\left(\mathbf{H},\rho\right)\approx\alpha+\log_{2}\hskip 1.0pt\prod\limits_{\ell=1}^{L}\left|\hskip 1.0pt\mathbf{G}_{\ell}^{H}\mathbf{G}_{\ell}\right|.\vspace{-4pt} (20)

Note that α\alpha in (20) is as defined after (11). Similar to (12), the asymptotic loss from the instantaneous DPC sum capacity relative to that achieved by BD precoding can be expressed as

ClossDPC-BD(𝐇)=limρ{CDPC(𝐇,ρ)CBD(𝐇,ρ)}.C_{\textrm{loss}}^{\textrm{DPC-BD}}\left(\mathbf{H}\right)=\underset{\rho\rightarrow{}\infty}{\textrm{lim}}\left\{C_{\textrm{DPC}}\left(\mathbf{H},\rho\right)-C_{\textrm{BD}}\left(\mathbf{H},\rho\right)\right\}.\vspace{-2pt} (21)

Similar to the ZF case, the expected loss across the ensemble of small-scale fading can then be evaluated by analyzing the statistical expectation term, 𝔼{ClossDPC-BD(𝐇)}\mathbb{E}\{C_{\textrm{loss}}^{\textrm{DPC-BD}}(\mathbf{H})\}. Following a similar methodology to the ZF analysis, one can derive approximation to 𝔼{ClossDPC-BD(𝐇)}\mathbb{E}\{C_{\textrm{loss}}^{\textrm{DPC-BD}}(\mathbf{H})\}. Due to space reasons, we omit its detailed analysis here and note that the full derivation will feature in the upcoming journal version of the paper. In Sec. V, the sum capacity performance with BD precoding relative to ZF and DPC is assessed for multi-stream transmission scenarios.

In the section which follows, for single-stream, single receive antenna per-user scenarios, we analyze the maximization of the sum capacity with power allocation to each user.

IV Weighted Sum Capacity Maximization

In this section, we generalize the earlier discussed sum capacity to weighted sum capacity maximization for the case when each user has a single antenna, i.e., N=1N=1. As such, the downlink propagation channel to user \ell is a 1×M1\times{}M row vector, denoted by 𝐡\mathbf{h}_{\ell}. We first show that allocating power in proportion to the user weights is asymptotically optimal, and use this result to compute the associated sum capacity offsets. Without loss of generality, we assume that user weights, denoted by μ1,μ2,,μL\mu_{1},\mu_{2},\dots,\mu_{L}, are in descending order, i.e., μ1μ2,,μL0\mu_{1}\geq{}\mu_{2}\geq{},\dots,\geq{}\mu_{L}\geq{}0 with =1Lμ=1\sum\nolimits_{\ell=1}^{L}\mu_{\ell}=1. The maximum weighted sum capacity problem for DPC, defined as the maximum of =1LμC\sum\nolimits_{\ell=1}^{L}\mu_{\ell}\hskip 1.0ptC_{\ell} over the capacity region, which can be written as in (22) on top of the following page for reasons of space. Note that here CC_{\ell} denotes the \ell-th user’s individual capacity.

CDPC(μ,𝐇,ρ)=max=1Lρρ=1Lμ[log21+ρ𝐡(𝐒(1))1𝐡H].C_{\textrm{DPC}}\left(\mu,\mathbf{H},\rho\right)=\underset{\sum\nolimits_{\ell=1}^{L}\rho_{\ell}\leq\rho}{\textrm{max}}\hskip 3.0pt\sum\limits_{\ell=1}^{L}\mu_{\ell}\left[\hskip 2.0pt\log_{2}1+\rho_{\ell}\hskip 2.0pt\mathbf{h}_{\ell}\left(\mathbf{S}^{\hskip 1.0pt\left(\ell-1\right)}\right)^{-1}\mathbf{h}_{\ell}^{H}\hskip 1.0pt\right]. (22)

In (22), 𝐒(1)=𝐈M+j=11ρj𝐡jH𝐡j\mathbf{S}^{(\ell-1)}=\mathbf{I}_{M}+\sum\nolimits_{j=1}^{\ell-1}\rho_{j}\hskip 1.0pt\mathbf{h}_{j}^{H}\hskip 1.0pt\mathbf{h}_{j}. The result which follows, shows that if we limit ourselves to linear power allocation policies, then the maximization problem of (22) can be decoupled at higher SNRs. Following the arguments in [3, 9], with MLM\geq{}L, for any β=ρ/ρ>0\beta_{\ell}=\rho_{\ell}/\rho>0, =1,2,,L\forall\ell=1,2,\dots,L with condition =1Lβ=1\sum\nolimits_{\ell=1}^{L}\beta_{\ell}=1, we can write

limρ{=1Lμ[log21+ρβ𝐡(𝐒(1))1𝐡H]\displaystyle\underset{\rho\rightarrow{}\infty}{\textrm{lim}}\left\{\sum\limits_{\ell=1}^{L}\mu_{\ell}\left[\log_{2}1+\rho\hskip 1.0pt\beta_{\ell}\hskip 2.0pt\mathbf{h}_{\ell}\hskip 1.0pt\left(\mathbf{S}^{(\ell-1)}\right)^{-1}\mathbf{h}_{\ell}^{H}\right]\right.
=1Lμ(log21+βρ𝐟2)}=0,\displaystyle\left.\hskip 35.0pt-\sum\limits_{\ell=1}^{L}\mu_{\ell}\left(\log_{2}1+\beta_{\ell}\rho\left\|\mathbf{f}_{\ell}\right\|^{2}\right)\right\}=0, (23)

where 𝐟\mathbf{f}_{\ell} is the projection of 𝐡\mathbf{h}_{\ell} on to the matrix null space of {𝐡1,𝐡2,,𝐡1}\{\mathbf{h}_{1},\mathbf{h}_{2},\dots,\mathbf{h}_{\ell-1}\}. That is, instead of solving (22) directly, the following optimization setup will yield an asymptotically identical solution. That is,

max=1Lρρ=1Lμ(log21+ρ𝐟2).\underset{\sum\nolimits_{\ell=1}^{L}\rho_{\ell}\leq{}\rho}{\textrm{max}}\sum\limits_{\ell=1}^{L}\hskip 1.0pt\mu_{\ell}\left(\log_{2}1+\rho_{\ell}\left\|\mathbf{f}_{\ell}\right\|^{2}\right).\vspace{-2pt} (24)

The Karush–Kuhn–Tucker conditions (see e.g., [3, 7]) to the problem presented in (24) yields the solution

ρ=μρ+μ(i=1iL1𝐟i2)1𝐟2,\rho_{\ell}*=\mu_{\ell}\hskip 1.0pt\rho{}+\mu_{\ell}\left(\sum\limits_{\begin{subarray}{c}i=1\\ i\neq{}\ell\end{subarray}}^{L}\frac{1}{||\mathbf{f}_{i}||^{2}}\right)-\frac{1}{||\mathbf{f}_{\ell}||^{2}},\vspace{-5pt} (25)

for =1,2,,L\ell=1,2,\dots,L. Therefore, at high SNRs, we have

ρ=μρ+𝒪(1).\rho_{\ell}*=\mu_{\ell}\rho+\mathcal{O}\left(1\right).\vspace{-4pt} (26)

Since the order one term leads to a vanishes with SNR, allocating power according to ρ=ρμ\rho_{\ell}=\rho\hskip 1.0pt\mu_{\ell}, =1,2,L\forall{}\ell=1,2,\dots L maximizes (25). Meanwhile, the weighted sum capacity with ZF processing is given by [7]

CZF(μ,𝐇,ρ)=max=1Lρ<ρ=1Lμ[log21+ρ𝐠2],C_{\textrm{ZF}}\left(\mu,\mathbf{H},\rho\right)=\underset{\sum\nolimits_{\ell=1}^{L}\rho_{\ell}<\rho}{\textrm{max}}\hskip 2.0pt\sum\limits_{\ell=1}^{L}\mu_{\ell}\left[\log_{2}1+\rho_{\ell}\hskip 1.0pt||\mathbf{g}_{\ell}||^{2}\right],\vspace{-4pt} (27)

where 𝐠\mathbf{g}_{\ell} is the projection of 𝐡\mathbf{h}_{\ell} onto the matrix null space of {𝐡1,𝐡2,,𝐡1,𝐡+1,,𝐡L}\{\mathbf{h}_{1},\mathbf{h}_{2},\dots,\mathbf{h}_{\ell-1},\mathbf{h}_{\ell+1},\dots,\mathbf{h}_{L}\}. Rather interestingly, the optimization problem quoted in (27) is identical as that quoted in (25), with the exception that 𝐟\mathbf{f}_{\ell} is replaced by 𝐠\mathbf{g}_{\ell} which does not contribute to the asymptotic solution. This only affects the 𝒪(1)\mathcal{O}(1) term in (26) and thus the power allocation policy of ρ=μρ\rho_{\ell}=\mu_{\ell}\rho is also the asymptotic solution to (27).

Using the asymptotically optimal power allocation, the weighted sum capacity of DPC can be expressed as

CDPC(μ,𝐇,ρ)=1Lμ[log21+ρμ𝐟2],C_{\textrm{DPC}}\left(\mu,\mathbf{H},\rho\right)\approx\sum\limits_{\ell=1}^{L}\mu_{\ell}\left[\hskip 1.0pt\log_{2}1+\rho\hskip 1.0pt\mu_{\ell}\hskip 1.0pt||\mathbf{f}_{\ell}||^{2}\hskip 1.0pt\right],\vspace{-5pt} (28)

while the weighted sum capacity for ZF can be written as

CZF(μ,𝐇,ρ)=1Lμ[log21+ρμ𝐠2].\vspace{-4pt}C_{\textrm{ZF}}\left(\mu,\mathbf{H},\rho\right)\approx\sum\limits_{\ell=1}^{L}\mu_{\ell}\left[\log_{2}1+\rho\hskip 1.0pt\mu_{\ell}\hskip 1.0pt||\mathbf{g}_{\ell}||^{2}\right].\vspace{4pt} (29)

Note that (28) and (29) utilize the classical affine approximation. Thus, the instantaneous sum capacity loss per-channel realization is given by

ClossDPC-ZF*(μ,𝐇,ρ)=1Lμ[log2𝐟2𝐠2].C_{\textrm{loss}}^{\textrm{DPC-ZF*}}\left(\mu,\mathbf{H},\rho\right)\approx\sum\limits_{\ell=1}^{L}\mu_{\ell}\left[\log_{2}\frac{||\mathbf{f}_{\ell}||^{2}}{||\mathbf{g}_{\ell}||^{2}}\right].\vspace{-2pt} (30)

As such, the expected capacity loss can be computed by evaluating 𝔼{ClossDPC-ZF*(μ,𝐇,ρ)}\mathbb{E}\{C_{\textrm{loss}}^{\textrm{DPC-ZF*}}(\mu,\mathbf{H},\rho)\}. In the following section, for a given channel realization, we demonstrate the negligible difference between the true weighted sum capacity and the weighted sum capacity achievable using the derived power allocation solution in Sec. IV, i.e., ρ=ρμ\rho_{\ell}=\rho\hskip 1.0pt\mu_{\ell}.

V Numerical Results

We consider the setting where the BS is located at the origin of a circular cell having a radius 100 m. The users are uniformly distributed within the cell with respect to its area. We assume operation at 3.7 GHz, where λ={\lambda}=8.1 cm and employ d=0.5λd=0.5\lambda inter-element antenna spacing at the BS array. We assume uniformly distributed LOS steering angles to each user from the BS, denoted earlier as ϕm\phi_{m}, within the interval [0,2π][0,2\pi] across the azimuthal plane. Unless otherwise stated, we assume the following parameters: The BS is equipped with a ULA of M=M= 64 elements, serving L=L= 8 users for single-antenna (N=N= 1), single-stream transmission. For multi-stream transmission, we consider service to L=L= 4 users, each having N=N= 2 receive antennas, such that the total number of receive antennas across all terminals remains consistent with the single-stream case for comparison purposes. For single-stream transmission, ZF precoding and DPC performance is evaluated, while for multi-stream, BD precoding and DPC performance is evaluated.

Refer to caption
Figure 1: Expected sum capacity vs. operating SNRs with DPC, BD and ZF processing.

Figure 1 depicts the expected sum capacity performance as a function of operating SNRs. The top sub-figure shows the DPC performance relative to BD and ZF, for thr baseline case of Rayleigh fading channels. As such, κ=0\kappa_{\ell}=0, =1,2,L\forall{}\ell=1,2,\dots L. Several important trends can be noted: (1) We can observe that both ZF and BD suffer from an expected capacity loss relative to DPC across all SNRs. This is due to a penalty in the desired signal power incurred in orthogonalizing interfering channels. (2) At both high and low SNRs, the achieved capacities converge for both optimal (DPC) and sub-optimal (BD and ZF) precoding, where their performance is comparable to DPC. This is since at high SNRs, the desired power penalty is less pronounced (in magnitude) due to the scaling of the ZF/BD beamforming vectors/matrices by high operating SNRs. In contrast, at low SNRs, noise power dominates performance, and thus all techniques yield almost equal performance. (3) BD performance is marginally better than ZF due to multi-stream transmission, as also observed by [7]. In contrast to the top sub-figure, the middle and bottom sub-figures depict the expected sum capacity performance with fixed κ=\kappa_{\ell}=1 dB and κ=\kappa_{\ell}=20 dB =1,2,,L\forall{}\ell=1,2,\dots,L. These serve as test cases denoting low and high LOS powers. The performance obtained with low LOS powers is similar to the baseline case of Rayleigh fading. However, the expected sum capacity performance is significantly lower at higher Ricean KK-factors across all SNRs. This is due to the ill-conditioning of the matrix inverse for both ZF and BD, respectively. As shown in [1], with strong LOS presence, the condition number of the inverted matrix (ratio of the largest to smallest singular values of the composite channel covariance matrix) is larger (on the order of 20 dB on average via simulations) relative to the case with strong NLOS conditions. This implies that strong LOS increases the spread of singular values relative to strong NLOS, inducing higher correlation levels and thereby reducing performance. Moreover, with high KK-factors, the relative gap between DPC and ZF, BD performance at higher SNRs tends to increase, in comparison to the Rayleigh fading.

Refer to caption
Figure 2: Expected sum capacity vs. operating SNRs for varying MM.

In the general case, when each user has a specific KK-factor, we consider the model adopted in [11]. Here, κln(9,5),=1,2,,L\kappa_{\ell}\sim{}\textrm{ln}(9,5),\forall{}\ell=1,2,\dots,L, i.e., the KK-factors are drawn from a lognormal distribution with mean of 9 dB and variance of 5 dB. Figure 2 depicts the expected sum capacity performance as a function of operating SNRs for the case where each user has a specific KK-factor. The top sub-figure shows DPC, BD and ZF performance with M=64M=64, while the bottom sub-figure shows the equivalent performance with M=32M=32, where a proportional reduction in the expected sum capacities is observed, as expected. For the M=64M=64 case, one can observe that the expected sum capacities yield values in between those for low and high KK-factor cases in Figure 1. This is since on average, KK-factor values close to 9 dB are drawn (between 1 dB and 20 dB), yet the lognormal nature of KK-factor density occasionally yields larger KK values, skewing the result.

Refer to caption
Figure 3: Expected sum capacity loss between DPC and ZF, BD precoding vs. operating SNRs.

Figure 3 demonstrates the expected sum capacity loss between DPC and ZF, as well as BD precoding when each user has κln(9,5),=1,2,,L\kappa_{\ell}\sim{}\textrm{ln}(9,5),\forall{}\ell=1,2,\dots,L. One can observe that the derived approximations of the expected capacity loss in (12)-(18) and (19)-(21) for both ZF and BD precoding tightly match the simulated expected sum capacity loss. This confirms the generality of our analysis, as promised earlier in the paper.

Refer to caption
Figure 4: Weighted sum capacity difference between the derived exact and asymptotic solutions with N=1N=1, i.e., for DPC and ZF precoding.

Figure 4 demonstrates the weighted sum capacity difference, referred to as the “sum capacity error” on the yy-axis of the figure, between the solution in (22) and the asymptotic solution of ρ=ρμ,=1,2,,L\rho_{\ell}=\rho\hskip 1.0pt\mu_{\ell}\hskip 1.0pt,\forall{}\ell=1,2,\dots,L. Since single-stream transmission is required, the result is shown for L=2L=2, N=1N=1 and M=32M=32 with fixed κ1\kappa_{1} and κ2ln(9,5)\kappa_{2}\sim{}\textrm{ln}(9,5). We fix μ1=\mu_{1}=0.6 and μ2=\mu_{2}=0.4 for three instantaneous channel realizations to both users. We can observe that the sum capacity error is negligible across the entire SNR range considered. This is interesting, since even though the derived expressions rely on high SNRs, the analysis methodology seems to be applicable over a much wider range of SNRs, demonstrating its generality.

VI Conclusions

We approximate the difference between the expected sum capacity achieved by optimal and sub-optimal precoding techniques of DPC, ZF and BD. Our analysis methodology utilizes the affine approximation and computes the asymptotic capacity loss for multiuser broadcast channels. Unlike previously, our analysis caters for the more general propagation conditions captured by Ricean fading and considers maximum channel heterogeneity across multiple users by considering user specific parameters. It is shown that linear precoding techniques incur a moderately high expected sum capacity loss penalty relative to DPC, yet this penalty is much smaller at high SNRs and in pure NLOS conditions. We generalized our analysis to problem of weighted sum capacity maximization. We show that allocating power proportional to user weights is asymptotically optimal at high SNR.

References

  • [1] F. Rusek, et al., “Scaling up MIMO: Opportunities and challenges with very large arrays,” IEEE Signal Process. Mag., vol. 30, no. 1, pp. 40-60, Jan. 2013.
  • [2] M. Costa, “Writing on dirty paper,” IEEE Trans. Inf. Theory, vol. 23, no, 9, pp. 439-441, May 1983.
  • [3] N. Jindal, “High SNR analysis of MIMO broadcast channels,” in Proc. IEEE ISIT, Sep. 2005, pp. 2310-2314.
  • [4] J. Nam, et al., “On the role of transmit correlation diversity in multiuser MIMO systems,” IEEE Trans. Inf. Theory, vol. 63, no. 1, pp. 336-354, Jan. 2017.
  • [5] G. Caire and S. Shamai, “On the achievable throughput of a multiantenna Gaussian broadcast channel,” IEEE Trans. Inf. Theory, vol. 49, no. 7, pp. 1691-1706, Jun. 2003.
  • [6] A. Lozano, et al., “High-SNR power offset in multiantenna communication,” IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4134-4151, Nov. 2011.
  • [7] J. Lee and N. Jindal, “Dirty paper coding vs. linear precoding for MIMO broadcast channels,” in Proc. IEEE ASILOMAR, Oct. 2006, pp. 779-783.
  • [8] S. Shamai and S. Verdu, “The impact of frequency-flat fading on the spectral efficiency of CDMA,” IEEE Trans Inf. Theory, vol. 47, no. 5, pp. 1302-1327, May 2001.
  • [9] N. Jindal and A. J. Goldmsmith, “Dirty paper coding versus TDMA for MIMO broadcast channels,” IEEE Trans on Inf. Theory, vol. 51, no. 5, pp. 1783-1794, May 2005.
  • [10] Z. Shen, et al., “Sum capacity of multiuser MIMO broadcast channels with block diagonalization,” in Proc. IEEE ISIT, Jul. 2006, pp. 886-890.
  • [11] H. Tataria, et al., “Performance and analysis of downlink multiuser MIMO systems with regularized zero-forcing precoding in Ricean fading channels,” in Proc. IEEE ICC, May 2016.
  • [12] S. Vishwanath, et al., “Duality, achievable rates and, and sum-rate capacity of Gaussian MIMO broadcast channels,” IEEE Trans Inf. Theory, vol. 49, no. 10, pp. 2658-2668, Oct. 2003.
  • [13] H. Tataria, et al., “On the general analysis of coordinated regularized zero-forcing precoding: An application to two-tier small-cell networks,” IEEE Trans. Commun., vol. 65, no. 7, pp. 3133-3150, Apr. 2017.
  • [14] Q. Zhang, et al., “Power scaling of uplink massive MIMO systems with arbitrary-rank channel means,” IEEE J. Sel. Topics Signal Process., vol. 8, no. 5, pp. 966-981, Oct. 2014.
  • [15] A. M. Tulino and S. Verdu, “Random matrix theory and wireless communications,” Foundations and Trends in Commun. and Inf. Theory, vol. 1, no. 1, pp. 1–182, Jun. 2004.
  • [16] Y.-H. Kim and A. Lapidoth, “On the log determinant of non-central Wishart matrices,” in Proc. IEEE ISIT, Jun. 2003, pp. 54.
  • [17] I. S. Gradshteyn and I. M. Ryzhik, Table of Integrals, Series, and Products, Academic Press, 2007.