Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1705.04943

Analog Beamsteering for Flexible Hybrid Beamforming Design in Mmwave Communications

Yaning Zou·Wolfgang Rave·Gerhard Fettweis
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we propose an analog beamsteering approach for enabling flexible hybrid beamforming design that can achieve performance close to singular value decomposition (SVD) based digital beamforming with single user case. As a starting point, assuming the use of a codebook with infinite precision, we apply transposes of antenna array response matrices as analog beam-formers at the BS and the UE sides. The resulting effective chan-nel matrix including both propagation channel and analog beam-formers is shown to be able to provide a maximal achievable rate very close to SVD based digital beamforming at low to medium SNR. Next, the impact of a finite size codebook is analyzed for practical analog beamformer design. A closed-form derivation is obtained for mapping rate loss to the number of antennas, code-book sizes and the received SNR. The analysis shows that in or-der to achieve performance comparable to analog beamforming with infinite precision, the codebook size should be at least larger than the number of implemented antennas. Therefore, the pro-posed analog beamforming approach can be designed inde-pendently without taking digital beamforming into account. Such an approach can lead to the development of flexible hybrid beam-forming architectures that could adapt to a changing propagation environment via agile analog beam selection and maximize spatial multiplexing gain via proper digital beamformer design.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yaning Zou, Wolfgang Rave, Gerhard Fettweis. 2017-05-14. Analog Beamsteering for Flexible Hybrid Beamforming Design in Mmwave Communications. https://arxiv.org/abs/1705.04943

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↗