Layered Non-Orthogonal Random Access with SIC and Transmit Diversity for Reliable Transmissions

December 08, 2017 Β· Declared Dead Β· πŸ› IEEE Transactions on Communications

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Jinho Choi arXiv ID 1712.02934 Category cs.IT: Information Theory Citations 35 Venue IEEE Transactions on Communications Last Checked 6 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted