On Galois-Division Multiple Access Systems: Figures of Merit and Performance Evaluation

2015/02/12 by Miranda, J. P. C. L., de Oliveira, H. M.
#Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1502.03698

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 ≠ 2. A binary-to-p-ary (p ≠ 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.

Related

• Efficient Multiplex for Band-Limited Channels: Galois-Field Division Multiple Access
• Orthogonal Multilevel Spreading Sequence Design
• Spread-Spectrum Based on Finite Field Fourier Transforms
• Finite Field Multiple Access
• Orthogonal vs Non-Orthogonal Multiple Access with Finite Input Alphabet and Finite Bandwidth