DocumentCode :
2709088
Title :
A modified PEG algorithm for construction of LDPC codes with Polynomial of Cycle
Author :
Xiong, Lei ; Yao, Dongping ; Wu, Yimeng
Author_Institution :
State Key Lab. of Rail Traffic Control & Safety, Beijing Jiaotong Univ., Beijing, China
fYear :
2009
fDate :
27-29 Oct. 2009
Firstpage :
524
Lastpage :
527
Abstract :
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.
Keywords :
matrix algebra; parity check codes; polynomials; LDPC codes; low-density parity-check codes; modified PEG algorithm; progressive edge-growth algorithm; Floors; Laboratories; Parity check codes; Polynomials; Rails; Railway engineering; Railway safety; Sparse matrices; Traffic control; Turbo codes; LDPC codes; construction; cycle;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications, 2009 3rd IEEE International Symposium on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-4076-4
Type :
conf
DOI :
10.1109/MAPE.2009.5355908
Filename :
5355908
Link To Document :
بازگشت