Finite Field Multiple Access

Qi-yue Yu; Jiang-xuan Li; Shu Lin

Home/Archive/arXiv

arXiv · 2303.14086

Finite Field Multiple Access

Qi-yue Yu·Jiang-xuan Li·Shu Lin

View original source ↗Read source document ↗Export metadata ↓

Abstract

In the past several decades, various techniques have been developed and used for multiple-access (MA) communications. With the new applications for 6G, it is desirable to find new resources, physical or virtual, to confront the fast development of MA communication systems. For binary source transmission, this paper introduces the concept of element-pair (EP), and the Cartesian product of $J$ distinct EPs can form an EP code. EPs are treated as virtual resources in finite fields to distinguish users. This approach allows for the reordering of channel encoding and multiplexing modules, allowing superimposed signals to function as codewords decodable by a channel code, thereby effectively addressing the finite blocklength (FBL) challenge in multiuser transmissions. We present methods for constructing symbol-wise EP codes with the unique sum-pattern mapping (USPM) property using finite fields. Based on the orthogonal EP code constructed over GF($2^m$), we develop a time-division mode of finite-field multiple-access (FFMA) systems over a Gaussian multiple-access channel (GMAC), including both sparse-form and diagonal-form structures. Based on the diagonal-form (DF) structure, we introduce a specific configuration referred to as polarization-adjusted DF-FFMA, which achieves both power gain and coding gain across the entire blocklength. The proposed FFMA is then applied to network layer and forms network FFMA systems for pure digital networks. Simulation results demonstrate that, compared to popular complex-field MA systems, the proposed FFMA systems can offer superior error performance in a GMAC.

Explore related subjects

cs.IT math.IT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Qi-yue Yu, Jiang-xuan Li, Shu Lin. 2025-06-07. Finite Field Multiple Access. https://arxiv.org/abs/2303.14086

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT↗

arXiv2026

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT↗

arXiv2026

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT↗