A construction of LDPC convolutional codes with close distance bounds

Author

Tien-Hui Chen ; Kuan-Chen Chen ; Mao-Chao Lin

Author_Institution

Grad. Inst. of Commun. Eng., Nat. Taiwan Univ., Taipei, Taiwan

fYear

2014

fDate

26-29 Oct. 2014

Firstpage

90

Lastpage

94

Abstract

A trellis code constructed by concatenating a delay processor and a signal mapper to a convolutional code with a short constraint length can be regarded as a convolutional code with a large constraint length. We can obtain a close upper bound and a close lower bound for such a code. In this paper, we use this code structure to construct low-density parity check convolutional codes which are 4-cycles free and hence can be efficiently decoded by the iterative message-passing algorithm.

Keywords

convolutional codes; iterative methods; message passing; parity check codes; trellis codes; 4-cycles free codes; LDPC convolutional codes; close distance bounds; close lower bound; close upper bound; code structure; decoding; delay processor; iterative message-passing algorithm; large-constraint length; low-density parity check convolutional codes; short-constraint length; signal mapper; trellis code; Block codes; Convolutional codes; Decoding; Delays; Parity check codes; Polynomials; Upper bound; Delay Processor; LDPC Convolutional Codes; LDPC-CCs; Trellis Code;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory and its Applications (ISITA), 2014 International Symposium on

Conference_Location

Melbourne, VIC

Type

conf

Filename

6979809