A Modified PEG Algorithm for Construction of LDPC codes with Polynomial of Cycle
Progressive Edge-Growth (PEG) algorithm is a novel approach for construction of low-density parity-check (LDPC) codes with large girth. However, PEG algorithm ignores the effect of the number of shortest cycles. In this paper, we propose a modified PEG algorithm with Polynomial of Cycle, which achieves not only large girth, but also minimizes the number of shortest cycles significantly. Simulation results show that our proposed algorithm can improves the performance of LDPC codes.
LDPC codes construction cycle
Lei Xiong Dongping Yao Yimeng Wu
State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University,School of Electronics and Information Engineering, Beijing Jiaotong University,Beijing 100044, China
国际会议
北京
英文
544-547
2009-10-27(万方平台首次上网日期,不代表论文的发表时间)