Fluid Antenna Multiple Access for Noise Modulation
Hadi Zayyani, Felipe A. P. de Figueiredo
Abstract
Noise modulation (NoiseMod) encodes information in the variance of a noise-like waveform. Its noncoherent structure enables low-complexity links, but co-channel users are challenging because interference affects the same variance statistic used for detection. We study fluid antenna multiple access (FAMA) for two-level NoiseMod with independent random bits from each interferer, producing two possible nonzero interference variances. We adopt exact finite-sample maximum-likelihood energy detection from prior NoiseMod/TNM work. We derive the exact single-port moment-generating function and moments of the random-bit aggregate interference, including heterogeneous user powers, and prove that the port minimizing conditional BEP is k Hk/(σw2+Jk), where Hk is desired-link power and Jk is instantaneous bit-state-aware interference variance. For independent fading ports, the common interferer-bit vector couples per-port decision metrics; conditioning on the number of high-state interferers yields an exact binomial-mixture order-statistic representation and avoids the generally invalid rule FZ=FZNp. For spatially correlated operation, an integer-μ κ-μ benchmark uses full pairwise Jakes correlation in scattered fields, with channel-averaged BEP evaluated by conditional Monte Carlo. A standard-error-aware load study shows increased admissible co-channel users as spatial degrees of freedom grow. Finally, a finite-sample variance-domain sensing diagnostic quantifies the oracle gap under frozen channels and interferer states, providing a lower-bound warning on fast-FAMA sensing difficulty rather than a deployable acquisition protocol.
Create a lesson
Related papers
An Explicit Family of Log-Concave Counterexamples to the Gaussian Completely Monotone Conjecture
Jiayang Zou, Luyao Fan, Jiayang Gao et al.
Strengthening Recursive Constructions for Zero-Error Shannon Capacity
Ravi Tandon
The generalized covering radii of Melas codes
Shuxing Li, Maosheng Xiong
Efficient Polynomial-Time Decoding of Simplicial Anticodes with Near-Optimal Performance
Antonio Jesús Lorite-López, Daniel Camazón-Portela, Juan Antonio López-Ramos
Multi-Access Speculative Inference: Uplink or Downlink?
Chang Cai, Kaibin Huang
A General Plotkin-type Bound on Function-Correcting Codes with Wyner-Graham Distance
Kanchana Lokshmii Jagatti, K. Hareesh, N. T. Rashid Ummer et al.