Slow Fluid Antenna Multiple Access with Multiport Receivers
Abstract
We investigate whether equipping fluid-antenna (FA) receivers with multiple () radiofrequency (RF) chains can improve the performance of the slow fluid-antenna multiple access (FAMA) technique, which enables open-loop connectivity with channel state information (CSI) available only at the receiver side. We analyze the case of slow-FAMA users equipped with multiport receivers, so that ports of the FA are selected and combined to reduce interference. We show that a joint design of the port selection matrix and the combining vector at each receiver yields significant performance gains over reference schemes, demonstrating the potential of multiport reception in FA systems with a limited number of RF chains.
Index Terms:
Fluid antenna systems, fluid antenna multiple access, MIMO, multi-user communications, interference.I Introduction
Fluid antenna systems (FASs) have gained considerable attention in recent years as a promising alternative to conventional MIMO (MIMO) systems that rely on fixed-position antennas [1]. FASs refer to any controllable structure —whether electronically, mechanically, or otherwise actuated— that can dynamically alter its fundamental radio-frequency (RF) characteristics, effectively emulating physical changes in shape or position to adapt to the wireless environment [2]. The fine-grained capability of FASs to sample spatial locations brings enhanced flexibility to exploit spatial diversity, by selecting the receive antenna port (akin to position) that is more beneficial for signal reception [3].
One of the key potential use cases of FASs is the provision of simplified open-loop multiple access, without the need for CSI (CSI) at the transmitter side or SIC (SIC) at the receiver side. This technique, referred to as FAMA (FAMA), allows serving multiple users in the same time/frequency resource with CSI required only at the receiver side. Specifically, the slow-FAMA paradigm introduced in [4] manages to relax the stringent port-switching requirements of the fast-FAMA counterpart [5], thus reducing complexity while still allowing for user multiplexing.
Since their inception, FASs have been envisioned as a low-complexity alternative to conventional MIMO architectures to improve system performance. For that reason, virtually all FAMA-based schemes consider a single RF (RF) chain at the receiver (user) ends, and the port selection mechanism aims to choose that with the best SINR (SINR). Indeed, there have been attempts to consider the case with a larger number of RF chains at the receiver ends in the context of FASs: for instance, the use of MRC (MRC) to combine the signals of the best ports was proposed in [6] for a point-to-point (single user) case. However, MRC offers limited benefits in the presence of interference, which is the operational regime in FAMA. In [7], the CUMA (CUMA) architecture was proposed, allowing to select a subset of ports for which the desired signal is phase-aligned. While CUMA manages to improve slow-FAMA multiplexing capabilities by using a limited number of RF chains (up to four [8]), it comes in hand with some practical challenges: (i) requires a pre-processing stage to configure the subset of active ports; (ii) assumes that an arbitrary number of ports are active at the same time; and (iii) requires precise knowledge of CSI at all ports.
In this work, we revisit the problem of slow-FAMA when FA users have multiport receivers, i.e., they can be equipped with more than one RF chain. Contrary to prior art, we propose a method to jointly select the active ports of the FA and the combining vector for the signals of the designated ports. One of the key novelties lies in the fact that the spatial features of the channel matrix for the FA array are considered in the procedure. This novel approach enhances the achievable gain and, more importantly, considerably reduces the inter-user interference. Results show that the use of only a few RF chains at the FA users can significantly boost the SINR compared to state-of-the-art alternatives.
Notation: is a scalar, is a vector, and is a matrix. Transpose and conjugate transpose of are denoted by and , respectively. Calligraphic letters, e.g., denote sets and sequences. represents the set cardinality. Finally, the expectation operator is and denotes the -norm.
II System Model
Let us consider a general MIMO system with a BS (BS) deploying antennas that serves users, each equipped with a FA array of ports capable of selecting active FA ports based on channel conditions. In coherence with the original formulation of slow-FAMA [4], we assume that the number of antennas at the BS and the number of users are equal, i.e., .
We denote the data symbol intended for user as with , so that the received signal at the -th user can be written as:
(1) |
where is the channel matrix between the base station and user , and denotes the received signal vector at the FA-user side111Note that while the vector form of suggests a 1D implementation of the FA array, the 2D case is also captured by a proper remapping of the 2D FA indices.. As one of the key features of slow-FAMA is its simplicity, each of the transmit antennas is dedicated to a different user, i.e., no channel knowledge is required at the BS [4]. Accordingly, the precoding vector at the BS is simply set as , where is the -dimension canonical vector with zero entries except for the -th position. We consider that such is given and fixed. Finally, represents the additive Gaussian white noise vector whose elements have power.
At the receiver side, each FA-equipped user selects the appropriate ports based on the user channel gain and interference. We model this feature by introducing the port selection matrix , with the set of matrices . Moreover, the resulting signals from the ports can be coherently received by using the combiner , with , . As such, the received symbol results222Note that the matrix and the vector can be designed independently (locally) for each user; since they are implemented at the receiver ends, they do not affect the amount of interference suffered by the remaining users in the system. in
(2) |
From a channel modeling perspective, the fluid antenna array resembles a collection of co-located radiating elements, representing the ports where the fluid antenna can switch into. Thus, when considering the case of spatially correlated Rayleigh fading, the -th column of the channel matrix can be expressed as
(3) |
where the dependence on the port positions appears in the channel spatial correlation matrix . In general, the structure of is determined by the fluid antenna topology, i.e., the relative positions of the antenna ports within the overall aperture. For a 1D fluid antenna, Jakes’ correlation model is widely adopted. However, this model does not generalize properly to planar (2D) arrays with ports. For such systems, we will employ Clarke’s model to define , considering [9]. In all instances, we assume that the ports in each dimension are equally spaced and denote by , (or equivalently ), the length of the fluid antenna normalized by the wavelength.
To evaluate the performance of the proposed setup, we consider the SINR of each user, as follows
(4) |
as it is directly related to the achievable SE (SE) , with being the transmit SNR. Thus, we define the problem formulation as follows
(5) |
Since FAMA operates in open-loop, each user can design their corresponding and independently. From the perspective of the -th user, the problem formulation requires the joint design of the port selection matrix and the combining vector . The FAMA-based literature has primarily focused in the baseline case where ; hence, the usual strategy is to select the port that maximizes the SINR, and a trivial scalar value of one is used as the combining vector.
For the cases of CUMA using more than one RF chain [7], and are designed sequentially: first, the selection matrix is configured following a sign-based criterion for selecting a subset of ports for which the desired signal adds up constructively. Then, direct detection or matrix inversion-based strategies are proposed to implement . Taking a look at the related literature regarding classical antenna selection schemes, algorithms that avoid an exhaustive search over all candidate antenna subsets to design are described, e.g. [10, 11, 12, 13]. In general, these approaches rewrite the performance metric by isolating the contribution of a particular column of the channel matrix. However, such formulations are well-suited for a single-user scenario, but cannot be adapted to the multi-user case in FAMA due to the inter-user interference term.
III SINR-based port selection and combining
In this section, we focus on the design of the selection matrix and the combining vector for a FA-based multiport receiver equipped with RF chains.
III-A Digital Combining
We first aim to generalize the port selection criterion in slow-FAMA to the case with active ports. Similar to [11, 13], we solve the problem formulation in (5) in two stages. First, we start by designing the matrix following the slow FAMA heuristic in [4] (i.e., selecting the ports with the best SINR). Then, after the active ports are decided, we determine aiming to maximize the SINR after combination. This scheme will be referred to as DC (DC).
Let us denote as the -th row of . Then, for the canonical precoding vectors described in Sect. II, we can formulate the slow FAMA port selection procedure with ports as follows
(6) |
By finding the solution to this formulation, we build the selection matrix with the canonical vectors corresponding to the rows in , i.e. . For the given selection matrix , we need to design an adequate combining vector . This vector should increase the signal strength and, at the same time, reduce the inter-user interference. In other words, we aim to solve
(7) |
where we introduced as a submatrix of , and as a positive definite submatrix of . Due to , the selected row and column indices are common for both and . Hence, finding the optimal combining vector can be recast as a generalized eigenvalue problem [14], and solved by the dominant generalized eigenvector of the matrix pair [15]. In particular, note that defining the vector we can find a solution using that is the dominant eigenvector of , and the achievable SINR for the -th user is the associated dominant eigenvalue.
III-B Generalized Eigenvector Port Selection
The extension of the slow-FAMA port selection scheme to the multiport case from in (6) aims to select the most promising ports from the SINR perspective. However, under this criterion the effect of spatial correlation among ports is neglected in the process. In other words, DC selects isolated entries from and , but the structure of such matrices is ignored. Besides, the sequential design of the selection matrix and the combining vector may not yield optimal performance. Hence, it is legitimate to ask whether some improvement over the DC scheme can be attained when these aspects are taken into consideration. In the sequel, for the sake of notational simplicity, the dependence on the user index is dropped.
We propose an alternative strategy that jointly designs and , and exploits the spatial information provided by and . This scheme will be referred to as GEPort (GEPort). Let us take as starting assumption that we can afford to select all ports at the FA. Then, let us evaluate what is the SINR loss introduced by switching off one of the available ports. This measure will be obtained by considering the SINRs related to the matrix entries as well as the matrix structures, potentially achieving improved system performance. We define the proposed metric in the following lemma.
Lemma 1.
Let be the generalized eigenvectors of the matrix pair , associated with the corresponding generalized eigenvalues , and the -th element of . In addition, let be generalized eigenvalues of the matrix pair obtained by disabling the -th port (i.e. removing row and column from and ). Then, the SINR drop due to deactivating port is given by
(8) |
Proof.
See Appendix. ∎
The result in Lemma (1) is useful to the discard the port that presents the lowest performance reduction. As we will later discuss, this process can be iterated until we reach the subset of ports with the lowest aggregate SINR loss. After observing Lemma (1), some relevant remarks are in order: Note that the first and third factors in (8) depend on the candidate port . Unfortunately, the third factor includes in the denominator, which is unknown unless the generalized eigenvalues of the reduced matrix pair are computed. Obtaining can be impractical when the number of ports grows large. To avoid this and reduce complexity, we can exploit the Cauchy interlacing theorem, which states that the eigenvalues of a Hermitian matrix interlace with those of any of its principal submatrices. Specifically, the eigenvalues of a matrix and a submatrix satisfy [16]
(9) |
As such, all the differences in the product of the third factor (8) are positive valued, and the quotients for such a factor are smaller than or equal to . Consequently, we set a lower bound for the SINR drop as follows
(10) |
Note also that the first factor , which is given by the entries of the dominant generalized eigenvector of the complete matrix pair , depends on , while the remaining factor in (10) is equal for different ports. Moreover, when , the SINR drop satisfies and deactivating the port has a negligible impact on the performance. As a consequence, we are interested in the index attaining the smallest value of , potentially leading to a small performance reduction when the port becomes inactive.
Recall that Lemma 1 considers the effect of removing the first port. As previously mentioned, the same idea can be repeated until the desired number of ports is selected. Alternatively, ports can be deactivated to achieve a desired spectral efficiency value or until a predefined performance reduction is attained. In particular, we propose a criterion for building the matrix based on the iterative application of the result in Lemma 1 for the determination of the set . Hence, for the -th step in the iteration procedure, we have that
(11) |
where is the dominant generalized eigenvector for the matrix pair , which are obtained by removing the rows and the columns with indices belonging to the set , and is the -th entry of such a vector. The procedure proposed to find the dominant generalized eigenvector is the so-called power method [16], which starts with an initial candidate for the eigenvector, , and refines the current approximation using . Once converges, the corresponding eigenvalue is calculated as follows
(12) |
This method is far more efficient than computing the full decomposition. The complete procedure for the GEPort algorithm to jointly select the ports and design is summarized in Alg. 1.
IV Numerical Results
In this section, we conduct some experiments to assess the performance of the proposed schemes for multiport FAMA. Baseline parameters for the comparison are: , users/antennas at the BS side, a normalized fluid antenna length (1D case) and (2D case), FA ports, and active ports. Monte Carlo simulations based on the channel model in (3) are used. For benchmarking purposes, we use the cases of conventional slow-FAMA [9] (single RF chain) and CUMA (2 RF chains)[7], and compare them with the DC and GEPort strategies here proposed.
In Fig. 1 we evaluate the improvements in terms of the achievable average SE of user for the aforementioned schemes, as a function of the transmit SNR. Solid lines represent the case of users equipped with a 1D FA (, ), while dotted lines correspond to a 2D FA (, ). We see that GEPort achieves the highest SINR across all SNR levels. More importantly, the performance improvement grows when the system operates in the interference-limited regime (i.e., high transmit SNR). Also, we see that in such a regime, DC behaves similarly as CUMA (even better for the 2D case). Note that while CUMA only operates with 2 RF chains, it requires an arbitrary number of ports to be activated for signal combination.
Fig. 2 shows the relationship between the average SE and the number of active ports, . The transmit SNR is fixed and set to dB. As the number of active ports increases (number of RF chains in the proposed schemes), the performance of DC and GEPort substantially improves. The conventional slow FAMA scheme uses single port (i.e., ); CUMA implementation used 2 RF chains (i.e., in our comparison), although it effectively activates a much larger of FA ports as long as the SINR is improved under this combination scheme. Hence, the SE curves associated to these methods are constant. Interestingly, the simpler DC combining method performs better than CUMA beyond . Finally, the performance gap of GEPort compared to the reference schemes grows with the number of active ports for the ranges evaluated in our experiment333Since the number of selected ports in the proposed schemes equals the number of RF chains, a reasonably low value of should be considered for the sake of complexity reduction in the receiver implementation..
In Fig. 3 we evaluate the effect of densification in the performance, i.e., increasing for fixed. The simplest case of has been considered for benchmarking, with a transmit SNR= dB. We see that the effect of densification (i.e., increasing spatial correlation for the desired and interfering signals) affects the performance of the DC scheme: this confirms the rationale that the sequential design of the selection matrix and the combining filter (i.e., the multiport extension of slow-FAMA) does not optimally exploit the dependence structures between the matrices and . Conversely, GEPort scheme provides a substantial improvement over all competing schemes, although this effect tends to saturate under strong port densification.
V Conclusion
We showcased the potential of multiport reception in FA-assisted multiuser communications. The use of a reduced number of RF chains opens the potential to substantially improve performance under the open-loop slow-FAMA paradigm, as long as the design of the port selection matrix and combining vectors effectively incorporates the correlation structures of signals. This paves the way for the development of new signal processing schemes in FA-enabled multiport receivers.
Acknowledgment
The authors gratefully acknowledge Prof. Michael Joham for the insightful discussion that originally inspired the investigation of multiport reception in the context of FAMA, and Dr. Pablo Ramírez-Espinosa for his assistance in the slow-FAMA simulations.
Consider the Hermitian matrix , defined as , with eigenvalues and corresponding eigenvectors . We denote the -th entry of the eigenvector as , and introduce and as the principal minors of , and , respectively, obtained by deleting the -th row and the -th column of and . Accordingly, and we introduce the eigenvalues of as . Then the following eigenvector-eigenvalue identity holds [17]
(13) |
for all . Recall that the achievable SINR can be obtained by computing the eigenvalues derived from the Rayleigh quotient in (7). As such, we are interested in finding the indices and such that is maximum. Thus, under the assumption of eigenvalues ordered in ascending order, we get that and leads to the largest SINR value. As performing a search over to find is impractical, we alternatively use the equality in (13) to define a performance metric. To that end, we employ the equality for the dominant eigenvalue and the dominant eigenvector of with , and isolate the term corresponding to the SINR drop, that is
(14) |
getting (8) after rearranging the terms and introducing .
References
- [1] K.-K. Wong, A. Shojaeifard, K.-F. Tong, and Y. Zhang, “Fluid antenna systems,” IEEE Trans. Wireless Commun., vol. 20, no. 3, pp. 1950–1962, 2021.
- [2] W. K. New, K.-K. Wong, H. Xu, C. Wang, F. R. Ghadi, J. Zhang, J. Rao, R. Murch, P. Ramírez-Espinosa, D. Morales-Jimenez, C.-B. Chae, and K.-F. Tong, “A tutorial on fluid antenna system for 6g networks: Encompassing communication theory, optimization methods and hardware designs,” IEEE Commun. Surv. Tutor., pp. 1–1, 2024.
- [3] W. Kiat New, K.-K. Wong, H. Xu, F. Rostami Ghadi, R. Murch, and C.-B. Chae, “Channel estimation and reconstruction in fluid antenna system: Oversampling is essential,” IEEE Trans. Wireless Commun., vol. 24, no. 1, pp. 309–322, 2025.
- [4] K.-K. Wong, D. Morales-Jimenez, K.-F. Tong, and C.-B. Chae, “Slow Fluid Antenna Multiple Access,” IEEE Trans. Commun., vol. 71, no. 5, pp. 2831–2846, 2023.
- [5] K.-K. Wong and K.-F. Tong, “Fluid Antenna Multiple Access,” IEEE Trans. Wireless Commun., vol. 21, no. 7, pp. 4801–4815, 2022.
- [6] X. Lai, T. Wu, J. Yao, C. Pan, M. Elkashlan, and K.-K. Wong, “On Performance of Fluid Antenna System Using Maximum Ratio Combining,” IEEE Commun. Lett., vol. 28, no. 2, pp. 402–406, 2024.
- [7] K.-K. Wong, C.-B. Chae, and K.-F. Tong, “Compact ultra massive antenna array: A simple open-loop massive connectivity scheme,” IEEE Trans. Wireless Commun., vol. 23, no. 6, pp. 6279–6294, 2024.
- [8] K.-K. Wong, “Compact Ultra Massive Array (CUMA) with 4 RF Chains for Massive Connectivity,” in 2024 IEEE 25th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2024, pp. 286–290.
- [9] P. Ramírez-Espinosa, D. Morales-Jimenez, and K.-K. Wong, “A New Spatial Block-Correlation Model for Fluid Antenna Systems,” IEEE Trans. Wireless Commun., vol. 23, no. 11, pp. 15 829–15 843, 2024.
- [10] D. Gore, R. Nabar, and A. Paulraj, “Selecting an optimal set of transmit antennas for a low rank matrix channel,” in Proc. IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (ICASSP), vol. 5, 2000, pp. 2785–2788 vol.5.
- [11] M. Gharavi-Alkhansari and A. Gershman, “Fast antenna subset selection in MIMO systems,” IEEE Trans. Signal Process., vol. 52, no. 2, pp. 339–347, 2004.
- [12] A. Gorokhov, “Antenna selection algorithms for MEA transmission systems,” in Proc. IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), vol. 3, 2002, pp. III–2857–III–2860.
- [13] R. Méndez-Rial, C. Rusu, A. Alkhateeb, N. González-Prelcic, and R. W. Heath, “Channel estimation and hybrid combining for mmWave: Phase shifters or switches?” in Proc. Information Theory and Applications Workshop (ITA), 2015, pp. 90–97.
- [14] B. Ghojogh, F. Karray, and M. Crowley, “Eigenvalue and Generalized Eigenvalue Problems: Tutorial,” 2023. [Online]. Available: https://arxiv.org/abs/1903.11240
- [15] M. Schubert and H. Boche, “Solution of the Multiuser Downlink Beamforming Problem with Individual SINR Constraints,” IEEE Trans. Veh. Technol., vol. 53, no. 1, pp. 18–28, January 2004.
- [16] G. H. Golub and C. F. Van Loan, Matrix Computations, 4th ed. Baltimore: Johns Hopkins University Press, 2013.
- [17] P. B. Denton, S. J. Parke, T. Tao, and X. Zhang, “Eigenvectors from eigenvalues: A survey of a basic identity in linear algebra,” Bulletin of the American Mathematical Society, vol. 59, no. 1, p. 31–58, Feb. 2021. [Online]. Available: http://dx.doi.org/10.1090/bull/1722