Pseudocodeword Performance Analysis for LDPC Convolutional Codes

Message-passing iterative decoders for low-density parity-check (LDPC) block codes are known to be subject to decoding failures due to so-called pseudocodewords. These failures can cause the large signal-to-noise ratio (SNR) performance of message-passing iterative decoding to be worse than that pre...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2009-06, Vol.55 (6), p.2577-2598
Main Authors: Smarandache, R., Pusane, A.E., Vontobel, P.O., Costello, Daniel J.
Format: Article
Language:English
Subjects:
Applied sciences
Block codes
Blocking
Coding, codes
Convolution
Convolutional codes
Decoding
Exact sciences and technology
Failure
Hamming weight
Information processing
Information theory
Information, signal and communications theory
Iterative decoding
linear programming decoding
low-density parity-check (LDPC) codes
Mathematics
Maximum likelihood decoding
Maximum likelihood method
message-passing iterative decoding
Parity check codes
Performance analysis
Performance evaluation
pseudocodewords
pseudoweights
quasi-cyclic codes
Signal and communications theory
Signal to noise ratio
Simulation
Spectra
Telecommunications and information theory
Unions
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Message-passing iterative decoders for low-density parity-check (LDPC) block codes are known to be subject to decoding failures due to so-called pseudocodewords. These failures can cause the large signal-to-noise ratio (SNR) performance of message-passing iterative decoding to be worse than that predicted by the maximum-likelihood (ML) decoding union bound. In this paper, we address the pseudocodeword problem from the convolutional code perspective. In particular, we compare the performance of LDPC convolutional codes with that of their "wrapped" quasi-cyclic block versions and we show that the minimum pseudoweight of an LDPC convolutional code is at least as large as the minimum pseudoweight of an underlying quasi-cyclic code. This result, which parallels a well-known relationship between the minimum Hamming weight of convolutional codes and the minimum Hamming weight of their quasi-cyclic counterparts, is due to the fact that every pseudocodeword in the convolutional code induces a pseudocodeword in the block code with pseudoweight no larger than that of the convolutional code's pseudocodeword. This difference in the weight spectra leads to improved performance at low-to-moderate SNRs for the convolutional code, a conclusion supported by simulation results.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2009.2018347