Low latency-constrained high rate coding: LDPC codes vs. convolutional codes

Conference contribution
(Conference Contribution)


Publication Details

Author(s): Rachinger C, Müller R, Huber J
Publisher: IEEE Computer Society
Publication year: 2014
Pages range: 218-222
ISBN: 9781479959853
Language: English


Abstract


This paper complements and generalizes the results in [1], [2] while taking new formulas from [3] into account. We compare convolutional and LDPC codes of different rates with respect to their structural delay. This property is intrinsic to the encoding and decoding process and gives a fundamental limit to the achievable latency for end-to-end communication, even when infinite processing speed is assumed. We show that in the case of very low delay convolutional codes perform better than LDPC codes and even break fundamental existence bounds for block codes for some rates. Furthermore, non-punctured convolutional codes can benefit from their shorter constraint length and reduce the delay further.



FAU Authors / FAU Editors

Huber, Johannes Prof. Dr.-Ing.
Lehrstuhl für Informationsübertragung
Müller, Ralf Prof. Dr.-Ing.
Professur für Informationsübertragung
Rachinger, Christoph
Lehrstuhl für Informationsübertragung


How to cite

APA:
Rachinger, C., Müller, R., & Huber, J. (2014). Low latency-constrained high rate coding: LDPC codes vs. convolutional codes. In Proceedings of the 2014 8th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2014 (pp. 218-222). IEEE Computer Society.

MLA:
Rachinger, Christoph, Ralf Müller, and Johannes Huber. "Low latency-constrained high rate coding: LDPC codes vs. convolutional codes." Proceedings of the 2014 8th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2014 IEEE Computer Society, 2014. 218-222.

BibTeX: 

Last updated on 2019-21-07 at 07:23