.png){kind=icon}
返回
A Class of Nonbinary LDPC Codes with Fast Encoding and Decoding Algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2012.101712.110173.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This letter is concerned with a class of nonbinary low-density parity-check (LDPC) codes, referred to as column-scaled LDPC (CS-LDPC) codes, whose parity-check matrices have a property that each column is a scaled binary vector. The CS-LDPC codes, which include algebraically constructed nonbinary LDPC codes as subclasses, admit fast encoding and decoding algorithms. Specifically, for a code over the finite field F-2p, the encoder can be implemented with p parallel binary LDPC encoders followed by a series of bijective mappers, while the decoder can be implemented with an iterative decoder in which no message permutations are required during the iterations. In addition, there exist low-complexity iterative multistage decoders that can be utilized to trade off the performance against the complexity. Simulation results show that the performance degradation caused by the iterative multistage decoding algorithms is relevant to the code structure.
Keyword:
Algebraic LDPC codes
FFT-QSPA
multistage decoding
nonbinary LDPC codes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
.png){kind=icon}
Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: A finite geometry approach
PREAI
分享收藏
查看更多内容