Iterative Detection and Decoding of Finite-Length Polar Codes in Gaussian Multiple Access Channels
Moustafa Ebada, Sebastian Cammerer, Ahmed Elkelesh, Marvin Geiselhart, and Stephan ten Brink

TL;DR
This paper proposes an iterative detection and decoding scheme for finite-length polar codes in Gaussian multiple access channels, demonstrating improved performance and low complexity for multi-user scenarios relevant to 5G.
Contribution
It introduces a BP-based iterative receiver for polar codes in GMAC, showing enhanced performance over existing methods and analyzing the impact of concatenated repetition codes.
Findings
BP-based SoIC receiver outperforms JSC scheme
Performance benefits observed for 5G polar codes in multi-user GMAC
Concatenated repetition codes influence polar code design in multi-user contexts
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 applied to both a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
