# On the Analysis of T-Fold Coded Slotted ALOHA for a Fixed Error Probability

Daria Ustinova, Pavel Rybin, Alexey Frolov

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

## Abstract

In this paper we consider a T-fold coded slotted ALOHA (CSA) scheme. The main difference of this scheme in comparison to an ordinary CSA is as follows: we assume that any collisions of order up to T can be resolved. The main goal of the work is to achieve maximum throughput (the number of successfully decoded packets per slot) on condition of a fixed error probability $\varepsilon$. A modified density evolution (DE) method was proposed and used to find an asymptotically optimal repetition count distribution for different value of T. The capacity bound has been proved for different T, admitting an error to be less than $\varepsilon$.

Original language English 11th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, ICUMT 2019 IEEE Computer Society 9781728157634 https://doi.org/10.1109/ICUMT48472.2019.8970878 Published - Oct 2019 11th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, ICUMT 2019 - Dublin, IrelandDuration: 28 Oct 2019 → 30 Oct 2019

### Publication series

Name International Congress on Ultra Modern Telecommunications and Control Systems and Workshops 2019-October 2157-0221 2157-023X

### Conference

Conference 11th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, ICUMT 2019 Ireland Dublin 28/10/19 → 30/10/19

## Fingerprint

Dive into the research topics of 'On the Analysis of T-Fold Coded Slotted ALOHA for a Fixed Error Probability'. Together they form a unique fingerprint.