摘要： LDPC 编码优化包括下三角和准下三角两种类型，目前主要采用各种贪婪算法。针对这一问题，基于组合论中的匈牙利法提出了一种新的迭代算法。该算法不仅可以进一步提高优化性能，还可以通过修改目标函数在下三角和准下三角之间合理均衡以便确定LDPC编码优化的最佳性能参数。
关键词:
LDPC码,
编码优化,
匈牙利算法
Abstract: Up to now many greedy algorithms are adopted for LDPC encoding optimization with the parity-check matrix in lower triangular form (LTF) or approximate lower triangular form (ALTF). A new iterative algorithm is put forward based on Hungarian method of the combinatorial theory and the optimized results are better than ever. Through modifying the object function of the new algorithm, a proper tradeoff can be realized between LTF and ALTF for more satisfying performance parameters of LDPC codes.
Key words:
LDPC code,
Encoding optimization,
Hungarian method
中图分类号:
张 谨;苏广川. 基于匈牙利算法的LDPC编码优化实现[J]. 计算机工程, 2007, 33(06): 19-21.
ZHANG Jin; SU Guangchuan. Realization of Encoding Optimization for LDPC Codes Based on Hungarian Method[J]. Computer Engineering, 2007, 33(06): 19-21.