Search arXiv⌕ Search

arXiv · 2610.23067

Achievable Rate Region Characterization of Rotatable Antenna-assisted Interference Channel

Abstract

This paper characterizes the achievable rate region of a rotatable antenna (RA)-assisted multiple-input single-output (MISO) interference channel. We exploit the additional spatial degrees of freedom (DoFs) offered by the dynamic orientation of RAs to simultaneously enhance the desired signal and suppress interference, thereby significantly enlarging the achievable rate region of the interference network. To this end, we invoke the rate-profile technique to formulate a sum-rate maximization problem for jointly optimizing the transmit beamforming and the array rotation, subject to the practical mechanical constraints of the RAs. For the special case of a two-receiver scenario, we introduce the concept of subspace correlation coefficient to derive closed-form solutions for the optimal RA rotation angles and transmit beamforming vectors. Inspired by the insights obtained in the two-receiver special case, we propose an efficient two-step optimization framework to obtain a high-quality solution for the general multi-receiver case. In particular, the array rotation angle of each transmitter is optimized to minimize the leakage interference to non-associated receivers. With the optimized array rotation angles, the optimal transmit beamforming is obtained by invoking the second order cone programming based approach. Numerical results demonstrate that the proposed solution achieves near-optimal performance and that integrating RAs effectively simplifies transceiver designs by enabling simple maximum ratio transmission (MRT) beamforming with negligible performance loss.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Junran Pei, Guangji Chen, Qingqing Wu, Qiaoyan Peng, Wei Cai. 2026-10-16. Achievable Rate Region Characterization of Rotatable Antenna-assisted Interference Channel. https://arxiv.org/abs/2610.23067

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Identification for Inverse Gaussian Channels

We derive lower and upper bounds on the identification capacity of inverse Gaussian (IG) channels, a fundamental model for molecular communications in fluid environments. The analysis considers deterministic encoding schemes under a peak time constraint and characterizes the asymptotic growth of optimal codebook sizes. In the converse, by leveraging the Borel-Cantelli lemma and the super-exponential near-zero tail behavior of the IG distribution, we establish an almost-sure lower bound on the first-passage time of drifting diffusing molecules. This leads to the conclusion that the identification capacity exhibits super-exponential growth with the codeword length $n$, i.e., $\sim 2^{(n \log n)R_n}$, where $R_n$ is the coding rate.

cs.IT↗

Polar Complexity: A New Descriptive Complexity with Applications to Source and Joint Source-Channel Coding

This paper first presents a new approach to evaluating the descriptive complexity of finite-length binary sequences. Specifically, we investigate the sequence-wise recovery behavior induced by polar compression and successive cancellation decoding (SCD), and define the polar complexity of a sequence as the minimum polar-compression length (PCL) required for its exact reconstruction. To compute the polar complexity efficiently, we further develop both a bisection-search algorithm and a low-complexity estimation method. We then propose a polar-based two-stage source coding scheme, in which each source sequence is represented by its polar complexity followed by the corresponding polar-compressed sequence. The proposed scheme is strictly lossless and prefix-free. In addition, for BMSs, the normalized average compression length of the proposed scheme can asymptotically approach the source entropy under certain conditions. Simulation results further demonstrate that the scheme can operate without prior knowledge of the source statistics and remains robust across different source distributions. Finally, we integrate the proposed polar source coding with polar channel coding to develop an adaptive double-polar joint source-channel coding (JSCC) scheme, where the encoder and decoder share a predefined set of candidate PCLs to balance error performance and decoding complexity. We formulate the design of the candidate-PCL set as an optimization problem and solve it efficiently via dynamic programming. Simulation results show that the proposed adaptive double-polar JSCC scheme provides a flexible performance-complexity tradeoff and outperforms existing polar-code-based JSCC baselines.

cs.IT↗

UAV Rotatable Antenna under Rotation Delay

Rotatable antennas (RAs) can improve wireless link performance by adjusting their boresight directions. However, existing RA studies generally assume instantaneous antenna reconfiguration, whereas mechanical rotation incurs non-negligible delay in practical deployment. To address this issue, we develop a rotation-delay-aware communication model for finite communication slots, where mechanical rotation directly reduces the time available for data transmission. This model reveals a fundamental tradeoff between the communication gain achieved through RA reorientation and the associated transmission-time loss. Accordingly, we formulate a rotation-delay-aware joint design of RA orientations and transmit beamforming to maximize the minimum effective transmission rate. For the single-user system, under a sufficient condition for strict concavity, the global optimum falls into one of three regimes: no rotation, partial rotation, and full rotation. A closed-form approximation is derived using a second-order expansion. For the multi-user system, we separate rotation-budget selection from fixed-budget max-min signal-to-interference-plus-noise ratio (SINR) optimization. An analytic-gradient zero-forcing (AG-ZF) algorithm is then developed for low-complexity joint RA orientation and rotation-budget optimization. The results show that explicitly accounting for mechanical rotation delay is essential for finite-slot RA-enabled UAV communications, and that the proposed designs effectively balance reconfiguration gain and transmission-time loss while achieving favorable effective-rate performance with low computational complexity.

cs.IT↗