DocumentCode :
2450415
Title :
Performance of turbo irregular LDPC codes
Author :
Wu, Xiaoli ; Ge, Jianhua ; Wang, Yong ; Yue, Anjun
Author_Institution :
Nat. Key Lab. of ISN, Xidian Univ., Xi´´an
Volume :
2
fYear :
0
fDate :
0-0 0
Firstpage :
2382
Lastpage :
2387
Abstract :
A kind of new parallel concatenated LDPC codes (NPCGC) is presented which use two same degree distribution pairs of irregular LDPC codes constructed by the progressive edge-growth (PEG) algorithm in turbo structure. The PEG algorithm for constructing Tanner graphs with large girth by progressively establishing edges or connections between symbol and check nodes in an edge-by-edge manner is used to construct a sparse parity check matrix and a simple encoding method is used to encode the irregular LDPC codes. The advantages of NPCGC over PCGC, irregular LDPC code and turbo code are demonstrated by extensive simulation results on code performance
Keywords :
concatenated codes; graph theory; parity check codes; sparse matrices; turbo codes; PEG algorithm; Tanner graphs; encoding method; new parallel concatenated LDPC codes; progressive edge-growth algorithm; sparse parity check matrix; turbo irregular LDPC codes; Bipartite graph; Block codes; Concatenated codes; Convolutional codes; Iterative algorithms; Iterative decoding; Parity check codes; Sparse matrices; Transmission line matrix methods; Turbo codes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information and Communication Technologies, 2006. ICTTA '06. 2nd
Conference_Location :
Damascus
Print_ISBN :
0-7803-9521-2
Type :
conf
DOI :
10.1109/ICTTA.2006.1684779
Filename :
1684779
Link To Document :
بازگشت