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-<inline-formula> <tex-math notation="LaTeX">t </tex-math></inline-formula> reprocessing on the most reliable independent...

Full description

Saved in:
Bibliographic Details
Published inIEEE communications letters Vol. 27; no. 2; pp. 400 - 403
Main Authors Liang, Jifan, Wang, Yiwen, Cai, Suihua, Ma, Xiao
Format Journal Article
LanguageEnglish
Published New York IEEE 01.02.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
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
Online AccessGet full text
ISSN1089-7798
1558-2558
DOI10.1109/LCOMM.2022.3222819

Cover

More Information
Summary:This letter is concerned with a generalized ordered statistic decoding (OSD) algorithm, called locally constrained OSD (LC-OSD). Instead of order-<inline-formula> <tex-math notation="LaTeX">t </tex-math></inline-formula> 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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2022.3222819