.png){kind=icon}
返回
A Low-Complexity Ordered Statistic Decoding of Short Block Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2022.3222819.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Early stopping criteria
ordered statistic decoding (OSD) algorithm
serial list viterbi algorithm (SLVA)
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容