Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers
AffiliationUniv Arizona, Dept Elect & Comp Engn
MetadataShow full item record
CitationM. Ivkovic, S. K. Chilappagari and B. Vasic, "Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers," in IEEE Transactions on Information Theory, vol. 54, no. 8, pp. 3763-3768, Aug. 2008, doi: 10.1109/TIT.2008.926319.
RightsCopyright © 2008 IEEE
Collection InformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at firstname.lastname@example.org.
AbstractWe 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.
VersionFinal accepted manuscript