Abstract
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.
Original language | English |
---|---|
Title of host publication | [Host publication title missing] |
Publisher | IEEE - Institute of Electrical and Electronics Engineers Inc. |
Pages | 1035-1039 |
ISBN (Print) | 978-1-4244-2256-2 |
DOIs | |
Publication status | Published - 2008 |
Event | IEEE International Symposium on Information Theory, 2008 - Toronto, Toronto, Canada Duration: 2008 Jul 6 → 2008 Jul 11 |
Conference
Conference | IEEE International Symposium on Information Theory, 2008 |
---|---|
Country/Territory | Canada |
City | Toronto |
Period | 2008/07/06 → 2008/07/11 |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering
Free keywords
- LDPC codes
- LDPC convolutional codes
- spatial coupling
- braided codes