arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2211.16010cs.ITeess.SPmath.IT
收藏

基于图搜索的极化码设计

Graph Search based Polar Code Design

Marvin Geiselhart, Andreas Zunker, Ahmed Elkelesh, Jannis Clausius, Stephan ten Brink

摘要:

众所周知,为了实现其全部潜力,极化码的设计必须针对其预期的解码算法进行定制。虽然对于连续消除(SC)解码,信息理论上的最优构造是可用的,但是用于其他解码算法(诸如置信传播(BP)解码)的码设计只能使用广泛的蒙特卡罗模拟来优化。我们建议将极化码的设计过程视为图搜索问题,从而更系统地处理它。基于这种形式主义,与最先进的遗传算法(GenAlg)和基于深度学习的设计算法相比,设计时间复杂度可以显著降低。最后,分析了算法的复杂度和所构造的极化码的误码性能。

英文摘要:

It is well known that to fulfill their full potential, the design of polar codes must be tailored to their intended decoding algorithm. While for successive cancellation (SC) decoding, information theoretically optimal constructions are available, the code design for other decoding algorithms (such as belief propagation (BP) decoding) can only be optimized using extensive Monte Carlo simulations. We propose to view the design process of polar codes as a graph search problem and thereby approaching it more systematically. Based on this formalism, the design-time complexity can be significantly reduced compared to state-of-the-art Genetic Algorithm (GenAlg) and deep learning-based design algorithms. Moreover, sequences of rate-compatible polar codes can be efficiently found. Finally, we analyze both the complexity of the proposed algorithm and the error-rate performance of the constructed codes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑