CTH02-4: When Does One Redundant Parity-Check Equation Matter?

Author

Laendner, Stefan ; Hehn, Thorsten ; Milenkovic, Olgica ; Huber, Johannes B.

Author_Institution

Dept. of Electr. & Comput. Eng., Colorado Univ., Boulder, CO

fYear

2006

fDate

Nov. 27 2006-Dec. 1 2006

Firstpage

1

Lastpage

6

Abstract

We analyze the effect of redundant parity-check equations on the error-floor performance of low-density parity- check (LDPC) codes used over the additive white Gaussian noise (AWGN) channel. Our findings show that a large number of iterative decoding errors in the [2640,1320] Margulis code, confined to point trapping sets in the standard Tanner graph, can be corrected if only one redundant parity-check equation is added to the decoder´s matrix. We also derive an analytic expression relating the number of rows in the parity-check matrix of a code and the parameters of trapping sets in the code´s graph.

Keywords

AWGN channels; graph theory; iterative decoding; matrix algebra; parity check codes; AWGN channel; Margulis code; additive white Gaussian noise channel; analytic expression; decoder matrix; iterative decoding errors; low-density parity-check codes; point trapping sets; redundant parity-check equation matter; standard Tanner graph; AWGN; Additive white noise; Code standards; Computer errors; Equations; Error correction codes; Information analysis; Iterative decoding; Parity check codes; Performance analysis;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE

Conference_Location

San Francisco, CA

ISSN

1930-529X

Print_ISBN

1-4244-0356-1

Electronic_ISBN

1930-529X

Type

conf

DOI

10.1109/GLOCOM.2006.44

Filename

4150674