Maximum a posteriori decoding of arithmetic codes in joint source-channel coding

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Arithmetic codes are being increasingly used in the entropy coding stage in many multimedia transmission applications. Combining channel coding with arithmetic coding can give implementation and performance advantages compared to separate source and channel coding. In this work, novel improvements are introduced into a technique by Grangetto et al. that uses maximum a posteriori (MAP) estimation for decoding joint source-channel coding using arithmetic codes. The arithmetic decoder is modified for quicker symbol decoding and error detection by the introduction of a look-ahead technique, and the calculation of the MAP metric is modified for faster error detection. These modifications also result in improved performance compared to the original scheme. Experimental results show an improvement of up to 0.4 dB when using soft-decision decoding and 0.6 dB when using hard-decision decoding. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Spiteri, T., & Buttigieg, V. (2012). Maximum a posteriori decoding of arithmetic codes in joint source-channel coding. In Communications in Computer and Information Science (Vol. 222 CCIS, pp. 363–377). https://doi.org/10.1007/978-3-642-25206-8_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free