A kind of improved PEG algorithm of q-ary LDPC codes
Progressive-edge-growth (PEG) algorithm is one of the best known methods for constructing LDPC codes at short and intermediate block lengths, however, the codes directly designed by such algorithm has high encoding complexity, especially for q-ary LDPC codes, encoding complexity increases with the increase of q value rapidly, which hinder the development of q-ary LDPC codes implementation seriously. To such problem, the paper presents a improved method based on PEG algorithm which can be encoded by the iterative encoding algorithm with the liner operation complexity. The simulation results indicate: Though the error correcting capability of irregular q-ary LDPC codes constructed by the proposed methods in the paper is basically identical with the codes constructed by the PEG algorithm, but the powerful advantage makes it be easily implemented by the hardware .
PEG algorithm iterative encoding lower triangular form q-ary LDPC codes
Ningning Tong Danfeng Zhao Yuping Wu
College of Information & Communication Engineering, Harbin Engineering University, China Department Department of Electronic Engineering, Heilongjiang Institute of Technology, China
国际会议
合肥
英文
3032-3035
2011-09-23（万方平台首次上网日期，不代表论文的发表时间）