Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

A Remark on Downlink Massive Random Access

Yuchen Liao, Wenyi Zhang

TL;DR

This work reframes downlink massive random access (DMRA) as a covering-array design problem and proves that deterministic, greedy-covering-array constructions can achieve an overhead of at most $1+\log_2 e$ bits, independent of the total number of users $n$. By encoding the index of the first covering row that matches the active pattern and applying a lossless code, the authors bound the expected codeword length $\bar{\ell}$ to $\bar{\ell} < k \log q + 1 + \log e$. They also present bit-by-bit and fixed-length variants, showing how the overhead scales with the message alphabet size and the parameter $n$, and provide numerical experiments validating the theoretical overhead and illustrating the geometry of pattern coverage. The work establishes a deterministic alternative to ensemble-based random coding for DMRA, with practical implications for scalable downlink scheduling in massive access regimes.

Abstract

In downlink massive random access (DMRA), a base station transmits messages to a typically small subset of active users, selected randomly from a massive number of total users. Explicitly encoding the identities of active users would incur a significant overhead scaling logarithmically with the number of total users. Recently, via a random coding argument, Song, Attiah and Yu have shown that the overhead can be reduced to within some upper bound irrespective of the number of total users. In this remark, recognizing that the code design for DMRA is an instance of covering arrays in combinatorics, we show that there exists deterministic construction of variable-length codes that incur an overhead no greater than $1 + log_2 e$ bits.

A Remark on Downlink Massive Random Access

TL;DR

This work reframes downlink massive random access (DMRA) as a covering-array design problem and proves that deterministic, greedy-covering-array constructions can achieve an overhead of at most bits, independent of the total number of users . By encoding the index of the first covering row that matches the active pattern and applying a lossless code, the authors bound the expected codeword length to . They also present bit-by-bit and fixed-length variants, showing how the overhead scales with the message alphabet size and the parameter , and provide numerical experiments validating the theoretical overhead and illustrating the geometry of pattern coverage. The work establishes a deterministic alternative to ensemble-based random coding for DMRA, with practical implications for scalable downlink scheduling in massive access regimes.

Abstract

In downlink massive random access (DMRA), a base station transmits messages to a typically small subset of active users, selected randomly from a massive number of total users. Explicitly encoding the identities of active users would incur a significant overhead scaling logarithmically with the number of total users. Recently, via a random coding argument, Song, Attiah and Yu have shown that the overhead can be reduced to within some upper bound irrespective of the number of total users. In this remark, recognizing that the code design for DMRA is an instance of covering arrays in combinatorics, we show that there exists deterministic construction of variable-length codes that incur an overhead no greater than bits.
Paper Structure (11 sections, 1 theorem, 19 equations, 1 figure, 1 table)

This paper contains 11 sections, 1 theorem, 19 equations, 1 figure, 1 table.

Table of Contents

  1. Introduction
  2. Related Works
  3. Massive Access
  4. Covering Arrays
  5. Problem Formulation
  6. Main Result
  7. Deterministic versus Random Coding
  8. Bit-by-bit Coding
  9. Fixed-length Coding
  10. Numerical Experiments
  11. Conclusion

Key Result

Theorem 1

For any $(n, k, q)$, $k \leq n$, $q \geq 2$, there exist deterministic DMRA codes such that the expected codeword length satisfies:

Figures (1)

  • Figure 1: Expected codeword length $\bar{\ell}$ vs number of total users $n$

Theorems & Definitions (2)

  • Theorem 1
  • proof