Turbocharging Fluid Antenna Multiple Access

Based on our current understanding, extreme massive access over the same physical channel is only possible if an extra-large multiple-input multiple-output (XL-MIMO) antenna is used at the base station (BS) and instantaneous channel state information (CSI) is known at the BS side for precoding design. This casts doubt on scalability and challenges in device-to-device situations in which there is not a centralized, optimized BS for transmitting the user signals. To address this problem, we revisit the massive connectivity challenge by considering the case where no CSI is available at the BS and no precoding is used. In this situation, inter-user interference (IUI) mitigation can only be performed at the user terminal (UT) side. Leveraging the position flexibility of fluid antenna system (FAS), we adopt a fluid antenna multiple access (FAMA) approach that exploits the interference signal fluctuation in the spatial domain. Specifically, we assume that we have <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i> spatially correlated received signals per symbol duration from FAS. Our main approach uses a simple heuristic port shortlisting method that identifies promising ports to obtain favourable received signals that can be combined via maximum ratio combining (MRC) to form the received output signal for final detection. On top of this, a pre-trained deep joint source-channel coding (JSCC) scheme is employed, which together with a diffusion-based denoising model (MixDDPM) at the UT side, can improve the IUI immunity. We refer to the proposed scheme as turbo FAMA. Simulation results show that with a physical FAS size of 20 wavelengths at each UT transmitting quaternary phase shift keying (QPSK) symbols, fast FAMA can support 50 users while <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">turbo</i> FAMA can handle up to 200 users if the required symbol error rate (SER) is 10<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-2</sup>. If a higher error tolerance is acceptable, say SER at 0.1, turbo FAMA can even serve up to 1000 users but fast FAMA is only able to handle 160 users, all remarkably achieved without CSI at the BS.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Wireless Communications
Published
2025-09-16
DOI
https://doi.org/10.1109/twc.2025.3607824
Citations
2
Primary Topic
Aerospace Engineering and Energy Systems
Type
article
Field-Weighted Citation Impact
9.99
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Turbocharging Fluid Antenna Multiple Access

Ross Murch, Kai‐Kit Wong, Noor Waqar, Chan‐Byoung Chae
2 citations
IEEE Transactions on Wireless Communications
Aerospace Engineering and Energy Systems
9.99
article

Turbocharging Fluid Antenna Multiple Access

Ross Murch, Kai‐Kit Wong, Noor Waqar, Chan‐Byoung Chae
article en
2 citations

Abstract

Based on our current understanding, extreme massive access over the same physical channel is only possible if an extra-large multiple-input multiple-output (XL-MIMO) antenna is used at the base station (BS) and instantaneous channel state information (CSI) is known at the BS side for precoding design. This casts doubt on scalability and challenges in device-to-device situations in which there is not a centralized, optimized BS for transmitting the user signals. To address this problem, we revisit the massive connectivity challenge by considering the case where no CSI is available at the BS and no precoding is used. In this situation, inter-user interference (IUI) mitigation can only be performed at the user terminal (UT) side. Leveraging the position flexibility of fluid antenna system (FAS), we adopt a fluid antenna multiple access (FAMA) approach that exploits the interference signal fluctuation in the spatial domain. Specifically, we assume that we have <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i> spatially correlated received signals per symbol duration from FAS. Our main approach uses a simple heuristic port shortlisting method that identifies promising ports to obtain favourable received signals that can be combined via maximum ratio combining (MRC) to form the received output signal for final detection. On top of this, a pre-trained deep joint source-channel coding (JSCC) scheme is employed, which together with a diffusion-based denoising model (MixDDPM) at the UT side, can improve the IUI immunity. We refer to the proposed scheme as turbo FAMA. Simulation results show that with a physical FAS size of 20 wavelengths at each UT transmitting quaternary phase shift keying (QPSK) symbols, fast FAMA can support 50 users while <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">turbo</i> FAMA can handle up to 200 users if the required symbol error rate (SER) is 10<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-2</sup>. If a higher error tolerance is acceptable, say SER at 0.1, turbo FAMA can even serve up to 1000 users but fast FAMA is only able to handle 160 users, all remarkably achieved without CSI at the BS.

IEEE Transactions on Wireless CommunicationsVol. 25
Yonsei University (KR), Hong Kong University of Science and Technology (HK), Institute for Advanced Study (DE), University College London (GB), University of Hong Kong (HK)
Openalex Percentile: Top 2%
Aerospace Engineering and Energy Systems
9.99
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.