ETRI-Knowledge Sharing Plaform

KOREAN
논문 검색
Type SCI
Year ~ Keyword

Detail

Journal Article Probability-Based Ordered-Statistics Decoding for Short Block Codes
Cited 31 time in scopus Share share facebook twitter linkedin kakaostory
Authors
Chentao Yue, Mahyar Shirvanimoghaddam, Giyoon Park, Ok-Sun Park, Branka Vucetic, Yonghui Li
Issue Date
2021-06
Citation
IEEE Communications Letters, v.25, no.6, pp.1791-1795
ISSN
1089-7798
Publisher
IEEE
Language
English
Type
Journal Article
DOI
https://dx.doi.org/10.1109/LCOMM.2021.3058978
Abstract
This letter proposes an efficient probability-based ordered-statistics decoding (PB-OSD) algorithm for short block-length codes. In PB-OSD, we derive two probabilistic measures on the codeword estimates and test error patterns, respectively referred to as the success probability and promising probability. Based on these probabilities, a stopping criterion and a discarding criterion are developed to reduce the number of test error patterns and limit the decoding complexity. To further reduce the complexity, we propose a tree-based search strategy to find the most likely test error patterns in reprocessing stage of the OSD algorithm. Simulation results show that PB-OSD significantly reduces the decoding complexity under the same error performance, compared to the original OSD algorithm.
KSP Keywords
Block codes, Probability-based, Short Block, Stopping criterion, Success probability, Test error, Tree-based, decoding complexity, error patterns, error performance, search strategy