Joint source-channel turbo techniques for discrete-valued sources: From theory to practice

Proceedings of the IEEE

Volumn 95, Issue 6, 2007, Pages 1345-1361

  Jaspar, Xavier ^a   Guillemot, Christine ^b   Vandendorpe, Luc ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

Channel code; Cross layer design; Iterative decoding; Joint source channel code; Source code; Turbo principle

Indexed keywords

CHANNEL CODING; CONSTRAINED OPTIMIZATION; ITERATIVE DECODING; SEPARATION; TURBO CODES;

CROSS-LAYER DESIGN; DESIGN AND OPTIMIZATION; END-TO-END DISTORTION; JOINT SOURCE-CHANNEL CODES; LOSSLESS COMPRESSION; SOURCE AND CHANNEL CODING; SOURCE CODES; TURBO PRINCIPLE;

SOURCE SEPARATION;

EID: 64149104469     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2007.896491     Document Type: Article

References (76)

1. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, 623-656, Jul./Oct. 1948.
2. R. Bauer and J. Hagenauer, "Symbol-by-symbol MAP decoding of variable length codes," in Proc. ITG SCC, 2000, pp. 111-116.
3. R. Perkert, M. Kaindl, and T. Hindelang, "Iterative source and channel decoding for GSM," in Proc. IEEE ICASSP, 2001, pp. 2649-2652.
4. J. Hagenauer and R. Bauer, "The turbo principle in joint source channel decoding of variable length codes," in Proc. IEEE ITW, 2001, pp. 128-130.
5. L. Guivarch, J.-C. Carlach, and P. Siohan, "Joint source-channel soft decoding of Huffman codes with turbo-codes," in Proc. IEEE DCC, Mar. 2000, pp. 88-92.
6. Z. Peng, Y.-F. Huang, and D. J. Costello, "Turbo codes for image transmissionVA joint channel and source decoding approach," IEEE J. Sel. Areas Commun., vol. 18, no. 6, pp. 868-879, Jun. 2000.
7. 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, no. 9, pp. 1680-1696, Sep. 2001.
8. N. Görtz, "On the iterative approximation of optimal joint source-channel decoding," IEEE J. Sel. Areas Commun., vol. 19, no. 9, pp. 1662-1670, Sep. 2001.
9. J. Garcia-Frias and J. D. Villasenor, "Joint turbo decoding and estimation of hidden Markov sources," IEEE J. Sel. Areas Commun., vol. 19, no. 9, pp. 1671-1679, Sep. 2001.
10. A. Hedayat and A. Nosratinia, "List decoding of variable length codes with application in joint source channel coding," in Conf. Rec. 36th Asilomar Conf. Signals, Systems and Computers, 2002, vol. 1, pp. 21-25.
11. K. Laković and J. Villasenor, "Combining variable length codes and turbo codes," in Proc. IEEE VTC, 2002, pp. 1719-1723.
12. R. Thobaben and J. Kliewer, "On iterative source-channel decoding for variable-length encoded Markov sources using a bit-level trellis," in Proc. IEEE SPAWC, 2003, pp. 50-54.
13. N. Görtz, "Optimization of bit mappings for iterative source-channel decoding," presented in the Int. Symp. Turbo Codes and Related Topics, Brest, France, 2003.
14. J. Kliewer and R. Thobaben, "Parallel concatenated joint source-channel coding," Electron. Lett., vol. 39, no. 23, pp. 1664-1666, Nov. 2003.
15. T. Guionnet and C. Guillemot, "Soft decoding and synchronization of arithmetic codes for image transmission over error-prone channels," IEEE Trans. Image Process., vol. 12, no. 12, pp. 1599-1609, Dec. 2003.
16. T. Guionnet and C. Guillemot, "Soft and joint source-channel decoding of quasi-arithmetic codes," Eurasip J. Appl. Signal Process., Mar. 2004.
17. M. Grangetto, B. Scanavino, and G. Olmo, "Joint source-channel iterative decoding of arithmetic codes," in Proc. IEEE ICC, 2004, pp. 886-890.
18. X. Jaspar and L. Vandendorpe, "New iterative decoding of variable length codes with turbo codes," in Proc. IEEE ICC, 2004, pp. 2606-2610.
19. G.-C. Zhu, F. Alajaji, J. Bajcsy, and P. Mitran, "Transmission of nonuniform memoryless sources via nonsystematic turbo codes," IEEE Trans. Commun., vol. 52, no. 8, pp. 1344-1354, Aug. 2004.
20. H. Nguyen and P. Duhamel, "Iterative joint source-channel decoding of variable length encoded video sequences exploiting source semantics," in Proc. IEEE ICIP, 2004, pp. 3221-3224.
21. X. Jaspar and L. Vandendorpe, "Performance and convergence analysis of joint source-channel turbo schemes with variable length codes," in Proc. IEEE ICASSP, 2005, vol. 3, pp. 485-488.
22. M. Adrat and P. Vary, "Iterative source-channel decoding: Improved system design using EXIT charts," Eurasip J. Appl. Signal Process., no. 6, pp. 928-947, May 2005.
23. C. Poulliat, D. Declercq, and C. Lamy-Bergot, and I. Fijalkow, "Analysis and optimization of irregular LDPC codes for joint source-channel decoding," IEEE Commun. Lett., vol. 9, no. 12, pp. 1064-1066, Dec. 2005.
24. G.-C. Zhu and F. Alajaji, "Joint source-channel turbo coding for binary Markov sources," IEEE Trans. Wireless Commun., vol. 5, no. 5, pp. 1065-1075, May 2006.
25. G. D. Forney, "Codes on graphs: Normal realizations," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 520-548, Feb. 2001.
26. H.-A. Loeliger, J. Dauwels, J. Hu, S. Korl, L. Ping, F. R. Kschischang, "The factor graph approach to model-based signal processing," Proc. IEEE, vol. 95, no. 6, Jun. 2007.
27. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
28. H.-A. Loeliger, "An introduction to factor graphs," IEEE Signal Process. Mag., vol. 21, no. 1, pp. 28-41, Jan. 2004.
29. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inf. Theory, vol. IT-20, no. 2, pp. 284-287, Mar. 1974.
30. C. Boyd, J. G. Cleary, S. A. Irvine, I. Rinsma-Melchert, and I. H. Witten, "Integrating error detection into arithmetic coding," IEEE Trans. Commun., vol. 45, no. 1, pp. 1-3, Jan. 1997.
31. Y. Takishima, M. Wada, and H. Murakami, "Reversible variable length codes," IEEE Trans. Commun., vol. 43, no. 2/3/4, pp. 158-162, Feb.-Apr. 1995.
32. K. Lakoví and J. Villasenor, "On design of error-correcting reversible variable length codes," IEEE Commun. Lett., vol. 6, no. 8, pp. 337-339, Aug. 2002.
33. H. Jé gou and C. Guillemot, "Robust multiplexed codes for compression of heterogeneous data," IEEE Trans. Inf. Theory, vol. 51, no. 4, pp. 1393-1403, Apr. 2005.
34. H. Jégou and C. Guillemot, "Error-resilient first-order multiplexed source codes: Performance bounds, design and decoding algorithms," IEEE Trans. Signal Process., 2006.
35. K. Sayood and J. Borkenhagen, "Use of residual redundancy in the design of joint source/channel coders," IEEE Trans. Commun., vol. 39, no. 6, pp. 838-846, Jun. 1991.
36. D. J. Miller and M. Park, "A sequence-based approximate MMSE decoder for source coding over noisy channels using discrete hidden Markov models," IEEE Trans. Commun., vol. 46, no. 2, pp. 222-231, Feb. 1998.
37. A. H. Murad and T. E. Fuja, "Robust transmission of variable-length encoded sources," in Proc. IEEE WCNC, 1999, vol. 2, pp. 968-972.
38. K. Lakoví, J. Villasenor, and R. Wesel, "Robust joint huffman and convolutional decoding," in Proc. IEEE VTC, 1999, pp. 2551-2555.
39. C. Berrou and A. Glavieux, "Near optimum error correcting coding and decoding: Turbo-codes," IEEE Trans. Commun., vol. 44, no. 10, pp. 1261-1271, Oct. 1996.
40. B. Frey and D. MacKay, "A revolution: Belief propagation in graphs with cycles," in Proc. Neural Information Processing Systems Conf., 1997, vol. 10, pp. 479-485.
41. X. Ge, D. Eppstein, and P. Smyth, "The distribution of loop lengths in graphical models for turbo decoding," IEEE Trans. Inf. Theory, vol. 47, no. 6, pp. 2549-2553, Sep. 2001.
42. T. Guionnet, C. Guillemot, and E. Fabre, "Soft decoding of multiple descriptions," in Proc. IEEE ICME, 2002, vol. 2, pp. 601-604.
43. J. Barros, J. Hagenauer, and N. Görtz, "Turbo cross decoding of multiple descriptions," in Proc. IEEE ICC, 2002, vol. 3, pp. 1398-1402.
44. S. Benedetto and G. Montorsi, "Unveiling turbo codes: Some results on parallel concatenated coding schemes," IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 409-428, Mar. 1996.
45. V. Buttigieg, "Variable-length error-correcting codes," Ph.D. dissertation, Dept. Elect. Eng., Univ. Manchester, Manchester, U.K., 1995.
46. G. D. Forney, "The Viterbi algorithm," Proc. IEEE, vol. 61, no. 3, pp. 268-278, Mar. 1973.
47. S. T. Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol. 49, no. 10, pp. 1727-1737, Oct. 2001.
48. D. A. Huffman, "A method for the construction of minimum-redundancy codes," Proc. IRE, vol. 40, pp. 1098-1101, 1952.
49. V. B. Balakirsky, "Joint source-channel coding with variable length codes," in Proc. IEEE ISIT, 1997, pp. 491.
50. J. J. Rissanen, BGeneralized kraft inequality and arithmetic coding," IBM J. Res. Develop., vol. 20, pp. 198-203, May 1976.
51. P. G. Howard and J. S. Vitter, Image and Text Compression. Norwell, MA: Kluwer, 1992, pp. 85-112.
52. P. G. Howard and J. S. Vitter, "Design and analysis of fast text compression based on quasiarithmetic coding," in Proc. IEEE DCC, 1993, pp. 98-107.
53. S. K. M. Bystrom and A. Kopansky, "Soft source decoding with applications," IEEE Trans. Circuits Syst. Video Technol., vol. 11, no. 10, pp. 1108-1120, Oct. 2001.
54. H. Jégou, S. Malinowski, and C. Guillemot, "Trellis state aggregation for soft decoding of variable length codes," in Proc. IEEE Workshop Signal Processing Systems (SIPS), 2005, pp. 603-608.
55. G. Mohammad-Khani, C.-M. Lee, M. Kieffer, and P. Duhamel, "Simplification of VLC tables with application to ML and MAP decoding algorithms," IEEE Trans. Commun. vol. 54, no. 10, pp. 1835-1844, Oct. 2006.
56. J. Anderson and S. Mohan, "Sequential coding algorithms: A survey and cost analysis," IEEE Trans. Commun., vol. COM-32, no. 2, pp. 169-176, Feb. 1984.
57. S. J. Simmons, "Breadth-first trellis decoding with adaptive effort," IEEE Trans. Commun., vol. 38, no. 1, pp. 3-12, Jan. 1990.
58. F. Jelinek, "Fast sequential decoding algorithm using a stack," IBM J. Res. Develop., vol. 13, pp. 675-685, Nov. 1969.
59. R. M. Fano, "A heuristic discussion of probabilistic decoding," IEEE Trans. Inf. Theory, vol. IT-9, no. 2, pp. 64-74, Apr. 1963.
60. J. Hagenauer and C. Kuhn, "The List-Sequential (LISS) algorithm and its application," IEEE Trans. Commun., vol. 55, no. 5, May 2007.
61. B. Pettijohn, M. Hoffman, and K. Sayood, "Joint source/channel coding using arithmetic codes," IEEE Trans. Commun., vol. 49, no. 5, pp. 826-836, May 2001.
62. S. Ben-Jamaa, C. Weidmann, and M. Kieffer, "Asymptotic error correcting performance of joint source-channel schemes based on arithmetic coding," in Proc. IEEE MMSP, 2006, pp. 262-266.
63. J. Maxted and J. Robinson, "Error recovery for variables length codes," IEEE Trans. Inf. Theory, vol. IT-31, no. 6, pp. 794-801, Nov. 1985.
64. P. F. Swaszek and P. DiCicco, "More on the error recovery for variable length codes," IEEE Trans. Inf. Theory, vol. IT-41, no. 6, pp. 2064-2071, Nov. 1995.
65. S. Malinowski, H. Jégou, and C. Guillemot, "On the link between the synchronization recovery and soft decoding of variable length codes," presented at the Int. Symp. Turbo Codes and Related Topics, Munich, Germany, 2006.
66. X. Jaspar and L. Vandendorpe, "Design and performance analysis of joint source-channel turbo schemes with variable length codes," in Proc. IEEE ICC, 2005, vol. 1, pp. 526-530.
67. Information Technology-Generic Coding of Moving Pictures and Associated Audio InformationVPart 7: Advanced Audio Coding (AAC), ISO/IEC 13818-7.
68. Information Technology-Coding of Audio-Visual Objects, ISO/IEC 14496.
69. C. Weidmann and P. Siohan, "Décodage conjoint source-canal avecestimation en ligne de la source," presented at the CORESA, (in French), Lyon, France, 2003.
70. G. Caire, S. Shamai, and S. Verdü, "Noiseless data compression with low-density parity-check codes," in Advances in Network Information Theory, ser. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, G. K. P. Gupta and A. J. van Wijngaarden, Eds. Providence, RI: Amer. Math. Soc., 2004, vol. 66, pp. 263-284.
71. N. Dütsch, G. Sebastian, J. Garcia-Frias, and J. Hagenauer, BSource model aided lossless turbo source coding," presented at the Int. Symp. Turbo Codes and Related Topics, Munich, Germany, 2006.
72. K. Subbalakshmi and Q. Chen, "Joint source-channel decoding for MPEG-4 coded video over wireless channels," in Proc. IASTED Wireless and Optical Communications, 2002, pp. 617-622.
73. L. Perros-Meilhac and C. Lamy, "Huffman tree based metric derivation for a low complexity sequential soft VLC decoding," in Proc. IEEE ICC, 2002, pp. 783-787.
74. A. Kopansky and M. Bystrom, "Sequential decoding of MPEG-4 coded bitstreams for error resilience," presented at the Conf. Information Sciences and Systems, Baltimore, MD, 1999.
75. M. Jeanne, C. Guillemot, T. Guionnet, and F. Pauchet, "Error resilient decoding of context-based adaptive binary arithmetic codes," IEEE Trans. Circuits Syst. Video Technol., submitted for publication.
76. S. Khayam, S. Karande, H. Radha, and D. Loguinov, "Performance analysis and modeling of errors and losses over 802.11b lans for high-bit-rate real-time multimedia," Signal Process. Image Commun., vol. 18, no. 7, pp. 575-595, Aug. 2003.