Robust codes and joint source-channel codes for multimedia transmission over mobile channels. (Codes robustes et codes joints source-canal pour transmission multimédia sur canaux mobiles)

Some new error-resilient source coding and joint source/channel coding techniques are proposed for the transmission of multimedia sources over error-prone channels. First, we introduce a class of entropy codes providing unequal error-resilience, i.e. providing some protection to the most sensitive information. These codes are then extended to exploit the temporal dependencies. A new state model based on the aggregation of some states of the trellis is then proposed and analyzed for soft source decoding of variable length codes with a length constraint. It allows the weighting of the compromise between the estimation accuracy and the decoding complexity. Next, some paquetization methods are proposed to reduce the error propagation phenomenon of variable length codes. Finally, some re-writing rules are proposed to extend the binary codetree representation of entropy codes. The proposed representation allows in particular the design of codes with improved soft decoding performances.

[1]  Richard E. Blahut,et al.  Computation of channel capacity and rate-distortion functions , 1972, IEEE Trans. Inf. Theory.

[2]  Fady Alajaji,et al.  Transmission of nonuniform memoryless sources via nonsystematic turbo codes , 2004, IEEE Transactions on Communications.

[3]  Hang Nguyen,et al.  Estimation of redundancy in compressed image and video data for joint source- channel decoding , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[4]  Wojciech Szpankowski,et al.  Joint source-channel LZ'77 coding , 2003, Data Compression Conference, 2003. Proceedings. DCC 2003.

[5]  Richard Clark Pasco,et al.  Source coding algorithms for fast data compression , 1976 .

[6]  Hervé Jégou,et al.  Entropy Coding With Variable-Length Rewriting Systems , 2007, IEEE Transactions on Communications.

[7]  En-Hui Yang,et al.  Grammar-based codes: A new class of universal lossless source codes , 2000, IEEE Trans. Inf. Theory.

[8]  Ja-Ling Wu,et al.  On constructing the Huffman-code-based reversible variable-length codes , 2001, IEEE Trans. Commun..

[9]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[10]  Thomas E. Fuja,et al.  Improving the performance of variable-length encoded systems through cooperation between source and channel decoders , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[11]  J G Daugman,et al.  Information Theory and Coding , 1998 .

[12]  Richard E. Blahut.  Transform Techniques for Error Control Codes , 1979, IBM J. Res. Dev..

[13]  W. Szpankowski,et al.  On the analysis of variable-to-variable length codes , 2002, Proceedings IEEE International Symposium on Information Theory,.

[14]  William A. Pearlman,et al.  Multilayered protection of embedded video bitstreams over binary symmetric and packet erasure channels , 2005, J. Vis. Commun. Image Represent..

[15]  Hervé Jégou,et al.  Error-resilient binary multiplexed source codes , 2003, 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)..

[16]  Yasuhiro Takishima,et al.  Error states and synchronization recovery for variable length codes , 1994, IEEE Trans. Commun..

[17]  Khalid Sayood,et al.  Joint source/channel coding for variable length codes , 2000, IEEE Trans. Commun..

[18]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[19]  Thomas E. Fuja,et al.  Joint source-channel decoding of variable-length encoded sources , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).

[20]  Plateau de Moulon,et al.  Treillis à complexité réduite pour le décodage de codes à longueur variable Reduced-complexity trellises for the joint source-channel decoding of variable-length encoded data , 2005 .

[21]  Hervé Jégou,et al.  Synchronization Recovery and State Model Reduction for Soft Decoding of Variable Length Codes , 2007, IEEE Transactions on Information Theory.

[22]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[23]  Allen Gersho,et al.  Pseudo-Gray coding , 1990, IEEE Trans. Commun..

[24]  John D. Villasenor,et al.  Reversible variable length codes for efficient and robust image and video coding , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

[25]  Hervé Jégou,et al.  Source multiplexed codes for error-prone channels , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[26]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[27]  James W. Modestino,et al.  Rate-distortion performance for joint source and channel coding of images , 1995, Proceedings., International Conference on Image Processing.

[28]  Marion Jeanne,et al.  Joint source-channel decoding of variable-length codes for convolutional codes and turbo codes , 2005, IEEE Transactions on Communications.

[29]  Hervé Jégou,et al.  Robust multiplexed codes for compression of heterogeneous data , 2005, IEEE Transactions on Information Theory.

[30]  Ja-Ling Wu,et al.  Discrete cosine transform in error control coding , 1995, IEEE Trans. Commun..

[31]  Tomas Eriksson.  Trellis Source Coding Methods for Low Rates and Short Blocks , 2005 .

[32]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[33]  Michael E. Monaco,et al.  Corrections and additions to 'Error recovery for variable length codes' by J.C. Maxted and J.P. Robinson , 1987, IEEE Trans. Inf. Theory.

[34]  David J. Miller,et al.  A sequence-based approximate MMSE decoder for source coding over noisy channels using discrete hidden Markov models , 1998, IEEE Trans. Commun..

[35]  Joachim Hagenauer,et al.  Symbol-by-Symbol MAP Decoding of Variable Length Codes , 2000 .

[36]  Thomas E. Fuja,et al.  Exploiting the residual redundancy in motion estimation vectors to improve the quality of compressed video transmitted over noisy channels , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[37]  Serap A. Savari,et al.  Generalized Tunstall codes for sources with memory , 1997, IEEE Trans. Inf. Theory.

[38]  Robert A. Scholtz,et al.  On the characterization of statistically synchronizable codes (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[39]  David C. van Voorhis.  Constructing codes with bounded codeword lengths (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[40]  J. Vitter,et al.  Practical Implementations of Arithmetic Coding , 1991 .

[41]  Hervé Jégou,et al.  Suffix-constrained codes for progressive and robust data compression: Self-multiplexed codes , 2004, 2004 12th European Signal Processing Conference.

[42]  Arnaud Guyader,et al.  Contribution aux algorithmes de décodage pour les codes graphiques , 2002 .

[43]  Abraham Lempel,et al.  Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[44]  Jörg Kliewer,et al.  Robust decoding of variable-length encoded Markov sources using a three-dimensional trellis , 2003, IEEE Communications Letters.

[45]  A. R. Reibman,et al.  Self-synchronizing variable-length codes for image transmission , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[46]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[47]  Joachim Hagenauer,et al.  Iterative source/channel-decoding using reversible variable length codes , 2000, Proceedings DCC 2000. Data Compression Conference.

[48]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[49]  Robert M. Gray,et al.  Joint source and noisy channel trellis encoding , 1981, IEEE Trans. Inf. Theory.

[50]  Joachim Hagenauer,et al.  Rate-compatible punctured convolutional codes (RCPC codes) and their applications , 1988, IEEE Trans. Commun..

[51]  Peter F. Swaszek,et al.  More on the error recovery for variable-length codes , 1995, IEEE Trans. Inf. Theory.

[52]  Nariman Farvardin,et al.  A study of vector quantization for noisy channels , 1990, IEEE Trans. Inf. Theory.

[53]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[54]  Dan Zuras.  More On Squaring and Multiplying Large Integers , 1994, IEEE Trans. Computers.

[55]  Zhen Zhang,et al.  Synchronization recovery of variable-length codes , 2002, IEEE Trans. Inf. Theory.

[56]  Michael Joseph Gormish,et al.  Source coding with channel, distortion, and complexity constraints , 1994 .

[57]  Nick G. Kingsbury,et al.  The EREC: an error-resilient technique for coding variable-length blocks of data , 1996, IEEE Trans. Image Process..

[58]  Matthew Klimesh,et al.  Error containment in compressed data using sync markers , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[59]  Tj Tjalling Tjalkens.  The complexity of minimum redundancy coding , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[60]  Ramesh Pyndiah,et al.  Near-optimum decoding of product codes: block turbo codes , 1998, IEEE Trans. Commun..

[61]  Christine Guillemot,et al.  Codage entropique à base de règles de ré-écriture , 2005 .

[62]  Christine Guillemot,et al.  Joint source-channel turbo decoding of entropy-coded sources , 2001, IEEE J. Sel. Areas Commun..

[63]  Thomas Guionnet,et al.  Soft decoding and synchronization of arithmetic codes: application to image transmission over noisy channels , 2003, IEEE Trans. Image Process..

[64]  H. Jégou,et al.  Trellis state aggregation for soft decoding of variable length codes , 2005, IEEE Workshop on Signal Processing Systems Design and Implementation, 2005..

[65]  Ramesh Pyndiah,et al.  Optimized source coding and coded modulation for digital transmission of still images on a noisy channel , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[66]  Nick Kingsbury,et al.  Enhancements to the error resilient entropy code , 1998, 1998 IEEE Second Workshop on Multimedia Signal Processing (Cat. No.98EX175).

[67]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[68]  Sorina Dumitrescu,et al.  On the complexity of joint source-channel decoding of Markov sequences over memoryless channels , 2005, IEEE Transactions on Communications.

[69]  Anatolij A. Karatsuba,et al.  Multiplication of Multidigit Numbers on Automata , 1963 .

[70]  Nariman Farvardin,et al.  On the performance and complexity of channel-optimized vector quantizers , 1991, IEEE Trans. Inf. Theory.

[71]  Heiko Schwarz,et al.  Context-based adaptive binary arithmetic coding in the H.264/AVC video compression standard , 2003, IEEE Trans. Circuits Syst. Video Technol..

[72]  Luc Vandendorpe,et al.  Performance and convergence analysis of joint source-channel turbo schemes with variable length codes , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

[73]  Khalid Sayood,et al.  Use of residual redundancy in the design of joint source/channel coders , 1991, IEEE Trans. Commun..

[74]  Jossy Sayir.  Arithmetic coding for noisy channels , 1999, Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253).

[75]  T. C. Hu,et al.  Optimal Computer Search Trees and Variable-Length Alphabetical Codes , 1971 .

[76]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[77]  C. Weidmann,et al.  Reduced-complexity soft-ln-soft-out decoding of variable-length codes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[78]  Abraham Gabay.  Codage conjoint source-canal : application a la transmission d'images par satellite , 2001 .

[79]  Thomas E. Fuja,et al.  Robust transmission of variable-length encoded sources , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[80]  Jörg Kliewer,et al.  Iterative joint source-channel decoding of variable-length codes using residual source redundancy , 2005, IEEE Transactions on Wireless Communications.

[81]  Nariman Farvardin,et al.  Subband Image Coding Using Entropy-Coded Quantization over Noisy Channels , 1992, IEEE J. Sel. Areas Commun..

[82]  Brian Parker Tunstall,et al.  Synthesis of noiseless compression codes , 1967 .

[83]  Joachim Hagenauer,et al.  Iterative source/channel decoding based on a trellis representation for variable length codes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[84]  Susanna Kaiser,et al.  . Soft source decoding with applications , 2001, IEEE Trans. Circuits Syst. Video Technol..

[85]  Raymond W. Yeung,et al.  A simple upper bound on the redundancy of Huffman codes , 2002, IEEE Trans. Inf. Theory.

[86]  Luc Vandendorpe,et al.  New iterative decoding of variable length codes with turbo-codes , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[87]  Mark R. Titchener.  The synchronization of variable-length codes , 1997, IEEE Trans. Inf. Theory.

[88]  Avideh Zakhor,et al.  Joint source/channel coding of scalable video over noisy channels , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

[89]  Jossy Sayir.  Iterating the Arimoto-Blahut algorithm for faster convergence , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[90]  Fady Alajaji,et al.  Turbo codes for nonuniform memoryless sources over noisy channels , 2002, IEEE Communications Letters.

[91]  Thomas Guionnet,et al.  Soft and Joint Source-Channel Decoding of Quasi-Arithmetic Codes , 2004, EURASIP J. Adv. Signal Process..

[92]  Hervé Jégou,et al.  First-order multiplexed source codes for error-resilient entropy coding , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[93]  Christian P. Robert,et al.  The Bayesian choice : from decision-theoretic foundations to computational implementation , 2007 .

[94]  David S. Taubman,et al.  High performance scalable image compression with EBCOT , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

[95]  Thomas J. Ferguson,et al.  Self-synchronizing Huffman codes , 1984, IEEE Trans. Inf. Theory.

[96]  H. Jégou,et al.  Error-resilient and progressive transmission and decoding of compressed images , 2007 .

[97]  J. Vaisey,et al.  Joint source-channel decoding of entropy coded Markov sources over binary symmetric channels , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[98]  Derek H. Smith,et al.  Robust Data Compression: Consistency Checking in the Synchronization of Variable Length Codes , 2004, Comput. J..

[99]  Jorma Rissanen,et al.  Generalized Kraft Inequality and Arithmetic Coding , 1976, IBM J. Res. Dev..

[100]  M. Wada,et al.  Reversible variable length codes , 1995, IEEE Trans. Commun..

[101]  Luisa Gargano,et al.  On the characterization of statistically synchronizable variable-length codes , 1988, IEEE Trans. Inf. Theory.

[102]  Patrick G. Farrell,et al.  Variable-length error-correcting codes , 2000 .

[103]  Lane A. Hemaspaandra,et al.  Using simulated annealing to design good codes , 1987, IEEE Trans. Inf. Theory.

[104]  Ragnar Thobaben,et al.  Parallel concatenated joint source-channel coding , 2003 .

[105]  Wojciech Szpankowski,et al.  Asymptotic average redundancy of Huffman (and Shannon-Fano) block codes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).