Open Access

Joint Source-Channel Coding by Means of an Oversampled Filter Bank Code

  • Slavica Marinkovic1 and
  • Christine Guillemot1
EURASIP Journal on Advances in Signal Processing20062006:082023

https://doi.org/10.1155/ASP/2006/82023

Received: 1 September 2004

Accepted: 7 April 2005

Published: 6 February 2006

Abstract

Quantized frame expansions based on block transforms and oversampled filter banks (OFBs) have been considered recently as joint source-channel codes (JSCCs) for erasure and error-resilient signal transmission over noisy channels. In this paper, we consider a coding chain involving an OFB-based signal decomposition followed by scalar quantization and a variable-length code (VLC) or a fixed-length code (FLC). This paper first examines the problem of channel error localization and correction in quantized OFB signal expansions. The error localization problem is treated as an -ary hypothesis testing problem. The likelihood values are derived from the joint pdf of the syndrome vectors under various hypotheses of impulse noise positions, and in a number of consecutive windows of the received samples. The error amplitudes are then estimated by solving the syndrome equations in the least-square sense. The message signal is reconstructed from the corrected received signal by a pseudoinverse receiver. We then improve the error localization procedure by introducing a per-symbol reliability information in the hypothesis testing procedure of the OFB syndrome decoder. The per-symbol reliability information is produced by the soft-input soft-output (SISO) VLC/FLC decoders. This leads to the design of an iterative algorithm for joint decoding of an FLC and an OFB code. The performance of the algorithms developed is evaluated in a wavelet-based image coding system.

[12345678910111213141516171819202122232425262728]

Authors’ Affiliations

(1)
IRISA-INRIA

References

  1. Redinbo GR: Decoding real block codes: activity detection Wiener estimation. IEEE Transactions on Information Theory 2000, 46(2):609-623. 10.1109/18.825828View ArticleMATHGoogle Scholar
  2. Wolf : Redundancy, the discrete Fourier transform, and impulse noise cancellation. IEEE Transactions on Communications 1983, 31(3):458-461. 10.1109/TCOM.1983.1095820View ArticleMATHGoogle Scholar
  3. Wu J-L, Shiu : Discrete cosine transform in error control coding. IEEE Transactions on Communications 1995, 43(5):1857-1861. 10.1109/26.387423View ArticleMATHGoogle Scholar
  4. Goyal VK, Kovacevic J, Vetterli M: Quantized frame expansions as source-channel codes for erasure channels. Proceedings of Data Compression Conference (DCC '99), March 1999, Snowbird, Utah, USA 326-335.Google Scholar
  5. Rath G, Guillemot C: Performance analysis and recursive syndrome decoding of DFT codes for bursty erasure recovery. IEEE Transactions on Signal Processing 2003, 51(5):1335-1350. 10.1109/TSP.2003.810286MathSciNetView ArticleGoogle Scholar
  6. Rath G, Guillemot C: Frame-theoretic analysis of DFT codes with erasures. IEEE Transactions on Signal Processing 2004, 52(2):447-460. 10.1109/TSP.2003.821106MathSciNetView ArticleGoogle Scholar
  7. Marvasti F, Hasan M, Echhart M, Talebi S: Efficient algorithms for burst error recovery using FFT and other transform kernels. IEEE Transactions on Signal Processing 1999, 47(4):1065-1075. 10.1109/78.752604View ArticleMATHGoogle Scholar
  8. Marshall TG Jr.: Coding of real-number sequences for error correction: a digital signal processing problem. IEEE Journal on Selected Areas in Communications 1984, 2(2):381-392. 10.1109/JSAC.1984.1146063View ArticleGoogle Scholar
  9. Blahut RE: Algebraic Methods for Signal Processing and Communications Coding. Springer, New York, NY, USA; 1992.View ArticleGoogle Scholar
  10. Mehrotra S, Chou PA: On optimal frame expansions for multiple description quantization. Proceedings of IEEE International Symposium on Information Theory (ISIT '00), June 2000, Sorrento, Italy 176-176.Google Scholar
  11. Rath G, Guillemot C: Characterization of a class of error correcting frames and their application to image transmission. Proceedings of Picture Coding Symposium, April 2003, Saint-Malo, FranceGoogle Scholar
  12. Rath G, Guillemot C: Subspace algorithms for error localization with DFT codes. Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '03), April 2003, Hong Kong, China 4: 257-260.Google Scholar
  13. Gabay A, Rioul O, Duhamel P: Joint source-channel coding using structured oversampled filters banks applied to image transmission. Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '01), May 2001, Salt Lake City, Utah, USA 4: 2581-2584.Google Scholar
  14. Kovacevic J, Dragotti PL, Goyal VK: Filter bank frame expansions with erasures. IEEE Transactions on Information Theory 2002, 48(6):1439-1450. 10.1109/TIT.2002.1003832MathSciNetView ArticleMATHGoogle Scholar
  15. Dragotti PL, Servetto SD, Vetterli M: Optimal filter banks for multiple description coding: analysis and synthesis. IEEE Transactions on Information Theory 2002, 48(7):2036-2052. 10.1109/TIT.2002.1013142View ArticleMATHGoogle Scholar
  16. Dragotti PL, Kovacevic J, Goyal VK: Quantized oversampled filter banks with erasures. Proceedings of Data Compression Conference (DCC '01), March 2001, Snowbird, Utah, USA 173-182.Google Scholar
  17. Motwani R, Guillemot C: Tree-structured oversampled filter banks as joint source-channel codes: application to image transmission over erasure channels. IEEE Transactions on Signal Processing 2004, 52(9): 2584-2599. 10.1109/TSP.2004.832027MathSciNetView ArticleGoogle Scholar
  18. Redinbo GR: Decoding real-number convolutional codes: change detection, Kalman estimation. IEEE Transactions on Information Theory 1997, 43(6):1864-1876. 10.1109/18.641552MathSciNetView ArticleMATHGoogle Scholar
  19. Chiang JC, Kieffer M, Duhamel P: Oversampled filter banks seen as channel codes: impulse noise correction. Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '03), April 2003, Hong Kong 4: 249-252.Google Scholar
  20. Van Trees HL: Detection, Estimation, and Modulation Theory. John Wiley & Sons, New York, NY, USA; 1968.MATHGoogle Scholar
  21. Bölcskei H, Hlawatsch F: Oversampled filter banks: optimal noise shaping, design freedom, and noise analysis. Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '97), April 1997, Munich, Germany 3: 2453-2456.Google Scholar
  22. Weiss S: On the design of oversampled filter banks for channel coding. Proceedings of 12th European Signal Processing Conference, September 2004, Vienna, Austria 885-888.Google Scholar
  23. Cvetkovic Z, Vetterli M: Oversampled filter banks. IEEE Transactions on Signal Processing 1998, 46(5):1245-1255. 10.1109/78.668788MathSciNetView ArticleGoogle Scholar
  24. Vaidyanathan PP: Multirate Systems and Filter Banks. Prentice-Hall, Englewood Cliffs, NJ, USA; 1993.MATHGoogle Scholar
  25. Guyader A, Fabre E, Guillemot C, Robert M: Joint source-channel turbo decoding of entropy-coded sources. IEEE Journal on Selected Areas in Communications 2001, 19(9):1680-1696. 10.1109/49.947033View ArticleGoogle Scholar
  26. Bahl L, Cocke J, Jelinek F, Raviv J: Optimal decoding of linear codes for minimizing symbol error rate. IEEE Transactions on Information Theory 1974, 20(2):284-287.MathSciNetView ArticleMATHGoogle Scholar
  27. Bauer R, Hagenauer J: Iterative source/channel decoding based on a trellis representation for variable length codes. Proceedings of IEEE International Symposium on Information Theory (ISIT '00), June 2000, Sorrento, Italy 238-238.Google Scholar
  28. Weidmann C, Siohan P: Décodage conjoint source-canal avec estimation en ligne de la sourc. Proceedings of COmpression et REprésentation des Signaux Audiovisuels (CORESA '03), January 2003, Lyon, France 105-108.Google Scholar

Copyright

© Marinkovic and Guillemot 2006