Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1801.02987

Multiplexing Analysis of Millimeter-Wave Massive MIMO Systems

Dian-Wu Yue·Ha H. Nguyen·Shuai Xu
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper is concerned with spatial multiplexing analysis for millimeter-wave (mmWave) massive MIMO systems. For a single-user mmWave system employing distributed antenna subarray architecture in which the transmitter and receiver consist of Kt and Kr subarrays, respectively, an asymptotic multiplexing gain formula is firstly derived when the numbers of antennas at subarrays go to infinity. Specifically, assuming that all subchannels have the same average number of propagation paths L, the formula implies that by employing such a distributed antenna-subarray architecture, an exact average maximum multiplexing gain of KrKtL can be achieved. This result means that compared to the co-located antenna architecture, using the distributed antenna-subarray architecture can scale up the maximum multiplexing gain proportionally to KrKt. In order to further reveal the relation between diversity gain and multiplexing gain, a simple characterization of the diversity-multiplexing tradeoff is also given. The multiplexing gain analysis is then extended to the multiuser scenario. Moreover, simulation results obtained with the hybrid analog/digital processing corroborate the analysis results.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dian-Wu Yue, Ha H. Nguyen, Shuai Xu. 2018-07-29. Multiplexing Analysis of Millimeter-Wave Massive MIMO Systems. https://arxiv.org/abs/1801.02987

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↗