Fast algorithm for rate-based optimal error protection of embedded codes

V. Stankovic, R. Hamzaoui, D. Saupe

Research output: Contribution to journalArticle

51 Citations (Scopus)

Abstract

Embedded image codes are very sensitive to channel noise because a single bit error can lead to an irreversible loss of synchronization between the encoder and the decoder. P.G. Sherwood and K. Zeger (see IEEE Signal Processing Lett., vol.4, p.191-8, 1997) introduced a powerful system that protects an embedded wavelet image code with a concatenation of a cyclic redundancy check coder for error detection and a rate-compatible punctured convolutional coder for error correction. For such systems, V. Chande and N. Farvardin (see IEEE J. Select. Areas Commun., vol.18, p.850-60, 2000) proposed an unequal error protection strategy that maximizes the expected number of correctly received source bits subject to a target transmission rate. Noting that an optimal strategy protects successive source blocks with the same channel code, we give an algorithm that accelerates the computation of the optimal strategy of Chande and Farvardin by finding an explicit formula for the number of occurrences of the same channel code. Experimental results with two competitive channel coders and a binary symmetric channel showed that the speed-up factor over the approach of Chande and Farvardin ranged from 2.82 to 44.76 for transmission rates between 0.25 and 2 bits per pixel.
LanguageEnglish
Pages1788-1795
Number of pages7
JournalIEEE Transactions on Communications
Volume51
Issue number11
DOIs
Publication statusPublished - 2003

Fingerprint

Error detection
Error correction
Redundancy
Synchronization
Signal processing
Pixels

Keywords

  • combined source-channel
  • coding
  • convolutional codes error detection codes
  • image coding
  • telecommunication channels wavelet transforms

Cite this

@article{688ad54b80454a27a74f8327c236d355,
title = "Fast algorithm for rate-based optimal error protection of embedded codes",
abstract = "Embedded image codes are very sensitive to channel noise because a single bit error can lead to an irreversible loss of synchronization between the encoder and the decoder. P.G. Sherwood and K. Zeger (see IEEE Signal Processing Lett., vol.4, p.191-8, 1997) introduced a powerful system that protects an embedded wavelet image code with a concatenation of a cyclic redundancy check coder for error detection and a rate-compatible punctured convolutional coder for error correction. For such systems, V. Chande and N. Farvardin (see IEEE J. Select. Areas Commun., vol.18, p.850-60, 2000) proposed an unequal error protection strategy that maximizes the expected number of correctly received source bits subject to a target transmission rate. Noting that an optimal strategy protects successive source blocks with the same channel code, we give an algorithm that accelerates the computation of the optimal strategy of Chande and Farvardin by finding an explicit formula for the number of occurrences of the same channel code. Experimental results with two competitive channel coders and a binary symmetric channel showed that the speed-up factor over the approach of Chande and Farvardin ranged from 2.82 to 44.76 for transmission rates between 0.25 and 2 bits per pixel.",
keywords = "combined source-channel, coding, convolutional codes error detection codes, image coding, telecommunication channels wavelet transforms",
author = "V. Stankovic and R. Hamzaoui and D. Saupe",
year = "2003",
doi = "10.1109/TCOMM.2003.819235",
language = "English",
volume = "51",
pages = "1788--1795",
journal = "IEEE Transactions on Communications",
issn = "0090-6778",
number = "11",

}

Fast algorithm for rate-based optimal error protection of embedded codes. / Stankovic, V.; Hamzaoui, R.; Saupe, D.

In: IEEE Transactions on Communications, Vol. 51, No. 11, 2003, p. 1788-1795.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Fast algorithm for rate-based optimal error protection of embedded codes

AU - Stankovic, V.

AU - Hamzaoui, R.

AU - Saupe, D.

PY - 2003

Y1 - 2003

N2 - Embedded image codes are very sensitive to channel noise because a single bit error can lead to an irreversible loss of synchronization between the encoder and the decoder. P.G. Sherwood and K. Zeger (see IEEE Signal Processing Lett., vol.4, p.191-8, 1997) introduced a powerful system that protects an embedded wavelet image code with a concatenation of a cyclic redundancy check coder for error detection and a rate-compatible punctured convolutional coder for error correction. For such systems, V. Chande and N. Farvardin (see IEEE J. Select. Areas Commun., vol.18, p.850-60, 2000) proposed an unequal error protection strategy that maximizes the expected number of correctly received source bits subject to a target transmission rate. Noting that an optimal strategy protects successive source blocks with the same channel code, we give an algorithm that accelerates the computation of the optimal strategy of Chande and Farvardin by finding an explicit formula for the number of occurrences of the same channel code. Experimental results with two competitive channel coders and a binary symmetric channel showed that the speed-up factor over the approach of Chande and Farvardin ranged from 2.82 to 44.76 for transmission rates between 0.25 and 2 bits per pixel.

AB - Embedded image codes are very sensitive to channel noise because a single bit error can lead to an irreversible loss of synchronization between the encoder and the decoder. P.G. Sherwood and K. Zeger (see IEEE Signal Processing Lett., vol.4, p.191-8, 1997) introduced a powerful system that protects an embedded wavelet image code with a concatenation of a cyclic redundancy check coder for error detection and a rate-compatible punctured convolutional coder for error correction. For such systems, V. Chande and N. Farvardin (see IEEE J. Select. Areas Commun., vol.18, p.850-60, 2000) proposed an unequal error protection strategy that maximizes the expected number of correctly received source bits subject to a target transmission rate. Noting that an optimal strategy protects successive source blocks with the same channel code, we give an algorithm that accelerates the computation of the optimal strategy of Chande and Farvardin by finding an explicit formula for the number of occurrences of the same channel code. Experimental results with two competitive channel coders and a binary symmetric channel showed that the speed-up factor over the approach of Chande and Farvardin ranged from 2.82 to 44.76 for transmission rates between 0.25 and 2 bits per pixel.

KW - combined source-channel

KW - coding

KW - convolutional codes error detection codes

KW - image coding

KW - telecommunication channels wavelet transforms

UR - http://dx.doi.org/10.1109/TCOMM.2003.819235

U2 - 10.1109/TCOMM.2003.819235

DO - 10.1109/TCOMM.2003.819235

M3 - Article

VL - 51

SP - 1788

EP - 1795

JO - IEEE Transactions on Communications

T2 - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 11

ER -