Search arXivSearch

arXiv · 2311.11037

Capacity Maximization for FAS-assisted Multiple Access Channels

Abstract

This paper investigates a multiuser millimeter-wave (mmWave) uplink system in which each user is equipped with a multi-antenna fluid antenna system (FAS) while the base station (BS) has multiple fixed-position antennas. Our primary objective is to maximize the system capacity by optimizing the transmit covariance matrices and the antenna position vectors of the users jointly. To gain insights, we start by deriving upper bounds and approximations for the capacity. Then we delve into the capacity maximization problem. Beginning with the simple scenario of a single user equipped with a single-antenna FAS, we demonstrate that a closed-form optimal solution exists when there are only two propagation paths between the user and the BS. In the case where multiple propagation paths are present, a near-optimal solution can also be obtained through a one-dimensional search method. Expanding our focus to multiuser cases, in which users are equipped with either single- or multi-antenna FAS, we show that the original capacity maximization problems can be reformulated into distinct rank-one programmings. Then, we propose alternating optimization algorithms to deal with the transformed problems. Simulation results indicate that FAS can improve the capacity of the multiple access channel (MAC) greatly, and the proposed algorithms outperform all the benchmarks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hao Xu, Kai-Kit Wong, Wee Kiat New, Farshad Rostami Ghadi, Gui Zhou, Ross Murch, Chan-Byoung Chae, Yongxu Zhu, Shi Jin. 2024-08-18. Capacity Maximization for FAS-assisted Multiple Access Channels. https://arxiv.org/abs/2311.11037

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