A Low-Complexity Ordered Statistic Decoding of Short Block Codes

This letter is concerned with a generalized ordered statistic decoding (OSD) algorithm, called locally constrained OSD (LC-OSD). Instead of order- t reprocessing on the most reliable independent bits, the LC-OSD searches for test error patterns using the serial list Viterbi algorithm (SLVA) over a...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2023-02, Vol.27 (2), p.400-403
Main Authors: Liang, Jifan, Wang, Yiwen, Cai, Suihua, Ma, Xiao
Format: Article
Language:English
Subjects:
Algorithms
Block codes
Complexity
Complexity theory
Criteria
Decoding
Early stopping criteria
Maximum likelihood decoding
Optimized production technology
ordered statistic decoding (OSD) algorithm
Reliability
Reprocessing
Searching
serial list viterbi algorithm (SLVA)
Time complexity
Viterbi algorithm
Viterbi algorithm detectors
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This letter is concerned with a generalized ordered statistic decoding (OSD) algorithm, called locally constrained OSD (LC-OSD). Instead of order- t reprocessing on the most reliable independent bits, the LC-OSD searches for test error patterns using the serial list Viterbi algorithm (SLVA) over a trellis specified by a local parity-check matrix. We derive several early stopping criteria that can be used to reduce the number of searches. Numerical results show that the LC-OSD algorithm with the proposed stopping criteria has much lower time complexity than the original OSD but incurs negligible performance loss.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2022.3222819