In this paper, we present a fast min-sum algorithm for decoding LDPC codesover GF(q). Our algorithm is different from the one presented by David Declercqand Marc Fossorier in ISIT 05 only at the way of speeding up the horizontalscan in the min-sum algorithm. The Declercq and Fossorier's algorithm speeds upthe computation by reducing the number of configurations, while our algorithmuses the dynamic programming instead. Compared with the configuration reductionalgorithm, the dynamic programming one is simpler at the design stage becauseit has less parameters to tune. Furthermore, it does not have the performancedegradation problem caused by the configuration reduction because it searchesthe whole configuration space efficiently through dynamic programming. Bothalgorithms have the same level of complexity and use simple operations whichare suitable for hardware implementations.
展开▼
机译：在本文中，我们提出了一种快速最小和算法，用于通过GF（q）解码LDPC码。我们的算法与David Declercqand Marc Fossorier在ISIT 05中提出的算法不同，只是在最小和算法中加快了水平扫描的速度。 Declercq和Fossorier的算法通过减少配置数量来加快计算速度，而我们的算法改为使用动态编程。与配置简化算法相比，动态编程在设计阶段更为简单，因为它需要调整的参数较少。此外，它不存在因配置减少而导致的性能下降问题，因为它通过动态编程有效地搜索了整个配置空间。两种算法都具有相同的复杂度，并且使用适合于硬件实现的简单操作。
展开▼
