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

Design and Performance Analysis of Non-Coherent Detection Systems with Massive Receiver Arrays

Harvesting the gain of a large number of antennas in a mmWave band has mainly been relying on the costly operation of channel state information (CSI) acquisition and cumbersome phase shifters. Recent works have started to investigate the possibility to use receivers based on energy detection (ED), where a single data stream is decoded based on the channel and noise energy. The asymptotic features of the massive receiver array lead to a system where the impact of the noise becomes predictable due to a noise hardening effect. This in effect extends the communication range compared to the receiver with a small number of antennas, as the latter is limited by the unpredictability of the additive noise. When the channel has a large number of spatial degrees of freedom, the system becomes robust to imperfect channel knowledge due to channel hardening. We propose two detection methods based on the instantaneous and average channel energy, respectively. Meanwhile, we design the detection thresholds based on the asymptotic properties of the received energy. Differently from existing works, we analyze the scaling law behavior of the symbol-error-rate (SER). When the instantaneous channel energy is known, the performance of ED approaches that of the coherent detection in high SNR scenarios. When the receiver relies on the average channel energy, our performance analysis is based on the exact SER, rather than an approximation. It is shown that the logarithm of SER decreases linearly as a function of the number of antennas. Additionally, a saturation appears at high SNR for PAM constellations of order larger than two, due to the uncertainty on the channel energy. Simulation results show that ED, with a much lower complexity, achieves promising performance both in Rayleigh fading channels and in sparse channels

On the MISO Channel with Feedback: Can Infinitely Massive Antennas Achieve Infinite Capacity?

We consider communication over a multiple-input single-output (MISO) block fading channel in the presence of an independent noiseless feedback link. We assume that the transmitter and receiver have no prior knowledge of the channel state realizations, but the transmitter and receiver can acquire the channel state information (CSIT/CSIR) via downlink training and feedback. For this channel, we show that increasing the number of transmit antennas to infinity will not achieve an infinite capacity, for a finite channel coherence length and a finite input constraint on the second or fourth moment. This insight follows from our new capacity bounds that hold for any linear and nonlinear coding strategies, and any channel training schemes. In addition to the channel capacity bounds, we also provide a characterization on the beamforming gain that is also known as array gain or power gain, at the regime with a large number of antennas.Comment: This work has been submitted to the IEEE Transactions on Information Theory. It was presented in part at ISIT201

Oversampling Increases the Pre-Log of Noncoherent Rayleigh Fading Channels

We analyze the capacity of a continuous-time, time-selective, Rayleigh block-fading channel in the high signal-to-noise ratio (SNR) regime. The fading process is assumed stationary within each block and to change independently from block to block; furthermore, its realizations are not known a priori to the transmitter and the receiver (noncoherent setting). A common approach to analyzing the capacity of this channel is to assume that the receiver performs matched filtering followed by sampling at symbol rate (symbol matched filtering). This yields a discrete-time channel in which each transmitted symbol corresponds to one output sample. Liang & Veeravalli (2004) showed that the capacity of this discrete-time channel grows logarithmically with the SNR, with a capacity pre-log equal to $1-{Q}/{N}$. Here, $N$ is the number of symbols transmitted within one fading block, and $Q$ is the rank of the covariance matrix of the discrete-time channel gains within each fading block. In this paper, we show that symbol matched filtering is not a capacity-achieving strategy for the underlying continuous-time channel. Specifically, we analyze the capacity pre-log of the discrete-time channel obtained by oversampling the continuous-time channel output, i.e., by sampling it faster than at symbol rate. We prove that by oversampling by a factor two one gets a capacity pre-log that is at least as large as $1-1/N$. Since the capacity pre-log corresponding to symbol-rate sampling is $1-Q/N$, our result implies indeed that symbol matched filtering is not capacity achieving at high SNR.Comment: To appear in the IEEE Transactions on Information Theor

Target localization in MIMO radar systems

MIMO (Multiple-Input Multiple-Output) radar systems employ multiple antennas to transmit multiple waveforms and engage in joint processing of the received echoes from the target. MIMO radar has been receiving increasing attention in recent years from researchers, practitioners, and funding agencies. Elements of MIMO radar have the ability to transmit diverse waveforms ranging from independent to fully correlated. MIMO radar offers a new paradigm for signal processing research. In this dissertation, target localization accuracy performance, attainable by the use of MIMO radar systems, configured with multiple transmit and receive sensors, widely distributed over an area, are studied. The Cramer-Rao lower bound (CRLB) for target localization accuracy is developed for both coherent and noncoherent processing. The CRLB is shown to be inversely proportional to the signal effective bandwidth in the noncoherent case, but is approximately inversely proportional to the carrier frequency in the coherent case. It is shown that optimization over the sensors\u27 positions lowers the CRLB by a factor equal to the product of the number of transmitting and receiving sensors. The best linear unbiased estimator (BLUE) is derived for the MIMO target localization problem. The BLUE\u27s utility is in providing a closed-form localization estimate that facilitates the analysis of the relations between sensors locations, target location, and localization accuracy. Geometric dilution of precision (GDOP) contours are used to map the relative performance accuracy for a given layout of radars over a given geographic area. Coherent processing advantage for target localization relies on time and phase synchronization between transmitting and receiving radars. An analysis of the sensitivity of the localization performance with respect to the variance of phase synchronization error is provided by deriving the hybrid CRLB. The single target case is extended to the evaluation of multiple target localization performance. Thus far, the analysis assumes a stationary target. Study of moving target tracking capabilities is offered through the use of the Bayesian CRLB for the estimation of both target location and velocity. Centralized and decentralized tracking algorithms, inherit to distributed MIMO radar architecture, are proposed and evaluated. It is shown that communication requirements and processing load may be reduced at a relatively low performance cost