Asymptotic Performance of Coded Slotted ALOHA with Multi Packet Reception

October 06, 2017 Β· Declared Dead Β· πŸ› IEEE Communications Letters

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

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Cedomir Stefanovic, Enrico Paolini, Gianluigi Liva arXiv ID 1710.02292 Category cs.IT: Information Theory Citations 47 Venue IEEE Communications Letters Last Checked 6 months ago
Abstract
In this letter, we develop a converse bound on the asymptotic load threshold of coded slotted ALOHA (CSA) schemes with K-multi packet reception capabilities at the receiver. Density evolution is used to track the average probability of packet segment loss and an area matching condition is applied to obtain the converse. For any given CSA rate, the converse normalized to K increases with K, which is in contrast with the results obtained so far for slotted ALOHA schemes based on successive interference cancellation. We show how the derived bound can be approached using spatially-coupled CSA.
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