DocumentCode
2058456
Title
A general class of LDPC finite geometry codes and their performance
Author
Xu, Jun ; Tang, Heng ; Kou, Yu ; Lin, Shu ; Abdel-Ghaffar, Khaled
Author_Institution
Dept. Electr. & Comput. Eng., California Univ., Davis, CA, USA
fYear
2002
fDate
2002
Firstpage
309
Abstract
We present a general class of finite geometry LDPC codes which perform well with iterative decoding although their Tanner graphs may contain many cycles of length 4. A hybrid two-stage decoding algorithm is proposed that combines iterative and multi-step majority-logic decodings to achieve good performance with low decoding complexity.
Keywords
iterative decoding; majority logic; parity check codes; LDPC; Tanner graphs; decoding complexity; finite geometry codes; hybrid two-stage decoding algorithm; iterative decoding; low-density-parity-check codes; multi-step majority-logic decodings; Bit error rate; Galois fields; Geometry; Iterative algorithms; Iterative decoding; NASA; Null space; Parity check codes; Sum product algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023581
Filename
1023581
Link To Document