A Recursive Puncturing Method for PAC Codes Based on the Partial Order

IF 3.7 3区计算机科学 Q2 TELECOMMUNICATIONS

IEEE Communications Letters Pub Date : 2025-03-07 DOI:10.1109/LCOMM.2025.3549092

Xiaoyuan Li;Dengsheng Lin;Yue Xiao;Ming Xiao

引用次数: 0

Abstract

The development of polarization-adjusted convolutional (PAC) codes has introduced a class of efficient designs for short packet transmission. In this contribution, aiming at more flexible code length and rate matching for time-varying channel scenarios, a low-complexity puncturing algorithm for PAC codes is proposed. Specifically, we introduce a Gaussian approximation (GA) algorithm for PAC codes and propose a GA-based optimization method for punctured patterns. Building on this, we present a Gaussian inverse mapping method based on partial order, utilizing a recursive approach to construct the initial set, which significantly reduces the search complexity. Subsequently, we develop a recursive puncturing algorithm based on partial order. Finally, we integrate this method with Reed-Muller (RM) rules, further reducing the complexity.

查看原文本刊更多论文

一种基于偏序的PAC码的递归穿刺方法

极化调整卷积码（PAC）的发展为短分组传输引入了一类高效的设计。针对时变信道场景下更灵活的码长和码率匹配问题，提出了一种低复杂度的PAC码穿刺算法。具体来说，我们引入了一种用于PAC码的高斯逼近算法，并提出了一种基于高斯逼近的穿孔图案优化方法。在此基础上，提出了一种基于偏序的高斯逆映射方法，利用递归方法构造初始集，显著降低了搜索复杂度。随后，我们开发了一种基于偏序的递归穿刺算法。最后，我们将该方法与Reed-Muller （RM）规则相结合，进一步降低了复杂度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE Communications Letters 工程技术-电信学

CiteScore

8.10

自引率

7.30%

发文量

590

审稿时长

2.8 months

期刊介绍： The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of communication systems.