Computer Science – Information Theory
Scientific paper
2008-05-12
Computer Science
Information Theory
Accepted for publication in IEEE Transactions on Information Theory
Scientific paper
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.
No associations
LandOfFree
Eliminating Trapping Sets in Low-Density Parity Check Codes by using Tanner Graph Covers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Eliminating Trapping Sets in Low-Density Parity Check Codes by using Tanner Graph Covers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Eliminating Trapping Sets in Low-Density Parity Check Codes by using Tanner Graph Covers will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-325732