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.

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