Segmentation-Discarding Ordered-Statistic Decoding for Linear Block Codes

TL;DR

This paper introduces a segmentation-discarding decoding algorithm for short block-length codes that reduces complexity significantly while maintaining performance, by dividing test error patterns into segments and applying specific stopping and discarding rules.

Contribution

The paper presents a novel segmentation-discarding technique with stopping rules for ordered-statistics decoding, improving efficiency over existing methods.

Findings

Significant complexity reduction compared to traditional OSD algorithms

Maintains comparable decoding performance with fewer computations

Effective for various short block-length codes

Abstract

In this paper, we propose an efficient reliability based segmentation-discarding decoding (SDD) algorithm for short block-length codes. A novel segmentation-discarding technique is proposed along with the stopping rule to significantly reduce the decoding complexity without a significant performance degradation compared to ordered statistics decoding (OSD). In the proposed decoder, the list of test error patterns (TEPs) is divided into several segments according to carefully selected boundaries and every segment is checked separately during the reprocessing stage. Decoding is performed under the constraint of the discarding rule and stopping rule. Simulations results for different codes show that our proposed algorithm can significantly reduce the decoding complexity compared to the existing OSD algorithms in literature.