DocumentCode
1230102
Title
Joint source-channel decoding of variable-length codes for convolutional codes and turbo codes
Author
Jeanne, Marion ; Carlach, Jean-Claude ; Siohan, Pierre
Author_Institution
R&D Div. of France Telecom, Cesson Sevigne, France
Volume
53
Issue
1
fYear
2005
Firstpage
10
Lastpage
15
Abstract
Several recent publications have shown that joint source-channel decoding could be a powerful technique to take advantage of residual source redundancy for fixed- and variable-length source codes. This letter gives an in-depth analysis of a low-complexity method recently proposed by Guivarch et al., where the redundancy left by a Huffman encoder is used at a bit level in the channel decoder to improve its performance. Several simulation results are presented, showing for two first-order Markov sources of different sizes that using a priori knowledge of the source statistics yields a significant improvement, either with a Viterbi channel decoder or with a turbo decoder.
Keywords
Huffman codes; Markov processes; Viterbi decoding; combined source-channel coding; convolutional codes; statistics; turbo codes; variable length codes; Huffman encoder; Viterbi channel decoder; convolutional code; first-order Markov source; joint source-channel decoding; residual source redundancy; turbo code; variable-length source code; Carbon capture and storage; Channel coding; Convolutional codes; Decoding; Performance analysis; Research and development; Statistics; Telecommunications; Turbo codes; Viterbi algorithm;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOMM.2004.840664
Filename
1391181
Link To Document