[Back]


Talks and Poster Presentations (with Proceedings-Entry):

Hua Zhou, N. Görtz:
"Cycle analysis of time-invariant LDPC convolutional codes";
Talk: International Conference on Telecommunications, Qatar; 04-04-2010 - 04-07-2010; in: "2010 IEEE 17th International Conference on Telecommunications (ICT)", (2010), ISBN: 978-1-4244-5246-0; 23 - 28.



English abstract:
Time-invariant low-density parity-check convolutional codes (LDPCccs) can be constructed from a polynomial form of a parity-check matrix that defines quasi-cyclic LDPC block codes based on circulant matrices. Based on this polynomial matrix, we discuss the relationships between the polynomial domain and the time domain parity-check and syndrome former matrices with respect to cycle properties. We present a novel, simple way to describe cycles in the polynomial version of the syndrome former matrix and we exploit this concept in a new cycle counting algorithm.

Keywords:
LDPC codes, cycles


"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1109/ICTEL.2010.5478744


Created from the Publication Database of the Vienna University of Technology.