论文标题
高斯多访问通道中有限长度代码的迭代检测和解码
Iterative Detection and Decoding of Finite-Length Polar Codes in Gaussian Multiple Access Channels
论文作者
论文摘要
我们考虑使用有限数量的用户使用有限长度的极性代码（GMAC）。基于Interleave Division MultipleAccess（IDMA）概念，我们实现了迭代检测和解码非正交多访问（NOMA）接收器，该接收器受益于低复杂性，同时（几乎）与活跃用户的数量线性缩放（几乎）。我们进一步展示了信仰传播（BP）的解码器的概念简单性，这是其构造的逐步说明。除了其概念上的简单性外，与最近解决相同问题的一些工作相比，这种方法受益于改进的性能，即有限长度远期错误纠正（FEC）代码的有限用户编码的设置。我们考虑使用块长度$ n = 512 $的第五代移动通信（5G）极性代码，分别应用于两用户和四用户GMAC方案，总和率为$ r_ {sum} = 0.5 $和$ r_ {sum {sum} = 1 $。仿真结果表明，基于BP的软干扰取消（SOIC）接收器的表现优于关节连续取消（JSC）方案。最后，我们研究了串联重复代码的效果，该代码表明在多用户方案中需要替代极性代码设计规则。
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.
