DocumentCode :
2608338
Title :
A new construction for low density parity check convolutional codes
Author :
Sridharan, A. ; Costello, D.J., Jr.
Author_Institution :
Dept. of Electr. Eng., Notre Dame Univ., IN, USA
fYear :
2002
fDate :
25-25 Oct. 2002
Firstpage :
212
Abstract :
Low density parity check (LDPC) block codes have been shown to achieve near capacity performance for binary transmission over noisy channels. Block codes, however, require splitting the data to be transmitted into frames, which can be a disadvantage in some applications. Convolutional codes, on the other hand, have no such requirement, and are well suited for continuous transmission. Felstrom and Zigangirov (1999) proposed the construction of periodic time-varying convolutional codes with LDPC matrices. A set of time-invariant LDPC convolutional codes was described by Sridharan et al. (2002). The codes of Felstrom and Zigangirov were obtained by random construction techniques whereas those of Sridharan et al. were essentially algebraic constructions. The new LDPC convolutional codes described here are obtained by introducing a degree of randomness into the latter construction.
Keywords :
algebraic codes; block codes; convolutional codes; parity check codes; random codes; LDPC codes; algebraic constructions; block codes; convolutional codes; low density parity check codes; periodic time-varying codes; random construction techniques; time-invariant codes; Block codes; Constraint optimization; Convolutional codes; Decoding; Information theory; Message passing; NASA; Parity check codes; Polynomials; Sparse matrices;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Workshop, 2002. Proceedings of the 2002 IEEE
Conference_Location :
Bangalore, India
Print_ISBN :
0-7803-7629-3
Type :
conf
DOI :
10.1109/ITW.2002.1115468
Filename :
1115468
Link To Document :
بازگشت