Reduced Complexity Detection for Network-Coded Slotted ALOHA using Sphere Decoding
Terry Ferrett, Matthew C. Valenti

TL;DR
This paper proposes a sphere decoding-based receiver for network-coded slotted ALOHA that reduces detection complexity while maintaining performance, enabling efficient multi-source detection in fading channels.
Contribution
It introduces a sphere decoding approach for network-coded slotted ALOHA, improving detection efficiency for multiple sources and arbitrary modulation schemes.
Findings
Sphere decoding reduces detection complexity significantly.
The system maintains low error rates with multiple sources.
Performance is validated through simulations for various sources and modulation orders.
Abstract
Network-coded slotted ALOHA (NCSA) is a re- finement to the classic slotted ALOHA protocol which im- proves throughput by enabling multiple source transmissions per ALOHA slot using physical-layer network coding (PNC). The receiver detects the network-coded combination of bits during every slot and recovers information bits by solving a system of linear equations. This work develops a receiver capable of detecting the network-coded combination of bits during a slot considering an arbitrary number of sources, orthogonal modulation, and a block fading channel. Maximum-likelihood detection of the network-coded symbol at the receiver becomes complex as the number of sources is increased. To reduce this complexity, sphere decoding is applied at the receiver to limit the number of constellation symbols the receiver must consider for detection. The system is simulated for two modulation orders…
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.
