Spectral Efficiency Analysis of Multi-Cell Massive MIMO Systems with Ricean Fading

This paper investigates the spectral efficiency of multi-cell massive multiple-input multiple-output systems with Ricean fading that utilize the linear maximal-ratio combining detector. We firstly present closed-form expressions for the effective signal-to-interference-plus-noise ratio (SINR) with the least squares and minimum mean squared error (MMSE) estimation methods, respectively, which apply for any number of base-station antennas $M$ and any Ricean $K$-factor. Also, the obtained results can be particularized in Rayleigh fading conditions when the Ricean $K$-factor is equal to zero. In the following, novel exact asymptotic expressions of the effective SINR are derived in the high $M$ and high Ricean $K$-factor regimes. The corresponding analysis shows that pilot contamination is removed by the MMSE estimator when we consider both infinite $M$ and infinite Ricean $K$-factor, while the pilot contamination phenomenon persists for the rest of cases. All the theoretical results are verified via Monte-Carlo simulations.Comment: 15 pages, 2 figures, the tenth International Conference on Wireless Communications and Signal Processing (WCSP 2018), to appea

Channel Estimation and Symbol Detection In Massive MIMO Systems Using Expectation Propagation

The advantages envisioned from using large antenna arrays have made massive multiple- input multiple-output systems (also known as massive MIMO) a promising technology for future wireless standards. Despite the advantages that massive MIMO systems provide, increasing the number of antennas introduces new technical challenges that need to be resolved. In particular, symbol detection is one of the key challenges in massive MIMO. Obtaining accurate channel state information (CSI) for the extremely large number of chan- nels involved is a difficult task and consumes significant resources. Therefore for Massive MIMO systems coherent detectors must be able to cope with highly imperfect CSI. More importantly, non-coherent schemes which do not rely on CSI for symbol detection become very attractive. Expectation propagation (EP) has been recently proposed as a low complexity algo- rithm for symbol detection in massive MIMO systems , where its performance is evaluated on the premise that perfect channel state information (CSI) is available at the receiver. However, in practical systems, exact CSI is not available due to a variety of reasons in- cluding channel estimation errors, quantization errors and aging. In this work we study the performance of EP in the presence of imperfect CSI due to channel estimation er- rors and show that in this case the EP detector experiences significant performance loss. Moreover, the EP detector shows a higher sensitivity to channel estimation errors in the high signal-to-noise ratio (SNR) regions where the rate of its performance improvement decreases. We investigate this behavior of the EP detector and propose a Modified EP detector for colored noise which utilizes the correlation matrix of the channel estimation error. Simulation results verify that the modified algorithm is robust against imperfect CSI and its performance is significantly improved over the EP algorithm, particularly in the higher SNR regions, and that for the modified detector, the slope of the symbol error rate (SER) vs. SNR plots are similar to the case of perfect CSI. Next, an algorithm based on expectation propagation is proposed for noncoherent symbol detection in large-scale SIMO systems. It is verified through simulation that in terms of SER, the proposed detector outperforms the pilotbased coherent MMSE detector for blocks as small as two symbols. This makes the proposed detector suitable for fast fading channels with very short coherence times. In addition, the SER performance of this detec- tor converges to that of the optimum ML receiver when the size of the blocks increases. Finally it is shown that for Rician fading channels, knowledge of the fading parameters is not required for achieving the SER gains. A channel estimation method was recently proposed for multi-cell massive MIMO sys- tems based on the eigenvalue decomposition of the correlation matrix of the received vectors (EVD-based). This algorithm, however, is sensitive to the size of the antenna array as well as the number of samples used in the evaluation of the correlation matrix. As the final work in this dissertation, we present a noncoherent channel estimation and symbol de- tection scheme for multi-cell massive MIMO systems based on expectation propagation. The proposed algorithm is initialized with the channel estimation result from the EVD- based method. Simulation results show that after a few iterations, the EP-based algorithm significantly outperforms the EVD-based method in both channel estimation and symbol error rate. Moreover, the EP-based algorithm is not sensitive to antenna array size or the inaccuracies of sample correlation matrix

From nominal to true a posteriori probabilities: an exact Bayesian theorem based probabilistic data association approach for iterative MIMO detection and decoding

It was conventionally regarded that the existing probabilistic data association (PDA) algorithms output the estimated symbol-wise a posteriori probabilities (APPs) as soft information. In this paper, however, we demonstrate that these probabilities are not the true APPs in the rigorous mathematicasense, but a type of nominal APPs, which are unsuitable for the classic architecture of iterative detection and decoding (IDD) aided receivers. To circumvent this predicament, we propose an exact Bayesian theorem based logarithmic domain PDA (EB-Log-PDA) method, whose output has similar characteristics to the true APPs, and hence it is readily applicable to the classic IDD architecture of multiple-input multiple-output (MIMO) systems using the general M-ary modulation. Furthermore, we investigate the impact of the PDA algorithms' inner iteration on the design of PDA-aided IDD receivers. We demonstrate that introducing inner iterations into PDAs, which is common practice in PDA-aided uncoded MIMO systems, would actually degrade the IDD receiver's performance, despite significantly increasing the overall computational complexity of the IDD receiver. Finally, we investigate the relationship between the extrinsic log-likelihood ratio (LLRs) of the proposed EB-Log-PDA and of the approximate Bayesian theorem based logarithmic domain PDA (AB-Log-PDA) reported in our previous work. We also show that the IDD scheme employing the EB-Log-PDA without incorporating any inner PDA iterations has an achievable performance close to that of the optimal maximum a posteriori (MAP) detector based IDD receiver, while imposing a significantly lower computational complexity in the scenarios considered