DocumentCode
3028536
Title
Extended PEG Algorithm for High Rate LDPC Codes
Author
Zhou, Zhiheng ; Li, Xiangxue ; Zheng, Dong ; Chen, Kefei ; Li, Jianhua
Author_Institution
Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., Shanghai, China
fYear
2009
fDate
10-12 Aug. 2009
Firstpage
494
Lastpage
498
Abstract
Progressive edge-growth (PEG) algorithm is a good candidate to generate tanner graphs with a large girth by establishing edges or connections between symbol and check nodes in an edge-by-edge manner. In this paper, we propose an extended PEG algorithm for constructing low-density parity-check (LDPC) codes with very high rate when given a lower bound of girth. Simulation results show the bit error rates of constructed LDPC codes with very high rate or large girth.
Keywords
graph theory; parity check codes; low-density parity-check codes; progressive edge-growth algorithm; tanner graphs; Application software; Computer science; Decoding; Distributed processing; Engineering management; Information management; Information security; Parity check codes; Signal to noise ratio; Technology management;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing with Applications, 2009 IEEE International Symposium on
Conference_Location
Chengdu
Print_ISBN
978-0-7695-3747-4
Type
conf
DOI
10.1109/ISPA.2009.80
Filename
5207892
Link To Document