Terminated LDPC convolutional codes with thresholds close to capacity

Author

Lentmaier, Michael ; Sridharan, Arvind ; Zigangirov, Kamil Sh ; Costello, Daniel J., Jr.

Author_Institution

Inst. for Commun. & Navigation, German Aerosp. Center

fYear

2005

fDate

4-9 Sept. 2005

Firstpage

1372

Lastpage

1376

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

Keywords

block codes; channel capacity; channel coding; convolutional codes; matrix algebra; parity check codes; Tanner graph; binary-input output-symmetric memoryless channels; block codes; convolutional codes; density evolution techniques; iterative belief propagation; low-density parity-check codes; permutation matrices; Aerospace engineering; Belief propagation; Block codes; Convolutional codes; Iterative decoding; Memoryless systems; Message passing; Navigation; Parity check codes; Sparse matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on

Conference_Location

Adelaide, SA

Print_ISBN

0-7803-9151-9

Type

conf

DOI

10.1109/ISIT.2005.1523567

Filename

1523567