Rate-based versus distortion-based optimal joint source-channel coding

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

Research output: Contribution to conferencePaper

40 Citations (Scopus)

Abstract

We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error correction capability. The performance of this system may be measured by the expected distortion or by the expected number of correctly received source bits subject to a target total transmission rate. Whereas a rate-based optimal solution can be found in linear time, the computation of a distortion-based optimal solution is prohibitive. Under the assumption of the convexity of the operational distortion-rate function of the source coder, we give a lower bound on the expected distortion of a distortion-based optimal solution that depends only on a rate-based optimal solution. Then we show that a distortion-based optimal solution provides a stronger error protection than a rate-based optimal solution and exploit this result to reduce the time complexity of the distortion-based optimization. Finally, we propose a fast iterative improvement algorithm that starts from a rate-based optimal solution and converges to a local minimum of the expected distortion. Experimental results for a binary symmetric channel with the SPIHT coder and JPEG 2000 show that our lower bound is close to optimal. Moreover, the solution given by our local search algorithm has about the same quality as a distortion-based optimal solution, whereas its complexity is much lower than that of the previous best solution.
Original languageEnglish
Pages63-72
Number of pages10
DOIs
Publication statusPublished - Apr 2002
EventData Compression Conference (DCC 2002) - Snowbird, United States
Duration: 2 Apr 20024 Apr 2002

Conference

ConferenceData Compression Conference (DCC 2002)
CountryUnited States
CitySnowbird
Period2/04/024/04/02

Fingerprint

Channel coding
Error detection
Error correction

Keywords

  • progressive transmission
  • noisy channels
  • rate-based
  • distortion-based
  • optimal joint
  • source-channel coding

Cite this

Hamzaoui, R., Stankovic, V., & Xiong, Z. X. (2002). Rate-based versus distortion-based optimal joint source-channel coding. 63-72. Paper presented at Data Compression Conference (DCC 2002) , Snowbird, United States. https://doi.org/10.1109/DCC.2002.999944
Hamzaoui, R. ; Stankovic, V. ; Xiong, Z.X. / Rate-based versus distortion-based optimal joint source-channel coding. Paper presented at Data Compression Conference (DCC 2002) , Snowbird, United States.10 p.
@conference{369e444d1d834b238b4c3f1109ea2158,
title = "Rate-based versus distortion-based optimal joint source-channel coding",
abstract = "We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error correction capability. The performance of this system may be measured by the expected distortion or by the expected number of correctly received source bits subject to a target total transmission rate. Whereas a rate-based optimal solution can be found in linear time, the computation of a distortion-based optimal solution is prohibitive. Under the assumption of the convexity of the operational distortion-rate function of the source coder, we give a lower bound on the expected distortion of a distortion-based optimal solution that depends only on a rate-based optimal solution. Then we show that a distortion-based optimal solution provides a stronger error protection than a rate-based optimal solution and exploit this result to reduce the time complexity of the distortion-based optimization. Finally, we propose a fast iterative improvement algorithm that starts from a rate-based optimal solution and converges to a local minimum of the expected distortion. Experimental results for a binary symmetric channel with the SPIHT coder and JPEG 2000 show that our lower bound is close to optimal. Moreover, the solution given by our local search algorithm has about the same quality as a distortion-based optimal solution, whereas its complexity is much lower than that of the previous best solution.",
keywords = "progressive transmission, noisy channels, rate-based, distortion-based, optimal joint , source-channel coding",
author = "R. Hamzaoui and V. Stankovic and Z.X. Xiong",
year = "2002",
month = "4",
doi = "10.1109/DCC.2002.999944",
language = "English",
pages = "63--72",
note = "Data Compression Conference (DCC 2002) ; Conference date: 02-04-2002 Through 04-04-2002",

}

Hamzaoui, R, Stankovic, V & Xiong, ZX 2002, 'Rate-based versus distortion-based optimal joint source-channel coding' Paper presented at Data Compression Conference (DCC 2002) , Snowbird, United States, 2/04/02 - 4/04/02, pp. 63-72. https://doi.org/10.1109/DCC.2002.999944

Rate-based versus distortion-based optimal joint source-channel coding. / Hamzaoui, R.; Stankovic, V.; Xiong, Z.X.

2002. 63-72 Paper presented at Data Compression Conference (DCC 2002) , Snowbird, United States.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Rate-based versus distortion-based optimal joint source-channel coding

AU - Hamzaoui, R.

AU - Stankovic, V.

AU - Xiong, Z.X.

PY - 2002/4

Y1 - 2002/4

N2 - We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error correction capability. The performance of this system may be measured by the expected distortion or by the expected number of correctly received source bits subject to a target total transmission rate. Whereas a rate-based optimal solution can be found in linear time, the computation of a distortion-based optimal solution is prohibitive. Under the assumption of the convexity of the operational distortion-rate function of the source coder, we give a lower bound on the expected distortion of a distortion-based optimal solution that depends only on a rate-based optimal solution. Then we show that a distortion-based optimal solution provides a stronger error protection than a rate-based optimal solution and exploit this result to reduce the time complexity of the distortion-based optimization. Finally, we propose a fast iterative improvement algorithm that starts from a rate-based optimal solution and converges to a local minimum of the expected distortion. Experimental results for a binary symmetric channel with the SPIHT coder and JPEG 2000 show that our lower bound is close to optimal. Moreover, the solution given by our local search algorithm has about the same quality as a distortion-based optimal solution, whereas its complexity is much lower than that of the previous best solution.

AB - We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error correction capability. The performance of this system may be measured by the expected distortion or by the expected number of correctly received source bits subject to a target total transmission rate. Whereas a rate-based optimal solution can be found in linear time, the computation of a distortion-based optimal solution is prohibitive. Under the assumption of the convexity of the operational distortion-rate function of the source coder, we give a lower bound on the expected distortion of a distortion-based optimal solution that depends only on a rate-based optimal solution. Then we show that a distortion-based optimal solution provides a stronger error protection than a rate-based optimal solution and exploit this result to reduce the time complexity of the distortion-based optimization. Finally, we propose a fast iterative improvement algorithm that starts from a rate-based optimal solution and converges to a local minimum of the expected distortion. Experimental results for a binary symmetric channel with the SPIHT coder and JPEG 2000 show that our lower bound is close to optimal. Moreover, the solution given by our local search algorithm has about the same quality as a distortion-based optimal solution, whereas its complexity is much lower than that of the previous best solution.

KW - progressive transmission

KW - noisy channels

KW - rate-based

KW - distortion-based

KW - optimal joint

KW - source-channel coding

U2 - 10.1109/DCC.2002.999944

DO - 10.1109/DCC.2002.999944

M3 - Paper

SP - 63

EP - 72

ER -

Hamzaoui R, Stankovic V, Xiong ZX. Rate-based versus distortion-based optimal joint source-channel coding. 2002. Paper presented at Data Compression Conference (DCC 2002) , Snowbird, United States. https://doi.org/10.1109/DCC.2002.999944