Search arXivSearch

arXiv · 1902.06844

Channel Extrapolation in FDD Massive MIMO: Theoretical Analysis and Numerical Validation

Abstract

Downlink channel estimation in massive MIMO systems is well known to generate a large overhead in frequency division duplex (FDD) mode as the amount of training generally scales with the number of transmit antennas. Using instead an extrapolation of the channel from the measured uplink estimates to the downlink frequency band completely removes this overhead. In this paper, we investigate the theoretical limits of channel extrapolation in frequency. We highlight the advantage of basing the extrapolation on high-resolution channel estimation. A lower bound (LB) on the mean squared error (MSE) of the extrapolated channel is derived. A simplified LB is also proposed, giving physical intuition on the SNR gain and extrapolation range that can be expected in practice. The validity of the simplified LB relies on the assumption that the paths are well separated. The SNR gain then linearly improves with the number of receive antennas while the extrapolation performance penalty quadratically scales with the ratio of the frequency and the training bandwidth. The theoretical LB is numerically evaluated using a 3GPP channel model and we show that the LB can be reached by practical high-resolution parameter extraction algorithms. Our results show that there are strong limitations on the extrapolation range than can be expected in SISO systems while much more promising results can be obtained in the multiple-antenna setting as the paths can be more easily separated in the delay-angle domain.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

François Rottenberg, Rui Wang, Jianzhong Zhang, Andreas F. Molisch. 2019-02-19. Channel Extrapolation in FDD Massive MIMO: Theoretical Analysis and Numerical Validation. https://arxiv.org/abs/1902.06844

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