Iterative Decoding of Multiple-Step Majority Logic Decodable Codes
Iterative Decoding of Multiple-Step Majority Logic Decodable Codes
复制标题
多步多数逻辑可解码码的迭代解码
DOI：
--
复制
发表时间：
2007
影响因子：
8.3
通讯作者：
J. Yedidia
中科院分区：
文献类型：
--
作者：
R. Palanki;M. Fossorier;J. Yedidia
我们研究了中间长度的多步多数逻辑（MSMLD）代码的迭代解码算法的性能。我们介绍了一种新的轻型算法，该算法能够在二进制对称通道上分解这些代码几乎和最大样本解码器。我们表明，使用位折射算法解码的MSMLD代码可以胜过可比较的Bose-Chaudhuri-Hocquenghem（BCH）代码（BCH）代码，使用标准代数解码算法解码，至少对于高弹性速率（或高和中等信号的比率） SNRS））。
We investigate the performance of iterative decoding algorithms for multistep majority logic decodable (MSMLD) codes of intermediate length. We introduce a new bit-flipping algorithm that is able to decode these codes nearly as well as a maximum-likelihood decoder on the binary-symmetric channel. We show that MSMLD codes decoded using bit-flipping algorithms can outperform comparable Bose-Chaudhuri-Hocquenghem (BCH) codes decoded using standard algebraic decoding algorithms, at least for high bit-flip rates (or low and moderate signal-to-noise ratios (SNRs)).