Search arXivSearch

arXiv · 2508.15924

Tri-Hybrid Beamforming for Radiation-Center Reconfigurable Antenna Array: Spectral Efficiency and Energy Efficiency

Abstract

In this paper, we propose a tri-hybrid beamforming (THBF) architecture based on the radiation-center (RC) reconfigurable antenna array (RCRAA), including the digital beamforming, analog beamforming, and electromagnetic (EM) beamforming, where the EM beamformer design is modeled as RC selection. Aiming at spectral efficiency (SE) maximization subject to the hardware and power consumption constraints, we propose a tri-loop alternating optimization (TLAO) scheme for the THBF design, where the digital and analog beamformers are optimized based on the penalty dual decomposition in the inner and middle loops, and the RC selection is determined through the coordinate descent method in the outer loop. Aiming at energy-efficiency (EE) maximization, we develop a dual quadratic transform-based fractional programming (DQTFP) scheme, where the TLAO scheme is readily used for the THBF design. To reduce the computational complexity, we propose the Lagrange dual transform-based fractional programming (LDTFP) scheme, where each iteration has a closed-form solution. Simulation results demonstrate the great potential of the RCRAA in improving both SE and EE. Compared to the DQTFP scheme, the LDTFP scheme significantly reduces the computational complexity with only minor performance loss.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yinchen Li, Chenhao Qi, Shiwen Mao, Octavia A. Dobre. 2025-08-21. Tri-Hybrid Beamforming for Radiation-Center Reconfigurable Antenna Array: Spectral Efficiency and Energy Efficiency. https://arxiv.org/abs/2508.15924

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