Pseudo-Codeword Performance Analysis for LDPC Convolutional Codes

Simple item page
dc.creatorSmarandache, Roxana
dc.creatorPusane, Ali E.
dc.creatorVontobel, Pascal O.
dc.creatorCostello Jr, Daniel J.
dc.date2006-09-27
dc.date.accessioned2026-07-07T08:16:43Z
dc.date.available2026-07-07T08:16:43Z
dc.descriptionMessage-passing iterative decoders for low-density parity-check (LDPC) block codes are known to be subject to decoding failures due to so-called pseudo-codewords. These failures can cause the large signal-to-noise ratio performance of message-passing iterative decoding to be worse than that predicted by the maximum-likelihood decoding union bound. In this paper we address the pseudo-codeword 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 pseudo-weight of an LDPC convolutional code is at least as large as the minimum pseudo-weight 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 pseudo-codeword in the convolutional code induces a pseudo-codeword in the block code with pseudo-weight no larger than that of the convolutional code's pseudo-codeword. This difference in the weight spectra leads to improved performance at low-to-moderate signal-to-noise ratios for the convolutional code, a conclusion supported by simulation results.
dc.description26 pages, 6 figures, 2 tables
dc.identifierhttps://arxiv.org/abs/cs/0609148
dc.identifierhttp://arxiv.org/abs/cs/0609148
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133880
dc.subjectInformation Theory
dc.titlePseudo-Codeword Performance Analysis for LDPC Convolutional Codes
dc.typetext

Files

Collections

arXiv