Low-Complexity Modified Trellis-Based Min-Max Non- Binary LDPC Decoders
Low-Complexity Modified Trellis-Based Min-Max Non- Binary LDPC Decoders
复制标题
低复杂度改进的基于网格的最小-最大非二进制 LDPC 解码器
作者：
Xinmiao Zhang
GF（q）（q > 2）上的非二进制低密度奇偶校验（NBLDPC）码在中等码字长度时具有比二进制码更好的纠错性能。本文提出了一种改进的基于网格的NB-LDPC码Minmax译码器。通过放宽对哪些消息可以被包括在内的约束，在不牺牲纠错性能的情况下简化了网格校正子计算。此外，计算校验到变量消息所需的迭代比较被一步消息选择所取代。NB-LDPC码的译码复杂度随着q的增大而增大，小的q对于实现低复杂度和高速度的数据存储系统是优选的。通过利用GF（4）的性质可以进一步简化。代替三个网格校正子，在校验节点处理中计算并存储单个全局校正子。高效的实施架构也在本文中开发。与先前的努力相比，所提出的设计需要更小的面积，消耗更少的功率，实现更高的吞吐量，也有更好的纠错性能。
Non-Binary Low-Density Parity-Check (NBLDPC) codes over GF(q) (q > 2) have better errorcorrecting performance than their binary counterparts when the codeword length is moderate. In this paper, modified trellis-based Minmax decoders are proposed for NB-LDPC codes. By relaxing the constraints on which messages can be included, the trellis syndrome computation is simplified without sacrificing the errorcorrecting performance. In addition, the iterative comparisons needed in computing the check-to-variable messages are replaced by one-step message selection. The decoding complexity of NB-LDPC codes grows substantially with q, and small q is preferred to achieve low complexity and high speed for data storage systems. Further simplifications are enabled by making use of the properties of GF(4). Instead of three trellis syndromes, a single global syndrome is computed and stored in the check node processing. Efficient implementation architectures are also developed in this paper. Compared to prior efforts, the proposed designs require smaller area, consumes much less power, achieves higher throughput, and also has slightly better error-correcting performance.