Metraipolis › archive › dc_fa8ea358883d

Parallel Successive Cancellation Perturbation-Enhanced Decoding of Polar Codes via Offline Variance Design — arXiv:2609.34059

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.34059
License (as archived): CC0-1.0
Archived: 2026-10-07T23:46:55.563Z
SHA-256 of the archived text: 01b15d15ff8e66191f5befdc83ccd38f8b6697392f88eb4302f39ea04386e873
Stable URL of this page: https://metraipolis.com/documento/dc_fa8ea358883d

How to cite

Parallel Successive Cancellation Perturbation-Enhanced Decoding of Polar Codes via Offline Variance Design — arXiv:2609.34059 — arXiv (en), https://arxiv.org/abs/2609.34059 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fa8ea358883d (Metraipolis archive dc_fa8ea358883d, sha256 01b15d15ff8e66191f5befdc83ccd38f8b6697392f88eb4302f39ea04386e873)

BibTeX

@misc{dcfa8ea358883d,
  title = {Parallel Successive Cancellation Perturbation-Enhanced Decoding of Polar Codes via Offline Variance Design — arXiv:2609.34059},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.34059},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fa8ea358883d; sha256 01b15d15ff8e66191f5befdc83ccd38f8b6697392f88eb4302f39ea04386e873},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.34059. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Successive cancellation perturbation-enhanced (SCP) decoding improves the performance of finite-length polar codes by performing multiple SC decoding attempts with receiver-side perturbations. However, many existing perturbation schemes generate or update subsequent perturbations according to the outcomes of previous decoding attempts, resulting in additional decoding latency. In this paper, we propose an offline variance design (OVD) method for parallel SCP (PSCP) decoding of short- and medium-length polar codes. First, we formulate the exact recovery objective conditioned on ordinary SC failure and classify failed frames by the position of the first genie-aided intrinsic error and the number of subsequent intrinsic errors. We also derive a consistent Gaussian representation of the perturbed channel that preserves min-sum SC hard decisions. Second, we construct a class-based approximation of the recovery objective using Gaussian approximation and backward recursions, accounting for both error correction and new errors introduced by perturbations. We prove that both the exact and analytical objectives are nondecreasing and exhibit diminishing marginal gains as independent branches are added. Third, we develop a greedy algorithm to select variances from a finite candidate set for a given code, signal-to-noise ratio (SNR), and number of perturbation branches. All variances are determined offline, allowing the original SC branch and all perturbation branches to start simultaneously. Simulations for rate-$1/2$ polar codes of lengths $64$, $128$, $256$, and $512$ show that OVD-PSCP achieves lower block error rates (BLERs) than conventional SCP with the same number of perturbation branches. The gains are larger for shorter codes and increase as the number of perturbation branches grows.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.34059 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T23:26:01.123Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).