Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1708.07605

Spatial- and Frequency-Wideband Effects in Millimeter-Wave Massive MIMO Systems

Bolei Wang·Feifei Gao·Shi Jin·Hai Lin·Geoffrey Ye Li
View original source ↗Read source document ↗Export metadata ↓

Abstract

When there are a large number of antennas in massive MIMO systems, the transmitted wideband signal will be sensitive to the physical propagation delay of electromagnetic waves across the large array aperture, which is called the spatial-wideband effect. In this scenario, transceiver design is different from most of the existing works, which presume that the bandwidth of the transmitted signals is not that wide, ignore the spatial-wideband effect, and only address the frequency selectivity. In this paper, we investigate spatial- and frequency-wideband effects, called dual-wideband effects, in massive MIMO systems from array signal processing point of view. Taking mmWave-band communications as an example, we describe the transmission process to address the dual-wideband effects. By exploiting the channel sparsity in the angle domain and the delay domain, we develop the efficient uplink and downlink channel estimation strategies that require much less amount of training overhead and cause no pilot contamination. Thanks to the array signal processing techniques, the proposed channel estimation is suitable for both TDD and FDD massive MIMO systems. Numerical examples demonstrate that the proposed transmission design for massive MIMO systems can effectively deal with the dual-wideband effects.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bolei Wang, Feifei Gao, Shi Jin, Hai Lin, Geoffrey Ye Li. 2018-04-26. Spatial- and Frequency-Wideband Effects in Millimeter-Wave Massive MIMO Systems. https://doi.org/10.1109/tsp.2018.2831628

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↗