Massive connectivity over wireless channels relies on aggressive spectrum sharing techniques. Conventionally, this may be achieved by sophisticated signal processing and optimization of applying multiple antennas and/or complex multiuser decoding at each user terminal (UT). Different from previous methods, this letter proposes a radical approach for massive connectivity, which employs fluid antenna at each UT to exploit the interference null, created naturally by multipath propagation and the randomness of UT's data, on a symbol-by-symbol basis for multiple access. The proposed fast fluid antenna multiple access (f -FAMA) system adopts a large, distributed antenna array at the base station (BS) to transmit each UT's signal from each of the BS antennas and lets each UT overcome the interference on its own using its fluid antenna. Our main contribution is a technique that estimates the best port of fluid antenna for reception at every symbol instance. The proposed approach needs only cross-correlation calculations and single-user decoding at each UT and requires no precoding at the BS. Simulation results demonstrate that for a BS with 16 antennas supporting 16 co-channel users, a multiplexing gain of 14.87 is achieved even when the channel has a strong line-of-sight (LoS) and multipath is few. The multiplexing gain can also rise to 24.36 if a 30-antenna BS is serving 30 co-channel users.

No abstract

Multiple access can be realized by utilizing the spatial moments of deep fades, using fluid antennas. The interference immunity for fluid antenna multiple access (FAMA), nevertheless, comes with the requirement of a large number of ports at each user. To alleviate this, we study the synergy between opportunistic scheduling and FAMA. A large pool of users permits selection of favourable users for FAMA and decreases the outage probability at each selected user. Our objective is to characterize the benefits of opportunistic scheduling in FAMA. In particular, we derive the multiplexing gain of the opportunistic FAMA network in closed form and upper bound the required number of users in the pool to achieve a given multiplexing gain. Also, we find a lower bound on the required outage probability at each user for achieving a given network multiplexing gain, from which the advantage of opportunistic scheduling is illustrated. In addition, we investigate the rate of increase of the multiplexing gain with respect to the number of users in the pool, and derive a tight approximation to the multiplexing gain, expressed in closed form. As a key result of our analysis, we obtain an operating condition on the product of the number of users in the pool and the number of ports at each fluid antenna that ensures a high multiplexing gain. Numerical results demonstrate clear benefits of opportunistic scheduling in FAMA networks, and corroborate our analytical results.