Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.20079 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908420863426560 |
|---|---|
| author | Hadavian, Reza Truhachev, Dmitri |
| author_facet | Hadavian, Reza Truhachev, Dmitri |
| contents | We propose a reduced complexity approach to pattern-based soft decoding of block codes. We start from the ORDEPT decoding algorithm which tests a list of partial error patterns organized in the order of their likelihood and attempts to complete the patterns creating candidate codewords. We then propose an early termination criterion. Once a candidate codeword is found, its log-likelihood difference to the received sequence is compared to a preset threshold and the decoding decision is instantly made in case the likelihood deviation is below the threshold. We demonstrate that while keeping the same block error rate (BLER) performance, the proposed algorithm's latency and complexity is multiple times smaller than that of the state-of-the art competitors including the Chase II, ORBGRAND, GCD, and the very recent ORDEPT with Soft-Output GRAND termination which necessitates several multiplications in each query processing. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_20079 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Low-Complexity Ordered Reliability Direct Error Pattern Testing (ORDEPT) Decoding with Likelihood Thresholding Hadavian, Reza Truhachev, Dmitri Signal Processing We propose a reduced complexity approach to pattern-based soft decoding of block codes. We start from the ORDEPT decoding algorithm which tests a list of partial error patterns organized in the order of their likelihood and attempts to complete the patterns creating candidate codewords. We then propose an early termination criterion. Once a candidate codeword is found, its log-likelihood difference to the received sequence is compared to a preset threshold and the decoding decision is instantly made in case the likelihood deviation is below the threshold. We demonstrate that while keeping the same block error rate (BLER) performance, the proposed algorithm's latency and complexity is multiple times smaller than that of the state-of-the art competitors including the Chase II, ORBGRAND, GCD, and the very recent ORDEPT with Soft-Output GRAND termination which necessitates several multiplications in each query processing. |
| title | Low-Complexity Ordered Reliability Direct Error Pattern Testing (ORDEPT) Decoding with Likelihood Thresholding |
| topic | Signal Processing |
| url | https://arxiv.org/abs/2506.20079 |