Table of Contents Author Guidelines Submit a Manuscript
International Journal of Digital Multimedia Broadcasting
Volume 2008, Article ID 124685, 18 pages
http://dx.doi.org/10.1155/2008/124685
Research Article

Lossy Joint Source-Channel Coding Using Raptor Codes

1Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA 90089, USA
2Department of Electrical Engineering, Princeton University, Princeton, NJ 08544, USA

Received 1 May 2008; Accepted 17 June 2008

Academic Editor: Massimiliano Laddomada

Copyright © 2008 O. Y. Bursalioglu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. T. M. Cover and J. A. Thomas, Elements of Information Theory, Wiley-Interscience, New York, NY, USA, 1991.
  2. A. Ortega and K. Ramchandran, “Rate-distortion methods for image and video compression,” IEEE Signal Processing Magazine, vol. 15, no. 6, pp. 23–50, 1998. View at Publisher · View at Google Scholar
  3. J. Ziv, “On universal quantization,” IEEE Transactions on Information Theory, vol. 31, no. 3, pp. 344–347, 1985. View at Publisher · View at Google Scholar
  4. D. S. Taubman and M. W. Marcellin, JPEG2000: Image Compression Fundamentals, Standards, and Practices, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001.
  5. M. Fresia and G. Caire, “A practical approach to lossy joint source channel coding,” in Proceedings of the Information Theory and Applications Workshop (ITA '07), San Diego, Calif, USA, February 2007.
  6. M. Fresia and G. Caire, “A practical approach to lossy joint source-channel coding,” submitted to IEEE Transactions on Information Theory.
  7. I. H. Witten, R. M. Neal, and J. G. Cleary, “Arithmetic coding for data compression,” Communications of the ACM, vol. 30, no. 6, pp. 520–540, 1987. View at Publisher · View at Google Scholar
  8. R. E. Krichevsky and V. K. Trofimov, “The performance of universal encoding,” IEEE Transactions on Information Theory, vol. 27, no. 2, pp. 199–207, 1981. View at Publisher · View at Google Scholar
  9. G. Caire, S. Shamai, and S. Verdu, “Noiseless data compression with low-density parity-check codes,” in Advances in Network Information Theory, P. Gupta, G. Kramer, and A. J. van Wijnggaardenl, Eds., vol. 66 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 263–284, American Mathematical Society, Providence, RI, USA, 2004. View at Google Scholar
  10. A. Shokrollahi, “Raptor codes,” IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2551–2567, 2006. View at Publisher · View at Google Scholar
  11. B. Hochwald and K. Zeger, “Tradeoff between source and channel coding,” IEEE Transactions on Information Theory, vol. 43, no. 5, pp. 1412–1424, 1997. View at Publisher · View at Google Scholar
  12. R. G. Gallager, Information Theory and Reliable Communication, Jonh Wiley & Sons, New York, NY, USA, 1968.
  13. S. T. Brink, “Convergence behavior of iteratively decoded parallel concatenated codes,” IEEE Transactions on Communications, vol. 49, no. 10, pp. 1727–1737, 2001. View at Publisher · View at Google Scholar
  14. O. Etesami and A. Shokrollahi, “Raptor codes on binary memoryless symmetric channels,” IEEE Transactions on Information Theory, vol. 52, no. 5, pp. 2033–2051, 2006. View at Publisher · View at Google Scholar
  15. T. J. Richardson and R. L. Urbanke, “The capacity of low-density parity-check codes under message-passing decoding,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 599–618, 2001. View at Publisher · View at Google Scholar
  16. A. Roumy, S. Guemghar, G. Caire, and S. Verdu, “Design methods for irregular repeat-accumulate codes,” IEEE Transactions on Information Theory, vol. 50, no. 8, pp. 1711–1727, 2004. View at Publisher · View at Google Scholar
  17. R. Palanki and J. S. Yedidia, “Rateless codes on noisy channels,” in Proceedings of the Conference on Information Sciences and Systems (CISS '04), Princeton, NJ, USA, March 2004.
  18. M. Luby, “LT codes,” in Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (FOCS '02), pp. 271–280, Vancouver, Canada, November 2002.
  19. R. M. Tanner, “A recursive approach to low complexity codes,” IEEE Transactions on Information Theory, vol. 27, no. 5, pp. 533–547, 1981. View at Publisher · View at Google Scholar
  20. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 498–519, 2001. View at Publisher · View at Google Scholar
  21. U. Wachsmann, R. F. H. Fischer, and J. B. Huber, “Multilevel codes: theoretical concepts and practical design rules,” IEEE Transactions on Information Theory, vol. 45, no. 5, pp. 1361–1391, 1999. View at Publisher · View at Google Scholar
  22. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, “Analysis of low density codes and improved designs using irregular graphs,” in Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC '98), pp. 249–258, Dallas, Tex, USA, May 1998. View at Publisher · View at Google Scholar
  23. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, “Design of capacity-approaching irregular low-density parity-check codes,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 619–637, 2001. View at Publisher · View at Google Scholar