On Galois-Division Multiple Access Systems: Figures of Merit and Performance Evaluation
J.P.C.L. Miranda, H.M. de Oliveira

TL;DR
This paper introduces Galois-Division Multiple Access (GDMA), a novel multiple access scheme using finite field transforms, including a new Finite Field Hartley Transform, which offers efficient bandwidth use and compatibility with digital systems.
Contribution
The paper proposes GDMA schemes based on finite field transforms, introduces the Finite Field Hartley Transform, and evaluates their performance for digital communication systems.
Findings
GDMA offers compact bandwidth requirements.
Finite Field Hartley Transform enables efficient digital implementation.
Performance evaluation shows GDMA's effectiveness in digital systems.
Abstract
A new approach to multiple access based on finite field transforms is investigated. These schemes, termed Galois-Division Multiple Access (GDMA), offer compact bandwidth requirements. A new digital transform, the Finite Field Hartley Transform (FFHT) requires to deal with fields of characteristic p, p \neq 2. A binary-to-p-ary (p \neq 2) mapping based on the opportunistic secondary channel is introduced. This allows the use of GDMA in conjunction with available digital systems. The performance of GDMA is also evaluated.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDigital Filter Design and Implementation · Coding theory and cryptography · Cryptography and Residue Arithmetic
