TY - JOUR
T1 - An efficient variable-length code construction for iterative source-channel decoding
AU - Thobaben, Ragnar
AU - Kliewer, Jörg
N1 - Funding Information:
This work was supported in part by the German Research Foundation (DFG) under grant KL 1080/3-1. Parts of this work were presented at the 44th Annual Allerton Conference on Communication, Control, and Computing, September 2006, Monticello, IL [1]. Digital Object Identifier 10.1109/TCOMM.2009.07.070570
PY - 2009
Y1 - 2009
N2 - We present a novel variable-length code (VLC) construction which exhibits an inherent error correcting capability due to the exclusive presence of codewords with even Hamming weight. Besides error robustness, the proposed code construction features a similar codeword length distribution as Golomb-Rice codes, and therefore, in particular for sources with exponentially distributed symbols, has good source compression properties at the same time. We show that in a source channel coding framework with outer source encoding, inner channel encoding with a recursive convolutional code, and iterative decoding the proposed VLC construction can lead to significant performance improvements compared to fixed-length source encoding with optimized mappings. In particular, simulation results for the AWGN channel verify that for Gauss-Markov sources a performance close to the theoretical limit can be achieved.
AB - We present a novel variable-length code (VLC) construction which exhibits an inherent error correcting capability due to the exclusive presence of codewords with even Hamming weight. Besides error robustness, the proposed code construction features a similar codeword length distribution as Golomb-Rice codes, and therefore, in particular for sources with exponentially distributed symbols, has good source compression properties at the same time. We show that in a source channel coding framework with outer source encoding, inner channel encoding with a recursive convolutional code, and iterative decoding the proposed VLC construction can lead to significant performance improvements compared to fixed-length source encoding with optimized mappings. In particular, simulation results for the AWGN channel verify that for Gauss-Markov sources a performance close to the theoretical limit can be achieved.
KW - Iterative decoding
KW - Joint source channel coding
KW - Serially concatenated codes
KW - Variable-length codes
UR - http://www.scopus.com/inward/record.url?scp=68249147426&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=68249147426&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2009.07.070570
DO - 10.1109/TCOMM.2009.07.070570
M3 - Article
AN - SCOPUS:68249147426
SN - 0090-6778
VL - 57
SP - 2005
EP - 2013
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 7
ER -