MMSE analysis of certain large isometric random precoded systems

Linear precoding consists in multiplying by an N*K matrix a K-dimensional vector obtained by serial-to-parallel conversion of a symbol sequence to be transmitted. In this paper, new tools, borrowed from the so-called free probability theory, are introduced for the purpose of analyzing the performance of minimum mean-square error (MMSE) receivers for certain large random isometric precoded systems on fading channels. The isometric condition represents the case of precoding matrices with orthonormal columns. It is shown in this contribution that the signal-to-interferenceplus-noise ratio (SINR) at the equalizer output converges almost surely to a deterministic value depending on the probability distribution of the channel coefficients when N(longrightarrow)+(infinity) and K/N(longrightarrow)(alpha)<=1. These asymptotic results are used to analyze the impact of orthogonal spreading as well as to optimally balance the redundancy introduced between linear precoding versus classical convolutional coding, while preserving a simple MMSE equalization scheme at the receiver.