Joint source-channel decoding of variable-length codes for convolutional codes and turbo codes

IEEE Transactions on Communications

Volumn 53, Issue 1, 2005, Pages 10-15

  Jeanne, Marion ^a,b   Carlach, Jean Claude ^a   Siohan, Pierre ^a,b  

^a ORANGE LABS   (France)

^b INRIA   (France)

Author keywords

Convolutional codes (CCs); Joint source channel coding; Turbo codes (TCs); Variable length codes (VLCs)

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONVOLUTIONAL CODES; PROBABILITY; TURBO CODES; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE; JOINT SOURCE CHANNEL CODING; MAXIMUM A POSTERIORI DECODING; VARIABLE LENGTH CODES;

DECODING;

EID: 14044254773     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2004.840664     Document Type: Article

References (20)

1. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, 1948.
2. J. Hagenauer, "Source-controlled channel decoding," IEEE Trans. Commun., vol. 43, pp. 2449-2457, Sep. 1995.
3. N. Görtz, "Analysis and performance of iterative source-channel decoding," in Proc. Int. Symp. Turbo Codes, Related Topics, Brest, France, Sep. 2000, pp. 251-254.
4. K. P. Subbalakshmi and J. Vaisey, "On the joint source-channel decoding of variable length encoded sources: The BSC case," IEEE Trans. Commun., vol. 49, pp. 2052-2055, Dec. 2001.
5. M. Bystrom, S. Kaiser, and A. Kopansky, "Soft source decoding with applications," IEEE Trans. Circuits Syst. Video Technol., vol. 11, pp. 1108-1120, Oct. 2001.
6. L. Perros-Meilhac and C. Lamy, "Huffman tree based metric derivation for a low-complexity sequential soft VLC decoding," in Proc. Int. Conf. Commun., New York, NY, Apr. 2002, pp. 783-787.
7. A. H. Murad and T. E. Fuja, "Joint source-channel decoding of variable length encoded sources," in Proc. ITW, Killarney, Ireland, Jun. 1998, pp. 94-95.
8. N. Demir and K. Sayood, "Joint source/channel coding for variable length codes," in Proc. IEEE Data Compression Conf., Snowbird, UT, Mar. 1998, pp. 139-148.
9. M. Park and D. J. Miller, "Joint source-channel decoding for variable-length encoded data by exact and approximate MAP sequence estimation," IEEE Trans. Commun., vol. 48, pp. 2449-2457, Jan. 2000.
10. K. Lakovié and J. Villasenor, "Combining variable length codes and Turbo codes," in Proc. IEEE Veh. Technol. Conf., vol. 4, May 2002, pp. 1719-1723.
11. R. Bauer and J. Hagenauer, "Iterative source/channel decoding using reversible variable length codes," in Proc. IEEE Data Compression Conf., Snowbird, UT, Mar. 2000, pp. 93-102.
12. A. Guyader, E. Fabre, C. Guillemot, and M. Robert, "Joint source-channel turbo decoding of entropy-coded sources," IEEE J. Sel. Areas Commun., vol. 19, pp. 1680-1696, Sep. 2001.
13. L. Guivarch, J. C. Carlach, and P. Siohan, "Joint source-channel soft decoding of Huffman sources with turbo-codes," in Proc. IEEE Data Compression Conf., Snowbird, Utah, Mar. 2000, pp. 83-92.
14. M. Jeanne, J. C. Carlach, P. Siohan, and L. Guivarch, "Source and joint source-channel decoding of variable length codes," in Proc. Int. Conf Commun., vol. 2, New York, NY, Apr. 2002, pp. 768-772.
15. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1990.
16. T. Okuda, E. Tanaka, and T. Kasai, "A method for the correction of garbled words based on the Levenshtein metric," IEEE Trans. Comput. vol. C-25, pp. 1064-1070, Feb. 1976.
17. A. Viterbi, "Error bounds for convolutional codes and an asymptotically optimal decoding algorithm," IEEE Trans. Int. Theory, vol. IT-13, pp. 260-269, Feb. 1967.
18. G. D. Forney, "The Viterbi algorithm," Proc. IEEE, vol. 61, pp. 268-278, Mar. 1973.
19. C. Berrou and A. Glavieux, "Near-optimum error-correcting coding and decoding: Turbo-codes," IEEE Trans. Commun., vol. 44, pp. 1261-1271, Oct. 1996.
20. P. Robertson, E. Villebrun, and P. Hoeher, "A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log-domain," in Proc. Int. Conf. Commun., Seattle, WA, Jun. 1995, pp. 1009-1013.