Rate-Compatible Codes Based on Punctured Polar Codes for Future Wireless Applications

用于未来无线应用的基于穿孔极性码的速率兼容码

• 批准号: 412009386
• 负责人: Professorin Dr.-Ing. Anke Schmeink
• 金额: --
• 依托单位: INDA - Chair of Information Theory and Data Analytics
• 依托单位国家: 德国
• 项目类别: Research Grants
• 财政年份: 2018
• 资助国家: 德国
• 起止时间: 2017-12-31 至 2022-12-31
• 项目状态: 已结题
• 来源: https://gepris.dfg.de/gepris/projekt/412009386?language=en
• 关键词: Rate; Compatible; Codes; Based; Punctured

In this proposal, we design constructions of rate-compatible families of codes based on puncturing polar codes. To overcome the length restrictions imposed by their standard construction, we explore three novel approaches striving for optimal solutions, as well as devising efficient heuristics.Facilitating a low-complexity encoder and decoder structure is a design goal of paramount interest, enabling competitive performance in latency-constrained environments. Applications for the families of codes constructed in this proposal are found in relay scenarios, as well as hybrid ARQ schemes with incremental redundancy (HARQ-IR schemes).In their original design, possible block lengths of polar codes are limited to integer powers of the dimension underlying polarization kernel. As a result, it is non-trivial to adapt their lengths more flexibly. One promising way to do so is given by puncturing.In order to construct rate-compatible code families based on puncturing polar codes, the puncturing patterns have to satisfy certain nesting constraints, hence necessitating development of methods to accomodate for these additional constraints.As a first step, a joint optimization strategy based on exploiting structural properties of puncturing patterns is proposed, attempting optimal construction of punctured polar codes by jointly optimizing the index set and the puncturing pattern. Furthermore, exploring efficient heurisitcs for the construction of rate-compatible code families based on puncturing polar codes, two novel puncturing approaches are investigated, incorporating the aformentioned constraints of nested puncturing patterns. The first approach is based on algebraic decompositions of the polar code generator matrix, while the second adapts the promising technique of quasi-uniform puncturing.Two intersectional tasks help to advance these findings by improving the performance of the resulting code constructions. The first aims at enhancing error correction capabilities by assisting decoders via additional constraints, given by dynamic frozen symbols. The second explores a technique to improve the quality of the index set selection via integer linear programming.Finally, we build on our existing research in the theory of relaying systems. As these results assume perfect adaptibility of code rates via adapting the length of the codes, relaying scenarios provide application domains for rate-compatible code families of paramount interest. As a second application domain, we explore the performance of the rate-compatible code families developed in HARQ-IR schemes.

在这个建议中，我们设计的构造速率兼容的家庭的代码的基础上打孔极化码。为了克服其标准建设所施加的长度限制，我们探索了三种新的方法，努力寻求最佳的解决方案，以及设计高效的approximatistics.Facilitating一个低复杂度的编码器和解码器的结构是一个最重要的利益的设计目标，使竞争力的性能在延迟受限的环境。在该方案中构造的码族的应用被发现在中继场景中，以及具有增量冗余的混合ARQ方案（HARQ-IR方案）中。在它们的原始设计中，极化码的可能块长度被限制为极化核底层维度的整数幂。因此，更灵活地调整它们的长度是很重要的。为了构造基于打孔极化码的速率兼容码族，打孔模式必须满足一定的嵌套约束，因此需要开发适应这些额外约束的方法。作为第一步，提出了一种基于打孔模式结构特性的联合优化策略，通过联合优化所述索引集和所述打孔模式来尝试打孔极化码的最佳构造。此外，为了探索基于打孔极化码构造速率兼容码族的有效方法，研究了两种新的打孔方法，并结合了上述嵌套打孔模式的约束条件。第一种方法基于极化码生成矩阵的代数分解，而第二种方法采用了准均匀打孔技术，两个交叉任务有助于通过提高所得码构造的性能来推进这些发现。第一个目标是通过动态冻结符号提供的额外约束来帮助解码器增强纠错能力。第二部分探讨了一种通过整数线性规划来提高指标集选择质量的方法。最后，我们在中继系统理论方面的现有研究的基础上进行了进一步的研究。由于这些结果假设完美的自适应码率通过适应的代码的长度，中继方案提供了应用领域的速率兼容的代码家庭的最重要的利益。作为第二个应用领域，我们探讨了HARQ-IR方案中开发的速率兼容码族的性能。