.png){kind=icon}
.png){kind=icon}
Return
Probability-Based Ordered-Statistics Decoding for Short Block Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2021.3058978.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Complexity theory
Maximum likelihood decoding
Probability
Block codes
Optimized production technology
Hamming distance
Ultra reliable low latency communication
Linear block code
ordered statistics decoding
soft decoding
short block codes
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W