Nearest Neighbor Decoding in MIMO Block-Fading Channels With Imperfect CSIR

This paper studies communication outages in multiple-input multiple-output (MIMO) block-fading channels with imperfect channel state information at the receiver (CSIR). Using mismatched decoding error exponents, we prove the achievability of the generalized outage probability, the probability that the generalized mutual information (GMI) is less than the data rate, and show that this probability is the fundamental limit for independent and identically distributed (i.i.d.) codebooks. Then, using nearest neighbor decoding, we study the generalized outage probability in the high signal-to-noise ratio (SNR) regime for random codes with Gaussian and discrete signal constellations. In particular, we study the SNR exponent, which is defined as the high-SNR slope of the error probability curve on a logarithmic-logarithmic scale. We show that the maximum achievable SNR exponent of the imperfect CSIR case is given by the SNR exponent of the perfect CSIR case times the minimum of one and the channel estimation error diversity. Random codes with Gaussian constellations achieve the optimal SNR exponent with finite block length as long as the block length is larger than a threshold. On the other hand, random codes with discrete constellations achieve the optimal SNR exponent with block length growing with the logarithm of the SNR. The results hold for many fading distributions, including Rayleigh, Rician, Nakagami- , Nakagami- and Weibull as well as for optical wireless scintillation distributions such as lognormal-Rice and gamma-gamma.