Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Finite Field Multiple Access for Sourced Massive Random Access with Finite Blocklength

Qi-yue Yu, Shi-wen Lin, Shu Lin

TL;DR

This paper establishes that when the Cartesian product of distinct EPs satisfies the unique sum-pattern mapping (USPM) structural property, these EPs can form a uniquely-decodable EP (UD-EP) code, and develops a time-division mode of finite-field multiple-access (FFMA) systems, consisting of sparse-form and diagonal-form structures.

Abstract

For binary source transmission, this paper introduces the concept of element-pair (EP) and establishes that when the Cartesian product of $J$ distinct EPs satisfies the unique sum-pattern mapping (USPM) structural property, these $J$ EPs can form a uniquely-decodable EP (UD-EP) code. EPs are treated as virtual resources allocated to different users in finite fields, serving to distinguish users. This approach enables the reordering of multiplexing and channel encoding modules, effectively addressing the finite blocklength (FBL) challenge in multiuser reliable transmission. Next, we introduce an orthogonal EP code $Ψ_{\rm o, B}$ constructed over an extension field GF($2^m$). Using this EP code, we develop a time-division mode of finite-field multiple-access (FFMA) systems, consisting of sparse-form and diagonal-form structures. Based on the diagonal-form (DF) structure, we present a specific configuration, referred to as polarization-adjusted DF-FFMA, which can simultaneously obtain the power gain and coding gain from the entire blocklength. Simulation results demonstrate that the proposed FFMA systems significantly improve error performance over a Gaussian multiple-access channel, compared to a slotted ALOHA system.

Finite Field Multiple Access for Sourced Massive Random Access with Finite Blocklength

TL;DR

This paper establishes that when the Cartesian product of distinct EPs satisfies the unique sum-pattern mapping (USPM) structural property, these EPs can form a uniquely-decodable EP (UD-EP) code, and develops a time-division mode of finite-field multiple-access (FFMA) systems, consisting of sparse-form and diagonal-form structures.

Abstract

For binary source transmission, this paper introduces the concept of element-pair (EP) and establishes that when the Cartesian product of distinct EPs satisfies the unique sum-pattern mapping (USPM) structural property, these EPs can form a uniquely-decodable EP (UD-EP) code. EPs are treated as virtual resources allocated to different users in finite fields, serving to distinguish users. This approach enables the reordering of multiplexing and channel encoding modules, effectively addressing the finite blocklength (FBL) challenge in multiuser reliable transmission. Next, we introduce an orthogonal EP code constructed over an extension field GF(). Using this EP code, we develop a time-division mode of finite-field multiple-access (FFMA) systems, consisting of sparse-form and diagonal-form structures. Based on the diagonal-form (DF) structure, we present a specific configuration, referred to as polarization-adjusted DF-FFMA, which can simultaneously obtain the power gain and coding gain from the entire blocklength. Simulation results demonstrate that the proposed FFMA systems significantly improve error performance over a Gaussian multiple-access channel, compared to a slotted ALOHA system.
Paper Structure (12 sections, 22 equations, 1 figure)

This paper contains 12 sections, 22 equations, 1 figure.

Table of Contents

  1. Introduction
  2. Orthogonal EP Code over GF($2^m$)
  3. Encoding of Orthogonal UD-EP Codes
  4. Binary to Finite-field GF($q$) Transform Function
  5. Orthogonal Encoding of an Error-Correcting Code
  6. An FFMA System in a GMAC
  7. Transmitter of a Sparse-form FFMA System
  8. Receiver of a Sparse-form FFMA System
  9. A Diagonal-form FFMA System
  10. A Polarization-adjusted FFMA System
  11. Simulation results
  12. Conclusions

Figures (1)

  • Figure 1: BER performances of different systems over a GMAC. The proposed FFMA systems are used a binary $(6000, 3000)$ LDPC code ${\mathcal{C}}_{gc}$ for error control, and the slotted ALOHA utilizes repetition code for error control, where $N = 6000$, $K = 10$ bits, $\mu_{\rm pas} = 300$, and $J = 1, 100, 300$.