Search arXivSearch

arXiv · 2210.05325

Modeling and Performance Analysis for Movable Antenna Enabled Wireless Communications

Abstract

In this paper, we propose a novel antenna architecture called movable antenna (MA) to improve the performance of wireless communication systems. Different from conventional fixed-position antennas (FPAs) that undergo random wireless channel variation, the MAs with the capability of flexible movement can be deployed at positions with more favorable channel conditions to achieve higher spatial diversity gains. To characterize the general multi-path channel in a given region or field where the MAs are deployed, a field-response model is developed by leveraging the amplitude, phase, and angle of arrival/angle of departure (AoA/AoD) information on each of the multiple channel paths under the far-field condition. Based on this model, we then analyze the maximum channel gain achieved by a single receive MA as compared to its FPA counterpart in both deterministic and stochastic channels. First, in the deterministic channel case, we show the periodic behavior of the multi-path channel gain in a given spatial field, which can be exploited for analyzing the maximum channel gain of the MA. Next, in the case of stochastic channels, the expected value of an upper bound on the maximum channel gain of the MA in an infinitely large receive region is derived for different numbers of channel paths. The approximate cumulative distribution function (CDF) for the maximum channel gain is also obtained in closed form, which is useful to evaluate the outage probability of the MA system. Moreover, our results reveal that higher performance gains by the MA over the FPA can be acquired when the number of channel paths increases due to more pronounced small-scale fading effects in the spatial domain. Numerical examples are presented which validate our analytical results and demonstrate that the MA system can reap considerable performance gains over the conventional FPA systems with/without antenna selection (AS).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lipeng Zhu, Wenyan Ma, Rui Zhang. 2024-03-24. Modeling and Performance Analysis for Movable Antenna Enabled Wireless Communications. https://arxiv.org/abs/2210.05325

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