Collision Diversity SCRAM: Beyond the Sphere-Packing Bound
Sally Nafie, Joerg Robert, Albert Heuberger

TL;DR
This paper introduces Collision Diversity SCRAM, a novel scheme that leverages collisions to enhance spectral efficiency and surpass the Sphere-Packing Bound, addressing future 6G connectivity and reliability challenges.
Contribution
The paper proposes CoD SCRAM, an information-theoretic enhancement of SCRAM that exploits collision diversity to outperform traditional schemes and surpass the Sphere-Packing Bound.
Findings
CoD SCRAM outperforms conventional SCRAM.
It surpasses the Sphere-Packing Bound at certain code lengths.
It exceeds the performance of state-of-the-art NOMA schemes.
Abstract
This paper presents a novel scheme dubbed Collision Diversity (CoD) SCRAM, which is provisioned to meet the challenging requirements of the future 6G, portrayed in massive connectivity, reliability, and ultra-low latency. The conventional SCRAM mechanism, which stands for Slotted Coded Random Access Multiplexing, is a hybrid decoding scheme, that jointly resolves collisions and decodes the Low Density Parity Check (LDPC) codewords, in a similar analogy to Belief Propagation (BP) decoding on a joint three-layer Tanner graph. The CoD SCRAM proposed herein tends to enhance the performance of SCRAM by adopting an information-theoretic approach that tends to maximize the attainable Spectral Efficiency. Besides, due to the analogy between the two-layer Tanner graph of classical LDPC codes, and the three-layer Tanner graph of SCRAM, the CoD SCRAM adopts the well-developed tools utilized to…
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
TopicsDistributed systems and fault tolerance · Formal Methods in Verification · Modular Robots and Swarm Intelligence
