A Low-Complexity Ordered Statistic Decoding of Short Block Codes
IEEE Communications Letters · 2023-02 · 27 (2) · 400-403
DOI: 10.1109/lcomm.2022.3222819 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Communications Letters, 2023-02. Verfasst von Jifan Liang und 3 weiteren Autor:innen. Die Arbeit wurde bisher 53-mal zitiert (Crossref) und nennt 14 Literaturangaben. Gefördert von: National Key Research and Development Program of China.
Abstract (Originalsprache)
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.
Förderung
- National Key Research and Development Program of China
Zitieren
APA
Liang, J., Wang, Y., Cai, S., & Ma, X. (2023). A Low-Complexity Ordered Statistic Decoding of Short Block Codes. IEEE Communications Letters, 27(2), 400-403. https://doi.org/10.1109/lcomm.2022.3222819
Vancouver
Liang J, Wang Y, Cai S, Ma X. A Low-Complexity Ordered Statistic Decoding of Short Block Codes. IEEE Communications Letters. 2023;27(2):400-403. doi:10.1109/lcomm.2022.3222819
BibTeX
@article{Liang2023,
author = {Liang, Jifan and Wang, Yiwen and Cai, Suihua and Ma, Xiao},
title = {A Low-Complexity Ordered Statistic Decoding of Short Block Codes},
journal = {IEEE Communications Letters},
year = {2023},
volume = {27},
number = {2},
pages = {400--403},
doi = {10.1109/lcomm.2022.3222819}
}
EUVIMED