DocumentCode
2106160
Title
Design of Quasi-Cyclic LDPC Codes Based on Euclidean Geometries
Author
Liu, Yuan-Hua ; Wang, Xin-Mei ; Ma, Jian-Hua
Author_Institution
State Key Lab. of ISN, Xidian Univ., Xi´´an
fYear
2009
fDate
26-29 May 2009
Firstpage
207
Lastpage
211
Abstract
This paper presents an algebraic method for constructing quasi-cyclic (QC) low-density parity-check (LDPC) codes based on the structural properties of Euclidean geometries. The construction method results in a class of QC-LDPC codes with girth of at least 6. Codes in this class perform very close to the Shannon limit with iterative decoding. Simulations show that the designed QC-LDPC codes have almost the same performance with the existing QC Euclidean geometry LDPC codes.
Keywords
cyclic codes; geometric codes; iterative decoding; parity check codes; Shannon limit; algebraic method; euclidean geometries; iterative decoding; low density parity check codes; quasi cyclic LDPC codes; Analytical models; Application software; Computational geometry; Computer networks; Information geometry; Iterative decoding; Parity check codes; Solid modeling; Euclidean geometry; iterative method; low-density parity-check codes; quasi-cyclic;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Information Networking and Applications, 2009. AINA '09. International Conference on
Conference_Location
Bradford
ISSN
1550-445X
Print_ISBN
978-1-4244-4000-9
Electronic_ISBN
1550-445X
Type
conf
DOI
10.1109/AINA.2009.35
Filename
5076201
Link To Document