摘要
LDPC码被认为是目前比较好的一种信道编码,但编码的高复杂度一直困扰LDPC码的应用。针对这一问题,提出一种新的编码方法——贪婪置换算法。该方法是基于近似下三角阵(ALT)准线性编码的思想,将一个稀疏校验矩阵高效地转化为一个近似下三角阵。文章具体给出了这种方法和运算步骤,实现了ALT的准线性编码,使得对于任何一种LDPC码,可以实现O(n+g2)以内的编码低复杂度。文章对若干正则和非正则LDPC码进行了编码方案的模拟,得出复杂度,并和目前国际上最先进的编码方法加以比较,体现出了本方法在复杂度上的优越性。
LDPC coding is considered as one of the most promising channel coding;however the complexity of this encoding inhibits its further development and application.This paper deals with this problem,proposing new encoding method： the greedy permutation algorithm.Following the idea of approximate lower matrix（ALT） encoding,the greedy permutation algorithm can efficiently transform a sparse LDPC parity check matrix into an ALT.This paper studies this method in depth and discusses its step-by-step process,with ALT encoding complexity examined.For any LDPC codes,this method can keep encoding complexity within O（n＋g2）.The encoding method is simulated on several classes of regular and irregular LDPC codes.The encoding complexity is compared with other popular methods＇ complexity,which reflects the superiority of this method.
出处
《信息工程大学学报》
2011年第5期578-583,共6页
Journal of Information Engineering University
关键词
信道编码
LDPC码
准线性编码
近似下三角阵
贪婪置换算法
channel encoding
LDPC codes
almost linear encoding
approximate lower matrix（ALT）
greedy permutation algorithm
