Search arXivSearch

arXiv · 1102.1462

Diversity of MMSE MIMO Receivers

Abstract

In most MIMO systems, the family of waterfall error curves, calculated at different spectral efficiencies, are asymptotically parallel at high SNR. In other words, most MIMO systems exhibit a single diversity value for all fixed rates. The MIMO MMSE receiver does not follow this pattern and exhibits a varying diversity in its family of error curves. This work analyzes this interesting behavior of the MMSE MIMO receiver and produces the MMSE MIMO diversity at all rates. The diversity of the quasi-static flat-fading MIMO channel consisting of any arbitrary number of transmit and receive antennas is fully characterized, showing that full spatial diversity is possible if and only if the rate is within a certain bound which is a function of the number of antennas. For other rates, the available diversity is fully characterized. At sufficiently low rates, the MMSE receiver has a diversity similar to the maximum likelihood receiver (maximal diversity), while at high rates it performs similarly to the zero-forcing receiver (minimal diversity). Linear receivers are also studied in the context of the MIMO multiple access channel (MAC). Then, the quasi-static frequency selective MIMO channel is analyzed under zero-padding (ZP) and cyclic-prefix (CP) block transmissions and MMSE reception, and lower and upper bounds on diversity are derived. For the special case of SIMO under CP, it is shown that the above-mentioned bounds are tight.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ahmed Hesham Mehana, Aria Nosratinia. 2012-10-08. Diversity of MMSE MIMO Receivers. https://arxiv.org/abs/1102.1462

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT