Turbo techniques for joint source-channel decoding of multimedia content
Article No.: 48, Pages 1 - 6
Abstract
Joint source-channel turbo decoding is a promising alternative to classical tandem/separate decoding, as the literature has shown in the recent years. It is able at the receiver to jointly use and to benefit both from the redundancy left, or introduced intentionally, by the source code and from the error correcting capabilities of the channel code. This offers great advantages in terms of robustness with particular codecs, at the expense however of a reasonable increase in decoding complexity. We focus in this tutorial presentation on the derivation of such turbo decoders within the factor graph framework and the Sum-Product algorithm, and on theoretical arguments underlining some of the potentials of the joint source-channel turbo decoding concept.
References
[1]
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.
[2]
C. E. Shannon, "A mathematical theory of communication," Bell System Tech. Journal, vol. 27, pp. 379--423/623--656, July/October 1948.
[3]
S. Benedetto and G. Montorsi, "Unveiling turbo codes: some results on parallel concatenated coding schemes," IEEE Trans. Inform. Theory, vol. 42, no. 2, pp. 409--428, Mar. 1996.
[4]
G. D. Forney, "Codes on graphs: Normal realizations," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 520--548, Feb. 2001.
[5]
F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 498--519, Feb. 2001.
[6]
H.-A. Loeliger, "An introduction to factor graphs," IEEE Signal Processing Mag., vol. 21, no. 1, pp. 28--41, Jan. 2004.
[7]
D. Forney, G., "The viterbi algorithm," Proc. IEEE, vol. 61, pp. 268--278, Mar. 1973.
[8]
V. B. Balakirsky, "Joint source-channel coding with variable length codes," in Proc. IEEE ISIT'97, Ulm, Germany, July 1997, p. 491.
[9]
L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. 20, pp. 284--287, Mar. 1974.
[10]
R. Bauer and J. Hagenauer, "Turbo-fec/vlc-decoding and its application to text compression," in Conf. on Information Sciences and Systems 2000, Princeton, USA, Mar. 2000.
[11]
X. Jaspar and L. Vandendorpe, "Design and performance analysis of joint source-channel turbo schemes with variable length codes," in Proc. IEEE ICC'05, vol. 1, Seoul, Korea, May 2005, pp. 526--530.
[12]
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.
[13]
K. Laković and J. Villasenor, "On design of error-correcting reversible variable length codes," IEEE Commun. Lett., vol. 6, no. 8, pp. 337--339, Aug. 2002.
[14]
D. A. Huffman, "A method for the construction of minimum-redundancy codes," in Proc. IRE, vol. 40, 1952, pp. 1098--1101.
[15]
Z. Peng, Y.-F. Huang, and D. J. Costello, "Turbo codes for image transmission - a joint channel and source decoding approach," IEEE J. Select. Areas Commun., vol. 6, pp. 868--879, June 2000.
[16]
Xiao Feng Ma and W. Lynch, "Iterative joint source-channel decoding using turbo codes for mpeg-4 video transmission," in Proc. IEEE ICASSP'04, Montreal, Canada, May 2004.
Recommendations
Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets
This paper is devoted to the finite-length analysis of turbo decoding over the binary erasure channel (BEC). The performance of iterative belief-propagation decoding of low-density parity-check (LDPC) codes over the BEC can be characterized in terms of ...
Joint source and channel decoding for variable length encoded turbo codes
Joint source and channel decoding (JSCD) has been proved to be an effective technique which can improve decoding performance by exploiting residual source redundancy. Most previous publications on this subject focus on a traditional coding scheme in ...
Joint source channel decoding and iterative symbol combining with turbo trellis-coded modulation
A new joint source channel decoding (JSCD) scheme for turbo trellis-coded modulation is proposed which exploits symbol-a-priori probabilities to improve decoding performance. To obtain symbol-a-priori probabilities, we propose a new method which uses a ...
Comments
Information & Contributors
Information
Published In
September 2006
281 pages
ISBN:1595935177
DOI:10.1145/1374296
Copyright © 2006 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 18 September 2006
Check for updates
Author Tags
Qualifiers
- Poster
Funding Sources
- Federal Office for Scientific, Technical and Cultural Affairs, Belgium
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 54Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in