Eliminating Trapping Sets in Low-Density Parity-Check Codes by Using Tanner Graph Covers
Ivkovic, M.
Chilappagari, S.K.
Vasic, B.
Dept. of Math., Univ. of Arizona, Tucson, AZ;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Aug. 2008
Volume: 54,
Issue: 8
On page(s): 3763-3768
ISSN: 0018-9448
INSPEC Accession Number: 10115021
Digital Object Identifier: 10.1109/TIT.2008.926319
Current Version Published: 2008-07-16
Abstract
We discuss error floor asympotics and present a method for improving the performance of low-density parity-check (LDPC) codes in the high SNR (error floor) region. The method is based on Tanner graph covers that do not have trapping sets from the original code. The advantages of the method are that it is universal, as it can be applied to any LDPC code/channel/decoding algorithm and it improves performance at the expense of increasing the code length, without losing the code regularity, without changing the decoding algorithm, and, under certain conditions, without lowering the code rate. The proposed method can be modified to construct convolutional LDPC codes also. The method is illustrated by modifying Tanner, MacKay and Margulis codes to improve performance on the binary symmetric channel (BSC) under the Gallager B decoding algorithm. Decoding results on AWGN channel are also presented to illustrate that optimizing codes for one channel/decoding algorithm can lead to performance improvement on other channels.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
