A Log-Domain Approximation of SOCS Decoding for Turbo Product Codes
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911662048542720 |
|---|---|
| author | Nesterenkov, Oleg Andreev, Kirill Frolov, Alexey Rybin, Pavel |
| author_facet | Nesterenkov, Oleg Andreev, Kirill Frolov, Alexey Rybin, Pavel |
| contents | This paper studies low-complexity soft-output decoding of turbo product codes with extended Bose--Chaudhuri--Hocquenghem component codes. Recent soft-output from covered space (SOCS) decoding substantially improves the quality of extrinsic information compared with the conventional Chase--Pyndiah decoder, but its probabilistic-domain implementation is less attractive for hardware-oriented realizations. We therefore propose a log-domain approximation of SOCS based on max-log approach. The proposed soft-input soft-output rule replaces probability-domain operations with a piecewise-linear function of reliability gaps between competing Chase-II decoding list and out of the list hypotheses, which preserves compatibility with the standard iterative TPC decoding loop. Numerical results for a TPC built from (256,239) eBCH component codes show that the proposed decoder clearly outperforms the baseline Chase--Pyndiah decoder with the same list size and approaches the performance of SOCS decoder. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_07519 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A Log-Domain Approximation of SOCS Decoding for Turbo Product Codes Nesterenkov, Oleg Andreev, Kirill Frolov, Alexey Rybin, Pavel Information Theory This paper studies low-complexity soft-output decoding of turbo product codes with extended Bose--Chaudhuri--Hocquenghem component codes. Recent soft-output from covered space (SOCS) decoding substantially improves the quality of extrinsic information compared with the conventional Chase--Pyndiah decoder, but its probabilistic-domain implementation is less attractive for hardware-oriented realizations. We therefore propose a log-domain approximation of SOCS based on max-log approach. The proposed soft-input soft-output rule replaces probability-domain operations with a piecewise-linear function of reliability gaps between competing Chase-II decoding list and out of the list hypotheses, which preserves compatibility with the standard iterative TPC decoding loop. Numerical results for a TPC built from (256,239) eBCH component codes show that the proposed decoder clearly outperforms the baseline Chase--Pyndiah decoder with the same list size and approaches the performance of SOCS decoder. |
| title | A Log-Domain Approximation of SOCS Decoding for Turbo Product Codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2605.07519 |