Name
Title | ||
|---|---|---|
Iterative Detection and Decoding of Finite-Length Polar Codes in Gaussian Multiple Access Channels |
Abstract | ||
|---|---|---|
We consider the usage of finite-length polar codes for the GMAC with a finite number of users. Based on the IDMA concept, we implement an iterative detection and decoding NOMA receiver that benefits from a low complexity, while scaling (almost) linearly with the amount of active users. We further show the conceptual simplicity of the BP-based decoder in a step-by-step illustration of its construction. Beyond its conceptual simplicity, this approach benefits from an improved performance when compared to some recent work tackling the same problem, namely the setup of finite-length FEC codes for finite-number of users. We consider the 5G polar code with a block length $N=512$ applied to both a two-user and a four-user GMAC scenario with a sum-rate of $R_{sum}=0.5$ and $R_{sum}=1$, respectively. Simulation results show that a BP-based SoIC receiver outperforms a JSC scheme. Finally, we investigate the effect of a concatenated repetition code which suggests that alternative polar code design rules are required in multi-user scenarios. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/IEEECONF51394.2020.9443374 | ACSSC |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Moustafa Ebada | 1 | 0 | 1.01 |
| sebastian cammerer | 2 | 157 | 16.76 |
| Ahmed Elkelesh | 3 | 0 | 2.03 |
| Marvin Geiselhart | 4 | 2 | 1.74 |
| Stephan ten Brink | 5 | 2912 | 204.86 |