Journal of University of Chinese Academy of Sciences >
Low-complexity joint source-channel decoding based on variable length encoded Turbo codes
Received date: 2010-04-26
Revised date: 2010-05-10
Online published: 2011-03-15
Variable length encoded Turbo codes (VL Turbo codes) with constructed joint decoding plane trellis has better decoding performance than the bit-level decoding algorithm. However the plane trellis is complicated, resulting in a high decoding complexity of VL Turbo codes. We construct a space trellis and propose a low-complexity JSCD approach based on VL Turbo codes. Simulation results show that the proposed approach reduces the decoding complexity by 3.8%, compared to the plane trellis, and the gain of Eb/N0 is about 0.2dB at SER=10-4.
Key words： JSCC/D; VL Turbo codes; space trellis; VLS-APP
CHEN Shao-Hong , ZHANG Can , TU Guo-Fang , HUO Yue-Heng . Low-complexity joint source-channel decoding based on variable length encoded Turbo codes[J]. Journal of University of Chinese Academy of Sciences, 2011 , 28(2) : 246 -252 . DOI: 10.7523/j.issn.2095-6134.2011.2.017
[1] Bauer R, Hagenauer J. Iterative source/channel decoding using reversible variable length codes //Proc IEEE Data Compression Conference (DCC’00). Snowbird, Utah, USA, 2000: 93-102.
[2] Bauer R, Hagenauer J. Symbol-by-symbol MAP decoding of variable length codes. //Proc 3rd ITG Conference on Source and Channel Coding (CSCC’00). Munich, Germany, 2000:111-116.
[3] Bahl LR, Cocke J, Jelinek F, et al. Optimal decoding of linear codes for minimizing symbol error rate
[J]. IEEE Trans Inf Theo, 1974, 20(2): 284-287.
[4] Kliewer J, Thobaben R. Parallel concatenated joint source-channel coding
[J]. Electron Lett, 2003, 39(23): 1664-1666.
[5] Kliewer J, Thobaben R. Iterative joint source-channel decoding of variable-length codes using residual source redundancy
[J]. IEEE Trans Wire Commun, 2005, 4(3): 919-929.
[6] Thobaben R, Kliewer J. Low-complexity iterative joint source-channel decoding for variable-length encoded Markov sources
[J]. IEEE Trans Commun, 2005, 53(12): 2054-2064.
[7] Bauer R, Hagenauer J. On variable length codes for iterative source/channel decoding //Proc IEEE Data Compression Conference (DCC’01). Snowbird, Utah, USA, 2001:273-282.
[8] Guivarch L, Carlach J C, Siohan P. Joint source-channel soft decoding of huffman codes with turbo codes //Proc DCC’00, Snowbird, Uath, USA, 2000:83-92.
[9] Jeanne M, Carlach J C, Siohan P. Joint source-channel decoding of variable length codes for convolutional codes and turbo codes
[J]. IEEE Trans Commun, 2005, 53(1): 10-15.
[10] Liu J J, Tu G F, Zhang C, et al. Joint source and channel decoding for variable length encoded turbo codes
[J]. EURASIP J Advances in Signal Processing, 2008(1):.
[11] Lakovic K, Villasenor J. Combining variable-length codes and turbo codes //Proc IEEE 55th Vehicular Technology Conference (VTC’02). 2002, 4: 1719-1723.
[12] Okuda T, Tanaka E, Kasai T. A method for the correction of garbled words based on the Levenshtein metric
[J]. IEEE Trans Comp, 1976, 25(2): 172-178.
/
| 〈 |
|
〉 |