%0 Journal Article %1 ebada2020iterative %A Ebada, Moustafa %A Cammerer, Sebastian %A Elkelesh, Ahmed %A Geiselhart, Marvin %A Brink, Stephan ten %D 2020 %K myown from:mgeiselhart coding %T Iterative Detection and Decoding of Finite-Length Polar Codes in Gaussian Multiple Access Channels %U http://arxiv.org/abs/2012.01075 %X We consider the usage of finite-length polar codes for the Gaussian multiple access channel (GMAC) with a finite number of users. Based on the interleave-division multipleaccess (IDMA) concept, we implement an iterative detection and decoding non-orthogonal multiple access (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 belief propagation (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 forward errorcorrection (FEC) codes for finite-number of users. We consider the 5th generation mobile communication (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 soft interference cancellation (SoIC) receiver outperforms a joint successive cancellation (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.

@article{ebada2020iterative, abstract = {We consider the usage of finite-length polar codes for the Gaussian multiple access channel (GMAC) with a finite number of users. Based on the interleave-division multipleaccess (IDMA) concept, we implement an iterative detection and decoding non-orthogonal multiple access (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 belief propagation (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 forward errorcorrection (FEC) codes for finite-number of users. We consider the 5th generation mobile communication (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 soft interference cancellation (SoIC) receiver outperforms a joint successive cancellation (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.}, added-at = {2021-06-16T13:53:55.000+0200}, author = {Ebada, Moustafa and Cammerer, Sebastian and Elkelesh, Ahmed and Geiselhart, Marvin and Brink, Stephan ten}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/282a368294a0bf2323ec66383024b7a1c/inue}, description = {[2012.01075] Iterative Detection and Decoding of Finite-Length Polar Codes in Gaussian Multiple Access Channels}, interhash = {beb6c6cd257860dc9d41751834bd65d4}, intrahash = {82a368294a0bf2323ec66383024b7a1c}, keywords = {myown from:mgeiselhart coding}, note = {cite arxiv:2012.01075 Comment: Asilomar2020}, timestamp = {2021-06-16T11:53:55.000+0200}, title = {Iterative Detection and Decoding of Finite-Length Polar Codes in Gaussian Multiple Access Channels}, url = {http://arxiv.org/abs/2012.01075}, year = 2020 }