Search arXivSearch

arXiv · 2604.26845

Joint Transceiver Orientation Optimization for Rotatable-Antenna MIMO Capacity Maximization

Abstract

Conventional multiple-input multiple-output (MIMO) systems mainly rely on fixed antenna arrays, which limits their capability to adapt the effective channel matrix to the propagation environment. Rotatable antennas (RAs), which enable mechanical or electronic adjustment of antenna boresight directions, introduce a new orientation-domain degree of freedom for channel reconfiguration. In this paper, we investigate an RA-aided MIMO communication system for channel capacity enhancement. We first establish an orientation-dependent MIMO channel model. Then, we formulate a capacity maximization problem by jointly optimizing the transmit covariance matrix and the transmit/receive RA orientations under practical spherical-cap constraints. To solve this non-convex problem, we develop an alternating optimization algorithm, where the transmit covariance matrix is updated via eigenmode transmission and water-filling, while each RA orientation is optimized through a Riemannian Frank-Wolfe method. We further investigate the low-SNR regime and derive simplified designs for multiple-input single-output (MISO) and single-input multiple-output (SIMO) special cases. Numerical results show that the proposed RA-aided MIMO design significantly improves the channel capacity compared with the fixed-orientation benchmark, demonstrating the benefits of orientation-domain channel reconfiguration.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zheng Ailing, Wu Qingqing, Peng Xingxiang, Peng Qiaoyan, Zheng Ziyuan, Chen Wen. 2026-07-22. Joint Transceiver Orientation Optimization for Rotatable-Antenna MIMO Capacity Maximization. https://arxiv.org/abs/2604.26845

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