.png){kind=icon}
返回
Quantized Iterative Message Passing Decoders with Low Error Floor for LDPC Codes
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2013.112313.120917.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The error floor phenomenon observed with LDPC codes and their graph-based, iterative, message-passing (MP) decoders is commonly attributed to the existence of error-prone substructures - variously referred to as near-codewords, trapping sets, absorbing sets, or pseudocodewords - in a Tanner graph representation of the code. Many approaches have been proposed to lower the error floor by designing new LDPC codes with fewer such substructures or by modifying the decoding algorithm. Using a theoretical analysis of iterative MP decoding in an idealized trapping set scenario, we show that a contributor to the error floors observed in the literature may be the imprecise implementation of decoding algorithms and, in particular, the message quantization rules used. We then propose a new quantization method - (q+1)-bit quasi-uniform quantization - that efficiently increases the dynamic range of messages, thereby overcoming a limitation of conventional quantization schemes. Finally, we use the quasi-uniform quantizer to decode several LDPC codes that suffer from high error floors with traditional fixed-point decoder implementations. The performance simulation results provide evidence that the proposed quantization scheme can, for a wide variety of codes, significantly lower error floors with minimal increase in decoder complexity.
Keyword:
Low-density parity-check (LDPC) codes
iterative message-passing decoding
sum-product algorithm
message quantization
error floors
trapping sets
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
Chemotherapy and Targeted Therapies: Are We Making Progress in Castrate-Resistant Prostate Cancer?
PREAI
分享收藏分享收藏Chemoprevention of digestive organs carcinogenesis by natural product protocatechuic acid.png)
Cancer
OAAI
CancerIF0
OAAI分享收藏
查看更多内容