Search arXivSearch

arXiv · 2203.14180

Truncated Beam Sweeping for Spatial Covariance Matrix Reconstruction in Hybrid Massive MIMO

Abstract

Spatial covariance matrix (SCM) is essential in many applications of multi-antenna systems such as massive multiple-input multiple-output (MIMO). For massive MIMO operating at millimeter-wave bands, hybrid analog-digital structure has been adopted to reduce the cost of radio frequency (RF) chains. In this situation, signals received at the antennas are unavailable to the digital receiver, and as a consequence, traditional sample average approach cannot be used for SCM reconstruction in hybrid massive MIMO. To address this issue, beam sweeping algorithm (BSA), which can reconstruct SCM effectively in hybrid massive MIMO, has been proposed in our previous work. In this paper, a truncated BSA is further proposed for SCM reconstruction by taking into account the patterns of antenna elements in the array. Due to the directive antenna pattern, sweeping results corresponding to predetermined direction-of-angles (DOA) far from the normal direction are small and thus can be replaced by predetermined constants. At the cost of negligible performance reduction, SCM can be reconstructed efficiently by sweeping only the predetermined DOAs that are close to the normal direction. In this way, BSA can be conducted much faster than its traditional counterpart. Insightful analysis will be also included to show the impact of truncation on the performance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yinsheng Liu, Hongtao Duan, Xi Liao. 2022-03-27. Truncated Beam Sweeping for Spatial Covariance Matrix Reconstruction in Hybrid Massive MIMO. https://arxiv.org/abs/2203.14180

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