Skip to content
Open access

Codeword Design for SIC-Based Multiple Access With Bounded Pairwise Overlap and Spatial Coupling

2026 · IEEE Transactions on Communications · Vol 74, pp. 15630-15643 · 0 citations · 47 references

TL;DR

Through extensive simulations, it is demonstrated that the stable throughput achieved by the proposed deterministic scheme closely approaches the density-evolution threshold of randomized convolutional coded Poisson receivers (CCPR), including spatially coupled <inline-formula> <tex-math notation="LaTeX">$D$ </tex-math></inline-formula>-fold ALOHA systems and power-domain non-orthogonal multiple access (NOMA).

Abstract

This paper proposes a deterministic codeword design for successive interference cancellation (SIC)-based random access, targeting massive machine-type communications (mMTC) networks. By exploiting algebraic structures over Galois fields and perfect difference sets, we construct a large family of spatially coupled codewords that prescribe <inline-formula> <tex-math notation="LaTeX">$d$ </tex-math></inline-formula> repetitive transmissions within a frame of time slots. The proposed construction is shown to satisfy a bounded pairwise overlap (BPO) property, under which any two distinct codewords overlap in at most one transmission slot among their <inline-formula> <tex-math notation="LaTeX">$d$ </tex-math></inline-formula> replicas. This property eliminates four-cycles formed by two distinct codewords and reduces strong pairwise dependencies in the resulting user–slot bipartite graph, which is favorable for iterative SIC decoding. Through extensive simulations, we demonstrate that the stable throughput achieved by the proposed deterministic scheme closely approaches the density-evolution threshold of randomized convolutional coded Poisson receivers (CCPR), including spatially coupled <inline-formula> <tex-math notation="LaTeX">$D$ </tex-math></inline-formula>-fold ALOHA systems and power-domain non-orthogonal multiple access (NOMA). In particular, the proposed scheme achieves a stable throughput of approximately 0.9 for standard slotted ALOHA, which increases to about 1.37 with power-domain NOMA and to 2.8 under 3-fold ALOHA. To characterize finite-length performance, we analyze the error floor by assuming that dominant stopping events arise from codeword collisions and derive a Poisson approximation for the resulting packet loss rate. Simulation results show good agreement with the analytical approximations over the considered operating regimes.

Read PDF

Similar papers

Open access 2026

Covariance-Aware Fixed-Cardinality IRS Design With Quantized Phases for Multiuser MISO and MIMO Systems

This paper develops a covariance-aware, exact-cardinality design for multiuser MISO and multi-stream MIMO downlinks that outperforms static and energy-ranked subsets while retaining most of the corresponding full-surface quantized-phase rate with fewer controlled cells.

Z. Albataineh, Jamil K. J. Bataineh, M. A. Al Bataineh et al. · 0 citations
Sep 2026

Concurrent Coded Signal-Multiplexing Ranging for Half-Duplex Asynchronous Networks

A concurrent coded SM-NR (CC-SM-NR) framework for asynchronous half-duplex networks is proposed and a low-complexity scheduling algorithm is proposed that achieves the minimum round count within the constant-weight codeword class.

Zi-Jian Zhang, Yuan Shen · 0 citations
Open access 2026

Prime-Interleaved Tandem Spreading: A Scalable 2-D User Identity Framework for 6G Massive Grant-Free Access

Grant-free random access is essential for massive connectivity in sixth-generation (6G) networks, but conventional tandem spreading multiple access (TSMA) suffers from identity exhaustion due to its one-dimensional user-to-codebook mapping. To address this limitation, this paper proposes prime-interleaved tandem spread...

Kai-Lin Wang, Guo-Yu Ma, Jing-Ya Yang et al. · 0 citations
Open access 2026

CRC-Polar-Inspired PAC Codes: Enumeration and Minimum-Weight Codeword Pruning

Cyclic redundancy check-aided polar (CRC-polar) codes with successive cancellation list (SCL) decoding are widely recognized for their competitive error correction performance. This paper investigates the minimum-weight codewords (MWCs) in CRC-polar codes, analyzes how CRC constraints eliminate these codewords, and ide...

Xin-Yi Gu, Mohammad Rowshan, Jin-Hong Yuan · 0 citations
Sep 2026

CPM-LDPC Codes Attaining the Minimum-Distance Bound

We study binary quasi-cyclic LDPC codes whose parity-check matrices are full arrays of single circulant permutation matrices (CPMs), referred to here as CPM-LDPC codes. Their minimum distance is at most $(J+1)!$, where $J$ is the column weight. For every fixed pair of column and row weights $2\le J<L$, we show that thi...

Kenta Kasai · 0 citations
Preprint Oct 2026

Function-Correcting Lee-distance Codes for Symbol-Pair Read Channels

Function-correcting codes (FCCs) protect specified function evaluations of messages against errors while reducing the redundancy required for reliable communication. We study FCCs for symbol-pair read channels, motivated by high-density storage systems that read overlapping symbol pairs. Phase-shift keying (PSK) modula...

K. Hareesh, B. Rajan · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.