构造短码长不规则LDPC码  

Construction of Short Block Length Irregular Low-Density Parity-Check Codes

作　　者：敬龙江[1] 林竟力[1] 成先涛[1] 朱维乐[1] 

机构地区：[1]电子科技大学电子工程学院1603教研室,四川成都610054

出　　处：《信号处理》2006年第4期589-591,共3页Journal of Signal Processing

摘　　要：在给定长度和度数分布对情况下,不规则短码长LDPC码的性能差别很大。本文给出了一种低复杂度的基于树的贪婪搜索算法(GTS),此算法通过调整校验矩阵中环的分布情况,尽量减少短长度环,获得最大的平均最小环,从而构造性能很好的短码长不规则LDPC码。For a given block length and given degree sequences, the ensemble of short irregular low-density parity-check codes can have considerable variation in performance. A low-complexity greedy search algorithm based on tree is proposed. This algorithm can be used to get the maximum average girth by adjusting the cycle distribution of check matrix and decreasing the short length cycles, thus resulting in good short block length irregular LDPC codes.

关 键 词：不规则LDPC码 短码长 最小环 搜索法 

分 类 号：TN911.22[电子电信—通信与信息系统]