Fast joint source-channel coding algorithms for internet/wireless multimedia

R. Hamzaoui, V. Stankovic, Z.X. Xiong

Research output: Contribution to conferencePaper

3 Citations (Scopus)

Abstract

We consider joint source-channel coding for Internet and wireless multimedia applications. Embedded source bitstreams are protected against noise in both binary symmetric channels (BSC) and packet erasure channels. For each channel, a local search joint source-channel coding (JSCC) algorithm is proposed to search for the optimal unequal error protection (UEP) scheme. Each algorithm starts with a linear-complexity step that maximizes the number of correctly decoded source bits, followed by a quick local refinement of the resulting UEP solution to minimize the average distortion. Experiments for both binary symmetric channels and packet erasure channels with the SPIHT, JPEG2000 and 3D SPIHT coders show that our local search algorithms are near-optimal in performance, whereas they are orders of magnitude faster than the best previous solutions.
Original languageEnglish
Pages2108-2113
Number of pages6
DOIs
Publication statusPublished - May 2002
EventInternational Joint Conference on Neural Networks (IJCNN 02) - Honolulu, United States
Duration: 12 May 200217 May 2002

Conference

ConferenceInternational Joint Conference on Neural Networks (IJCNN 02)
CountryUnited States
CityHonolulu
Period12/05/0217/05/02

    Fingerprint

Keywords

  • noisy channels
  • memoryless
  • transmission
  • channel coding
  • transform coding
  • streaming media
  • source coding
  • protection
  • iterative algorithms
  • internet
  • error correction codes
  • decoding
  • code standards

Cite this

Hamzaoui, R., Stankovic, V., & Xiong, Z. X. (2002). Fast joint source-channel coding algorithms for internet/wireless multimedia. 2108-2113. Paper presented at International Joint Conference on Neural Networks (IJCNN 02) , Honolulu, United States. https://doi.org/10.1109/IJCNN.2002.1007467