Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 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

Layered Non-Orthogonal Random Access with SIC and Transmit Diversity for Reliable Transmissions (1712.02934v1)

Published 8 Dec 2017 in cs.IT and math.IT

Abstract: In this paper, we study a layered random access scheme based on non-orthogonal multiple access (NOMA) to improve the throughput of multichannel ALOHA. At a receiver, successive interference cancellation (SIC) is carried out across layers to remove the signals that are already decoded. A closed- form expression for the total throughput is derived under certain assumptions. It is shown that the transmission rates of layers can be optimized to maximize the total throughput and the proposed scheme can improve the throughput with multiple layers. Furthermore, it is shown that the optimal rates can be recursively found using multiple individual one-dimensional optimizations. We also modify the proposed layered random access scheme with contention resolution repetition diversity for reliable transmissions with a delay constraint. It is shown to be possible to have a low outage probability if the number of copies can be optimized, which is desirable for high reliability low latency communications.

Citations (31)

Summary

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