Skip to content
DraconiticResearch
Search Sources API
206,690 studies31 sourcesUpdated 18 min ago
PreprintarXiv licencearXiv

PMR-Aided Shifted-Pruning SCL-Flip Decoding for CRC-Aided Polar Codes

Abstract

We propose a posterior-mass rescue (PMR)-aided shifted-pruning SCL-flip decoder for CRC-aided polar codes. After CRC-aided SCL (CA-SCL) and differential-metric shifted-pruning recovery fail to find a CRC-valid candidate, PMR locally continues discarded prefixes stored during the initial CA-SCL pass, ranked by estimated posterior mass, without increasing the shifted-pruning retry budget. Simulation results for a (128, 64) code with the Reed-Muller (RM) rate profile and a (256, 128) code with the polarization-weight (PW) rate profile, both using an 11-bit CRC, show lower observed FER than SCLF-Diff (T = 15) and the considered literature baselines under the evaluated recovery budgets, with observed FER close to that of SCLF-Diff (T = 20). At the reported moderate and high SNRs, the average reconstruction-aware path-step count is within a few percent of that of SCLF-Diff (T = 20), while at 2.0 dB it is 9.4% and 4.3% higher for the two codes, respectively. The proposed decoder also has a larger worst-case path-step bound.

Related

  1. Log Density Spectrum Based Decoding of Polar Codes for Channels with Strong Phase Noise
    Yinuo Mei, Daiming Qu
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  2. Efficient SC-Flip Decoding for Polar Codes through Decision-Boundary Normalization
    Gulinisha Yiming, Zhongjun Yang, Zhicheng Liu +3
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  3. Semantic SCL Decoding for Polar Codes
    Andy Huang, Chentao Yue, Branka Vucetic +1
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  4. Efficient Perturbation-Based SC Decoding for Long Polar Codes
    Zhongjun Yang, Zhichen Liu, Li Chen +2
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  5. Parallel Successive Cancellation Perturbation-Enhanced Decoding of Polar Codes via Offline Variance Design
    Changwei Tu, Xuanyu Li, Kai Niu
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
BibTeX
@misc{hosseinzadeh2026pmraided,
  title = {{PMR-Aided Shifted-Pruning SCL-Flip Decoding for CRC-Aided Polar Codes}},
  author = {Niloufar Hosseinzadeh and Mohammad Morsali and Mohsen Moradi and Hessam Mahdavifar},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.25644},
  eprint = {2610.25644},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.25644},
}
RIS
TY  - UNPB
TI  - PMR-Aided Shifted-Pruning SCL-Flip Decoding for CRC-Aided Polar Codes
AU  - Niloufar Hosseinzadeh
AU  - Mohammad Morsali
AU  - Mohsen Moradi
AU  - Hessam Mahdavifar
PY  - 2026
DA  - 2026/10/19
PB  - arXiv
DO  - 10.48550/arxiv.2610.25644
UR  - https://arxiv.org/abs/2610.25644
AB  - We propose a posterior-mass rescue (PMR)-aided shifted-pruning SCL-flip decoder for CRC-aided polar codes. After CRC-aided SCL (CA-SCL) and differential-metric shifted-pruning recovery fail to find a CRC-valid candidate, PMR locally continues discarded prefixes stored during the initial CA-SCL pass, ranked by estimated posterior mass, without increasing the shifted-pruning retry budget. Simulation results for a (128, 64) code with the Reed-Muller (RM) rate profile and a (256, 128) code with the polarization-weight (PW) rate profile, both using an 11-bit CRC, show lower observed FER than SCLF-Diff (T = 15) and the considered literature baselines under the evaluated recovery budgets, with observed FER close to that of SCLF-Diff (T = 20). At the reported moderate and high SNRs, the average reconstruction-aware path-step count is within a few percent of that of SCLF-Diff (T = 20), while at 2.0 dB it is 9.4% and 4.3% higher for the two codes, respectively. The proposed decoder also has a larger worst-case path-step bound.
ER  -