2025/06/25 by Reza Hadavian, Hadavian, Reza, Dmitri Truhachev +1
Computer Science · Engineering · #FOS: Electrical engineering #Fault Detection and Control Systems #Machine Learning and Algorithms #Signal Processing (eess.SP) #VLSI and Analog Circuit Testing #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.2506.20079
openalex publication_date 2025/06/25 · openalex created_date 2025/10/09 · openalex updated_date 2026/07/28
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.