A Path Probability Perspective on Rate-Profiling Design for Polarization-Adjusted Convolutional (PAC) Codes Under List Decoding
- 30 December 2024
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (8) , 5481-5494
Abstract
A novel rate-profiling design is proposed for polarization-adjusted convolutional (PAC) codes under list decoding, adopting a path probability perspective. Inspired by the concepts of Hamming distance and Hamming weight, the concepts of path probability distance (PPD) and path probability weight (PPW) are innovatively introduced to measure the disparity between the erroneous paths and the correct path for PAC codes under probabilistic decoding. An in-depth analysis of the recursion of node log-likelihood ratios (LLRs) in the factor graph is conducted, elucidating the derivation of a lower bound on the PPW as a consequential outcome. Utilizing the concept of the PPW, a rate-profiling design algorithm is proposed to establish the reliability ranking for the bit-channels of PAC codes. Simulation results demonstrate that PAC codes employing the proposed rate-profiling exhibit advantages over alternative rate-profiling and other state-of-the-art polar coding schemes across various block lengths and code rates under short decoding list sizes.Keywords
Funding Information
- National Natural Sciences Foundation of China (62301185, 62027802)
- Guangdong Science and Technology Planning Project (2021A1515110071)
- ZTE Industry-University-Institute Cooperation Funds
- The Major Key Project of PCL (PCL2024A01)
This publication has 24 references indexed in Scilit:
- A Weighted Sum Based Construction of PAC CodesIEEE Communications Letters, 2022
- List Decoding of Arıkan’s PAC Codes2020
- How to Modify Polar Codes for List Decoding2019
- Stepped List Decoding for Polar Codes2018
- Polar SubcodesIEEE Journal on Selected Areas in Communications, 2015
- Efficient Design and Decoding of Polar CodesIEEE Transactions on Communications, 2012
- Performance of Polar Codes with the Construction using Density EvolutionIEEE Communications Letters, 2009
- Performance and construction of polar codes on symmetric binary-input memoryless channels2009
- Channel coding: The road to channel capacityProceedings of the IEEE, 2007
- Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximationIEEE Transactions on Information Theory, 2001