Arithmetic coding for joint source-channel coding

SIGMAP 2010 - Proceedings of the International Conference on Signal Processing and Multimedia Applications

Volumn , Issue , 2010, Pages 5-14

  Spiteri, Trevor ^a   Buttigieg, Victor ^a  

^a UNIVERSITY OF MALTA   (Malta)

Author keywords

Arithmetic coding; Joint source channel coding

Indexed keywords

ARITHMETIC CODERS; ARITHMETIC CODING; ARITHMETIC DECODERS; FORBIDDEN SYMBOL; JOINT SOURCE-CHANNEL CODING; LOOK-AHEAD; MAXIMUM A POSTERIORI ESTIMATION; SOFT DECODING;

CHANNEL CODING; DECODING; MULTIMEDIA SIGNAL PROCESSING; SIGNAL DETECTION; SIGNAL PROCESSING;

ERROR DETECTION;

EID: 78751525347     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Bahl, L. R., Cocke, J., Jelinek, R, and Raviv, J. (1974). Optimal decoding of linear codes for minimizing symbol error rate. IEEE Transactions on Information Theory, 20(2):284-287.
2. Ben-Jamaa, S., Weidmann, C, and Kieffer, M. (2008). Analytical tools for optimizing the error correction performance of arithmetic codes. IEEE Transactions on Communications, 56(9): 1458-1468.
3. Bi, D., Hoffman, M. W., and Sayood, K. (2010). Joint Source Channel Coding Using Arithmetic Codes. Synthesis Lectures on Communications. Morgan & Claypool Publishers.
4. Boyd, C, Cleary, J. G., Irvine, S. A., Rinsma-Melchert, I., and Witten, I. H. (1997). Integrating error detection into arithmetic coding. IEEE Transactions on Communications, 45(1): 1-3.
5. Grangetto, M., Cosman, R, and Olmo, G. (2005). Joint source/channel coding and MAP decoding of arithmetic codes. IEEE Transactions on Communications, 53(6): 1007-1016.
6. Grangetto, M., Scanavino, B., Olmo, G., and Benedetto, S. (2007). Iterative decoding of serially concatenated arithmetic and channel codes with jpeg 2000 applications. IEEE Transactions on Image Processing, 16(6):1557-1567.
7. Guionnet, T. and Guillemot, C. (2003). Soft decoding and synchronization of arithmetic codes: Application to image transmission over noisy channels. IEEE Transactions on Image Processing, 12(12): 1599-1609.
8. Hagenauer, J. (1988). Rate-compatible punctured convo-lutional codes (RCPC codes) and their applications. IEEE Transactions on Communications, 36(4):389-400.
9. Huffman, D. A. (1952). A method for the construction of minimum-redundancy codes. Proceedings of the IRE, 40(9): 1098-1101.
10. Jelinek, F. (1969). Fast sequential decoding algorithm using a stack. IBM Journal of Research and Development, 13(6):675-685.
11. Lelewer, D. A. and Hirschberg, D. S. (1987). Data compression. ACM Computing Surveys, 3:261-296.
12. MacKay, D. J. C. (2003). Information Theory, Inference, and Learning Algorithms, chapter 25, pages 324-333. Cambridge University Press.
13. Park, M. and Miller, D. J. (2000). Joint source-channel decoding for variable-length encoded data by exact and approximate MAP sequence estimation. IEEE Transactions on Communications, 48(1): 1-6.
14. Rissanen, J. J. (1976). Generalized Kraft inequality and arithmetic coding. IBM Journal of Research and Development, 20(3): 198-203.
15. Sayir, J. (1999). Arithmetic coding for noisy channels. In Proceedings of the 1999 IEEE Information Theory and Communications Workshop, pages 69-71.
16. Shannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27:379-423.
17. Vembu, S., Verdù, S., and Steinberg, Y. (1995). The source-channel separation theorem revisited. IEEE Transactions on Information Theory, 41(1):44-54.
18. Witten, I. H, Neal, R. M, and Cleary, J. G. (1987). Arithmetic coding for data compression. Communications of the ACM, 30(6):520-540.