Greedy Permutation Algorithm for Almost Linear Encoding of LDPC Codes
Hanghang Qi · Journal of Information Engineering University · 2011
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.