Search arXivSearch

arXiv · cs/0502063

Nonlinear MMSE Multiuser Detection Based on Multivariate Gaussian Approximation

Abstract

In this paper, a class of nonlinear MMSE multiuser detectors are derived based on a multivariate Gaussian approximation of the multiple access interference. This approach leads to expressions identical to those describing the probabilistic data association (PDA) detector, thus providing an alternative analytical justification for this structure. A simplification to the PDA detector based on approximating the covariance matrix of the multivariate Gaussian distribution is suggested, resulting in a soft interference cancellation scheme. Corresponding multiuser soft-input, soft-output detectors delivering extrinsic log-likelihood ratios are derived for application in iterative multiuser decoders. Finally, a large system performance analysis is conducted for the simplified PDA, showing that the bit error rate performance of this detector can be accurately predicted and related to the replica method analysis for the optimal detector. Methods from statistical neuro-dynamics are shown to provide a closely related alternative large system prediction. Numerical results demonstrate that for large systems, the bit error rate is accurately predicted by the analysis and found to be close to optimal performance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peng Hui Tan, Lars K. Rasmussen. 2005-02-14. Nonlinear MMSE Multiuser Detection Based on Multivariate Gaussian Approximation. https://arxiv.org/abs/cs/0502063

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