The Impact of Physical Channel on Performance of Subspace-Based Channel Estimation in Massive MIMO Systems

Abstract

A subspace method for channel estimation has been recently proposed [1] for tackling the pilot contamination effect, which is regarded by some researchers as a bottleneck in massive MIMO systems. It was shown in [1] that if the power ratio between the desired signal and interference is kept above a certain value, the received signal spectrum splits into signal and interference eigenvalues, namely, the "pilot contamination" effect can be completely eliminated. However, [1] assumes an independently distributed (i.d.) channel, which is actually not much the case in practice. Considering this, a more sensible finite-dimensional physical channel model (i.e., a finite scattering environment, where signals impinge on the base station (BS) from a finite number of angles of arrival (AoA)) is employed in this paper. Via asymptotic spectral analysis, it is demonstrated that, compared with the i.d. channel, the physical channel imposes a penalty in the form of an increased power ratio between the useful signal and the interference. Furthermore, we demonstrate an interesting "antenna saturation" effect, i.e., when the number of the BS antennas approaches infinity, the performance under the physical channel with P AoAs is limited by and nearly the same as the performance under the i.d. channel with P receive antennas.Index Terms-massive MIMO, physical channel, subspace method, random matrix theory, asymptotic eigenvalue distribution 1536-1276 (c)

On the spectral efficiency of space-constrained massive MIMO with linear receivers

“…We start from (11), and apply Jensen's inequality on the convex function log 2 (1 + a exp(x)) for a > 0 to get…”

Fast iterative WSVT algorithm in WNN minimization problem for multiuser massive MIMO channel estimation

“…For multiple users, can be written in the matrix form as where G denotes the P × K path gain matrix. There are P fixed scatterers around the BS and all users who are geographically separated in the cell are accessible to the P scatterers as shown in Figure . Under this condition all users will have same steering matrix (ie, AoAs), which introduce the correlation between the channel vectors and hence increase in the condition number of the channel matrix. Therefore, the channel can be approximated as a low‐rank channel.…”

“…The Landweber iteration takes more number of iteration for the algorithm to converge. Since in channel updating equation, to construct a new channel matrix only the previous iterate channel matrix is taken as in (12). Hence, to speed up the rate of convergence, the previous 2 estimates and dynamically varying step size are considered.…”

Downlink Secrecy Rate of One-Bit Massive MIMO System with Active Eavesdropping

“…When R-AN approach is used, from(27) we have S = I N . Hence,σ 2,R-AN e 2θβ e p d /π + β e p d σ 2 q + 1(123)as N grows large which follows from the strong law of large numbers.March 3, 2020 DRAFT When NS-AN approach is used, from(27), we have S = I N − P proj .…”

“…Case 2: Again, from (27) we have S = I N − P proj when NS-AN scheme is used, where P proj = Using (100) we write…”