arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0901.2090cs.ITmath.IT
收藏

二进制对称信道上LDPC码的二比特消息传递译码器

Two-Bit Message Passing Decoders for LDPC Codes Over the Binary Symmetric Channel

Lucile Sassatelli, Shashi Kiran Chilappagari, Bane Vasic, David Declercq

摘要:

本文研究了二进制对称信道下LDPC码的量化译码问题。二进制消息传递算法虽然允许非常快速的硬件实现,但从性能的角度来看并不是很有吸引力。更复杂的解码器,如基于置信传播的解码器,表现出更好的性能,但会导致更慢的解码器。本文中的方法是考虑具有较大消息字母表(从而提供性能改进)以及低复杂度(从而确保快速解码)的消息传递解码器。我们提出了一类消息传递解码器,其消息由两个比特表示。在这类中的各种解码器的阈值是使用密度演化。校正固定数量的错误的问题在错误平层区域中具有重要意义。对于一个特定的解码器,纠正所有模式多达三个错误的充分条件。通过将这些条件和阈值与使用Gallager B解码器时的类似条件和阈值进行比较,我们强调了在更高比特数上解码的优点,即使信道观测仍然是一个比特。

英文摘要:

In this paper, we consider quantized decoding of LDPC codes on the binary symmetric channel. The binary message passing algorithms, while allowing extremely fast hardware implementation, are not very attractive from the perspective of performance. More complex decoders such as the ones based on belief propagation exhibit superior performance but lead to slower decoders. The approach in this paper is to consider message passing decoders that have larger message alphabet (thereby providing performance improvement) as well as low complexity (thereby ensuring fast decoding). We propose a class of message-passing decoders whose messages are represented by two bits. The thresholds for various decoders in this class are derived using density evolution. The problem of correcting a fixed number of errors assumes significance in the error floor region. For a specific decoder, the sufficient conditions for correcting all patterns with up to three errors are derived. By comparing these conditions and thresholds to the similar ones when Gallager B decoder is used, we emphasize the advantage of decoding on a higher number of bits, even if the channel observation is still one bit.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑