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

Hamzaoui, R. and Stankovic, V. and Xiong, Z.X. (2002) Fast joint source-channel coding algorithms for internet/wireless multimedia. In: International Joint Conference on Neural Networks (IJCNN 02), 2002-05-12 - 2002-05-17. (https://doi.org/10.1109/IJCNN.2002.1007467)

Full text not available in this repository.Request a copy

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.

ORCID iDs

Hamzaoui, R., Stankovic, V. ORCID logoORCID: https://orcid.org/0000-0002-1075-2420 and Xiong, Z.X.;
CORE (COnnecting REpositories)