Terminated LDPC Convolutional Codes with Thresholds Close to Capacity
classification
💻 cs.IT
math.IT
keywords
codesconvolutionalldpcensemblematricesterminatedthresholdsanalyzed
pith:7AM3WP4B Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{7AM3WP4B}
Prints a linked pith:7AM3WP4B badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
An ensemble of LDPC convolutional codes with parity-check matrices composed of permutation matrices is considered. The convergence of the iterative belief propagation based decoder for terminated convolutional codes in the ensemble is analyzed for binary-input output-symmetric memoryless channels using density evolution techniques. We observe that the structured irregularity in the Tanner graph of the codes leads to significantly better thresholds when compared to corresponding LDPC block codes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.