Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Reduced Complexity Detection for Network-Coded Slotted ALOHA using Sphere Decoding (1512.02819v1)

Published 9 Dec 2015 in cs.IT and math.IT

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 and two through five sources, and error-rate performance results are provided.

Summary

We haven't generated a summary for this paper yet.