Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1708.01443

Impact of Line-of-Sight and Unequal Spatial Correlation on Uplink MU-MIMO Systems

Harsh Tataria·Peter J. Smith·Larry J. Greenstein·Pawel A. Dmochowski·Michail Matthaiou
View original source ↗Read source document ↗Export metadata ↓

Abstract

Closed-form approximations of the expected per-terminal signal-to-interference-plus-noise-ratio (SINR) and ergodic sum spectral efficiency of a multiuser multiple-input multiple-output system are presented. Our analysis assumes spatially correlated Ricean fading channels with maximum-ratio combining on the uplink. Unlike previous studies, our model accounts for the presence of unequal correlation matrices, unequal Rice factors, as well as unequal link gains to each terminal. The derived approximations lend themselves to useful insights, special cases and demonstrate the aggregate impact of line-of-sight (LoS) and unequal correlation matrices. Numerical results show that while unequal correlation matrices enhance the expected SINR and ergodic sum spectral efficiency, the presence of strong LoS has an opposite effect. Our approximations are general and remain insensitive to changes in the system dimensions, signal-to-noise-ratios, LoS levels and unequal correlation levels.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Harsh Tataria, Peter J. Smith, Larry J. Greenstein, Pawel A. Dmochowski, Michail Matthaiou. 2017-08-04. Impact of Line-of-Sight and Unequal Spatial Correlation on Uplink MU-MIMO Systems. https://doi.org/10.1109/lwc.2017.2726062

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗