Search arXivSearch

arXiv · 2503.04040

Joint Beamforming and Antenna Position Optimization for Fluid Antenna-Assisted MU-MIMO Networks

Abstract

The fluid antenna system (FAS) is a disruptive tech-nology for future wireless communication networks. This paper considers the joint optimization of beamforming matrices and antenna positions for weighted sum rate (WSR) maximization in fluid antenna (FA)-assisted multiuser multiple-input multiple-output (MU-MIMO) networks, which presents significant chal-lenges due to the strong coupling between beamforming and FA positions, the non-concavity of the WSR objective function, and high computational complexity. To address these challenges, we first propose a novel block coordinate ascent (BCA)-based method that employs matrix fractional programming techniques to reformulate the original complex problem into a more tractable form. Then, we develop a parallel majorization maximization (MM) algorithm capable of optimizing all FA positions simul-taneously. To further reduce computational costs, we propose a decentralized implementation based on the decentralized base-band processing (DBP) architecture. Simulation results demon-strate that our proposed algorithm not only achieves significant WSR improvements over conventional MIMO networks but also outperforms the existing method. Moreover, the decentralized implementation substantially reduces computation time while maintaining similar performance compared with the centralized implementation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tianyi Liao, Wei Guo, Hengtao He, Shenghui Song, Jun Zhang, Khaled B. Letaief. 2025-09-25. Joint Beamforming and Antenna Position Optimization for Fluid Antenna-Assisted MU-MIMO Networks. https://arxiv.org/abs/2503.04040

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