Search arXivSearch

arXiv · 2108.07581

Channel Estimation for Extremely Large-Scale MIMO: Far-Field or Near-Field?

Abstract

Extremely large-scale multiple-input-multiple-output (XL-MIMO) with hybrid precoding is a promising technique to meet the high data rate requirements for future 6G communications. To realize efficient hybrid precoding, it is essential to obtain accurate channel state information. Existing channel estimation algorithms with low pilot overhead heavily rely on the channel sparsity in the angle domain, which is achieved by the classical far-field planar wavefront assumption. However, due to the non-negligible near-field spherical wavefront property in XL-MIMO systems, this channel sparsity in the angle domain is not available anymore, and thus existing far-field channel estimation schemes will suffer from severe performance loss. To address this problem, in this paper we study the near-field channel estimation by exploiting the polar-domain sparse representation of the near-field XL-MIMO channel. Specifically, unlike the classical angle-domain representation that only considers the angle information of the channel, we propose a new polar-domain representation, which simultaneously accounts for both the angle and distance information. In this way, the near-field channel also exhibits sparsity in the polar domain. By exploiting the channel sparsity in the polar domain, we propose the on-grid and off-grid near-field channel estimation schemes for XL-MIMO. Firstly, an on-grid polar-domain simultaneous orthogonal matching pursuit (P-SOMP) algorithm is proposed to efficiently estimate the near-field channel. Furthermore, to solve the resolution limitation of the on-grid P-SOMP algorithm, an off-grid polar-domain simultaneous iterative gridless weighted (P-SIGW) algorithm is proposed to improve the estimation accuracy, where the parameters of the near-field channel are directly estimated. Finally, numerical results are provided to verify the effectiveness of the proposed schemes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mingyao Cui, Linglong Dai. 2022-01-19. Channel Estimation for Extremely Large-Scale MIMO: Far-Field or Near-Field?. https://arxiv.org/abs/2108.07581

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