Search arXivSearch

arXiv · 2210.05396

MIMO Capacity Characterization for Movable Antenna Systems

Abstract

In this paper, we propose a new multiple-input multiple-output (MIMO) communication system with movable antennas (MAs) to exploit the antenna position optimization for enhancing the capacity. Different from conventional MIMO systems with fixed-position antennas (FPAs), the proposed system can flexibly change the positions of transmit/receive MAs, such that the MIMO channel between them is reconfigured to achieve higher capacity. We aim to characterize the capacity of MA-enabled point-to-point MIMO communication systems, by jointly optimizing the positions of transmit and receive MAs as well as the covariance of transmit signals. First, we develop an efficient alternating optimization algorithm to find a locally optimal solution by iteratively optimizing the transmit covariance matrix and the position of each transmit/receive MA with the other variables being fixed. Next, we propose alternative algorithms of lower complexity for capacity maximization in the low-SNR regime and for the multiple-input single-output (MISO) and single-input multiple-output (SIMO) cases. Numerical results show that our proposed MA systems significantly improve the MIMO channel capacity compared to traditional FPA systems as well as various benchmark schemes, and useful insights are drawn into the capacity gains of MA systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wenyan Ma, Lipeng Zhu, Rui Zhang. 2022-10-11. MIMO Capacity Characterization for Movable Antenna Systems. https://arxiv.org/abs/2210.05396

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