Search arXivSearch

arXiv · 1903.01340

Beam Squint and Channel Estimation for Wideband mmWave Massive MIMO-OFDM Systems

Abstract

With the increasing scale of antenna arrays in wideband millimeter-wave (mmWave) communications, the physical propagation delays of electromagnetic waves traveling across the whole array will become large and comparable to the time-domain sample period, which is known as the spatial-wideband effect. In this case, different subcarriers in an orthogonal frequency division multiplexing (OFDM) system will "see" distinct angles of arrival (AoAs) for the same path. This effect is known as beam squint, resulting from the spatial-wideband effect, and makes the approaches based on the conventional multiple-input multiple-output (MIMO) model, such as channel estimation and precoding, inapplicable. After discussing the relationship between beam squint and the spatial-wideband effect, we propose a channel estimation scheme for frequency-division duplex (FDD) mmWave massive MIMO-OFDM systems with hybrid analog/digital precoding, which takes the beam squint effect into consideration. A super-resolution compressed sensing approach is developed to extract the frequency-insensitive parameters of each uplink channel path, i.e., the AoA and the time delay, and the frequency-sensitive parameter, i.e., the complex channel gain. With the help of the reciprocity of these frequency-insensitive parameters in FDD systems, the downlink channel estimation can be greatly simplified, where only limited pilots are needed to obtain downlink complex gains and reconstruct downlink channels. Furthermore, the uplink and downlink channel covariance matrices can be constructed from these frequency-insensitive channel parameters rather than through a long-term average, which enables the minimum mean-squared error (MMSE) channel estimation to further enhance performance. Numerical results demonstrate the superiority of the proposed scheme over the conventional methods in mmWave communications.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bolei Wang, Mengnan Jian, Feifei Gao, Geoffrey Ye Li, Shi Jin, Hai Lin. 2019-03-04. Beam Squint and Channel Estimation for Wideband mmWave Massive MIMO-OFDM Systems. https://doi.org/10.1109/tsp.2019.2949502

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