LDPC convolutional codes based on braided convolutional codes
We introduce and analyze new constructions of LDPC convolutional codes and their tail-biting versions which are obtained from braided convolutional codes. The basic ideas behind the encoding and decoding architectures for these codes are presented. Additionally, asymptotic results concerning the ite...
Saved in:
Published in | 2008 IEEE International Symposium on Information Theory pp. 1035 - 1039 |
---|---|
Main Authors | , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.07.2008
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | We introduce and analyze new constructions of LDPC convolutional codes and their tail-biting versions which are obtained from braided convolutional codes. The basic ideas behind the encoding and decoding architectures for these codes are presented. Additionally, asymptotic results concerning the iterative thresholds are shown for different ensembles. Finally, we evaluate the bit error rate performances of several codes by means of computer simulations. |
---|---|
ISBN: | 9781424422562 1424422566 |
ISSN: | 2157-8095 2157-8117 |
DOI: | 10.1109/ISIT.2008.4595144 |