Search arXivSearch

arXiv · 2512.06156

Hybrid Beamfocusing Design for RSMA-Enabled Near-Field Wideband Communications

Abstract

Future wireless networks will utilize extremely large-scale antenna arrays (ELAAs) over high-frequency bands, which, however, produce near-field spherical wavefronts and spatial wideband effects. To exploit and mitigate these, this paper proposes a rate-splitting multiple access (RSMA)-enabled transmit scheme for wideband near-field communications (NFC). Our solution leverages true-time-delay (TTD)-based hybrid beamfocusing architectures to mitigate spatial wideband effect and reduce radio frequency chain requirements. The objective is to maximize the minimum rate by jointly optimizing frequency-dependent analog beamfocusing, frequency-independent analog beamfocusing, digital beamfocusing, and common rate allocation. To solve this complicated non-convex problem, we develop a penalty-based iterative algorithm that partitions the variables into three blocks and then employs block coordinate descent (BCD) to optimize each block alternately. This algorithm is further extended to support the sub-connected TTD-based analog beamfocusing architectures. Comprehensive simulation results indicate that our transmit scheme: 1) effectively compensates for spatial wideband effect, addressing a critical challenge in wideband operation; 2) achieves performance comparable to full digital beamfocusing while maintaining lower hardware complexity; 3) achieves substantial performance gains over the other two benchmarks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiasi Zhou, Chintha Tellambura. 2025-12-04. Hybrid Beamfocusing Design for RSMA-Enabled Near-Field Wideband Communications. https://arxiv.org/abs/2512.06156

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