Search arXivSearch

arXiv · 2409.18353

Energy Efficient Beamforming Training in Terahertz Communication Systems

Abstract

Terahertz (THz) enables promising Tbps-level wireless transmission thanks to its prospect of ultra-huge spectrum utilization and narrow beamforming in the next sixth-generation (6G) communication system. Compared to millimeter wave (mmWave), THz intrinsically possesses compellingly severer molecular absorption and high pathloss serving confined coverage area. These defects should be well conquered under the employment of ultra-thin 3D beamforming with enormous deployed antennas with high beam gains. However, pencil-beams require substantially high overhead of time and power to train its optimal THz beamforming direction. We propose an energy efficient (EE) oriented THz beamforming (EETBF) scheme by separating the original complex problem into beamforming training (EETBF-BT) acquirement and learning-enabled training power assignment (EETBF-PA). The historical beam data is employed to update next beam selection policy. The performance results have demonstrated that the proposed EETBF outperforms the existing benchmarks leveraging full beam search, iterative search, linear/binary search as well as non-power-control based mechanism in open literature. Our proposed EETBF scheme results in the lowest training latency and power consumption, achieving the highest effective rate and EE performance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Li-Hsiang Shen, Kai-Ten Feng, Lie-Liang Yang. 2024-12-09. Energy Efficient Beamforming Training in Terahertz Communication Systems. https://arxiv.org/abs/2409.18353

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