Sparse Rotatable Arrays (SRA): Unifying Array Aperture and Antenna Directivity for Wireless Communications
Ailing Zheng, Qingqing Wu, Xiyuan Liu, Wen Chen
Abstract
Sparse rotatable array (SRA) is a novel reconfigurable antenna architecture that jointly exploits sparse aperture configuration and antenna directivity to enhance spatial resolution for future wireless communications. Specifically, SRA activates a subset of rotatable antennas over a large candidate aperture and adjusts their boresight directions, thereby creating a directionally selective sparse aperture with reduced hardware requirements and enhanced spatial flexibility. In this paper, we investigate an SRA-aided multi-group communication system, where users are organized into spatial groups with different service requirements. We develop a group-aware SRA design framework by jointly optimizing the sparse-aperture allocation, RA orientations, and transmit beamforming to maximize the weighted max-min signal-to-interference-plus-noise ratio (SINR). Then, we characterize the operating principles of SRA and reveal that sparse aperture improves spatial resolution by enlarging the effective array aperture, while antenna directivity suppresses inter-group coupling through directional control, thereby enabling simplified group-wise beamforming structures. Guided by these insights, we develop a structured low-complexity alternating optimization algorithm that embeds a closed-form projected group-center RA orientation rule into the sparse-aperture allocation and beamforming design. The proposed algorithm combines analysis-guided initialization, sampled multi-start antenna-allocation search, and bisection-based second-order cone programming for beamforming. Numerical results show that the proposed SRA design closely approaches fully-shared SRA benchmarks and significantly outperforms compact subarray and omni sparse-array schemes.
Create a lesson
Related papers
Auxiliary Codes and the Generalized Packing-Covering Conjecture
Isaac Barouch Essayag, Aryeh Lev Zabokritskiy
Low-Rank Masking for Single-Server Matrix Multiplication
Alejandro Cohen, Rafael G. L. D'Oliveira, Alex Sprintson
Computing the entropy rate of a quantized stationary Gaussian process
Jeremy Magland
Counterexample to a Proposed Capacity Characterization of the Relay Channel
Chun Hei Michael Shiu
Common Randomness: A Key Enabler of Trustworthy 6G Communication Systems
Rami Ezzine, Moritz Wiese, Wafa Labidi et al.
Information Spectrum Methods for -Capacity Problems in the Theory of Mixed Multiple-Access Channels with Cost Constraint
Te Sun Han, Hideki Yagi