Metraipolis › archive › dc_36bdb88683cd

When to Stop? Dynamic Early Termination of Sequential Ensembles — arXiv:2609.26215

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.26215
License (as archived)
CC0-1.0
Archived
2026-10-08T16:33:28.350Z
SHA-256 of the archived text
317309bb203f08c1c9a49b1d81ca6e169c204572ccce9616c5b00a03e0b766c2
Stable URL of this page
https://metraipolis.com/documento/dc_36bdb88683cd

How to cite

When to Stop? Dynamic Early Termination of Sequential Ensembles — arXiv:2609.26215 — arXiv (en), https://arxiv.org/abs/2609.26215 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_36bdb88683cd (Metraipolis archive dc_36bdb88683cd, sha256 317309bb203f08c1c9a49b1d81ca6e169c204572ccce9616c5b00a03e0b766c2)
BibTeX
@misc{dc36bdb88683cd,
  title = {When to Stop? Dynamic Early Termination of Sequential Ensembles — arXiv:2609.26215},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.26215},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_36bdb88683cd; sha256 317309bb203f08c1c9a49b1d81ca6e169c204572ccce9616c5b00a03e0b766c2},
  year = {2026}
}

Archived text

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

Ordered-statistics decoding (OSD) post-processing substantially improves the performance of belief propagation (BP) ensembles, but it also removes their natural syndrome-based stopping criterion. The high computational complexity of ensemble decoding and OSD can be reduced by sequential activation of ensemble members paired with an early termination. Instead of a syndrome-based termination we therefore apply dynamic ensemble termination (DET) to sequential ensembles: members are evaluated one at a time and decoding stops when the estimated risk that an unseen member would correct the current decision falls below an offline-fitted threshold. With hardware-oriented design in mind, we instantiate the framework with layered normalized min-sum component decoders, a row-boosted ensemble, conditional low-order OSD on the dual code, and a conventional low-cost decoder gate. A decision tree estimates the residual risk from statistics of the current candidate list. Member-dependent thresholds then target a prescribed frame error rate (FER) loss. We validate this framework on mutliple IEEE 802.11 low-density parity-check (LDPC) codes with blocklengths \(648,1296\), and \(1944\) at rates \(1/2\) and \(5/6\). At each code's design point, where the full \(64\)-member list reaches an FER of \(10^{-3}\), the DET decoder processes \(1.04\) to \(1.15\) members on average. On the \((648,540)\) code, it reduces BP work by \(39\times\) and OSD activations by \(18\times\) against the full list while retaining an signal-to-noise ratio (SNR) gain of about \(0.4\,\mathrm{dB}\).

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.IT).
Categorie arXiv: Information Theory (cs.IT) ; Signal Processing (eess.SP).
Pagina del lavoro: https://arxiv.org/abs/2609.26215 — 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-08T15:53:59.914Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).