DocumentCode
1967749
Title
Trapping set structure of LDPC codes on finite geometries
Author
Diao, Qiuju ; Tai, Ying Yu ; Lin, Shu ; Abdel-Ghaffar, Khaled
Author_Institution
Department of Electrical and Computer Engineering University of California, Davis, CA 95616, USA
fYear
2013
fDate
10-15 Feb. 2013
Firstpage
1
Lastpage
8
Abstract
The trapping set structure of LDPC codes constructed based on finite geometries, called finite geometry (FG) LDPC codes, is analyzed using a geometric approach. In this approach, trapping sets in the Tanner graph of an FG-LDPC code are represented by subgeometries of the geometry based on which the code is constructed. Using this geometrical representation, bounds and configurations of trapping sets of an FG-LDPC code can be derived and analyzed.
Keywords
AWGN channels; Charge carrier processes; Decoding; Geometry; Hafnium; Iterative decoding;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and Applications Workshop (ITA), 2013
Conference_Location
San Diego, CA
Print_ISBN
978-1-4673-4648-1
Type
conf
DOI
10.1109/ITA.2013.6502922
Filename
6502922
Link To Document