Real-time error protection of embedded codes for packet erasure and fading channels

V. Stankovic, R. Hamzaoui, Z. Xiong

Research output: Contribution to journalArticle

61 Citations (Scopus)

Abstract

Reliable real-time transmission of packetized embedded multimedia data over noisy channels requires the design of fast error control algorithms. For packet erasure channels, efficient forward error correction is obtained by using systematic Reed-Solomon (RS) codes across packets. For fading channels, state-of-the-art performance is given by a product channel code where each column code is an RS code and each row code is a concatenation of an outer cyclic redundancy check code and an inner rate-compatible punctured convolutional code. For each of these two systems, we propose a low-memory linear-time iterative improvement algorithm to compute an error protection solution. Experimental results for the two-dimensional and three-dimensional set partitioning in hierarchical trees coders showed that our algorithms provide close to optimal average peak signal-to-noise ratio performance, and that their running time is significantly lower than that of all previously proposed solutions.
LanguageEnglish
Pages1064-1072
Number of pages8
JournalIEEE Transactions on Circuits and Systems for Video Technology
Volume14
Issue number8
DOIs
Publication statusPublished - 2004

Fingerprint

Fading channels
Reed-Solomon codes
Forward error correction
Convolutional codes
Redundancy
Signal to noise ratio
Data storage equipment

Keywords

  • channel coding
  • data compression
  • multimedia communication packet radio networks
  • product codes
  • tree codes
  • circuits
  • electrical engineering

Cite this

@article{e7562d009e69473e9ecd18c09c46487f,
title = "Real-time error protection of embedded codes for packet erasure and fading channels",
abstract = "Reliable real-time transmission of packetized embedded multimedia data over noisy channels requires the design of fast error control algorithms. For packet erasure channels, efficient forward error correction is obtained by using systematic Reed-Solomon (RS) codes across packets. For fading channels, state-of-the-art performance is given by a product channel code where each column code is an RS code and each row code is a concatenation of an outer cyclic redundancy check code and an inner rate-compatible punctured convolutional code. For each of these two systems, we propose a low-memory linear-time iterative improvement algorithm to compute an error protection solution. Experimental results for the two-dimensional and three-dimensional set partitioning in hierarchical trees coders showed that our algorithms provide close to optimal average peak signal-to-noise ratio performance, and that their running time is significantly lower than that of all previously proposed solutions.",
keywords = "channel coding, data compression, multimedia communication packet radio networks, product codes, tree codes, circuits, electrical engineering",
author = "V. Stankovic and R. Hamzaoui and Z. Xiong",
year = "2004",
doi = "10.1109/TCSVT.2004.831964",
language = "English",
volume = "14",
pages = "1064--1072",
journal = "IEEE Transactions on Circuits and Systems for Video Technology",
issn = "1051-8215",
number = "8",

}

Real-time error protection of embedded codes for packet erasure and fading channels. / Stankovic, V.; Hamzaoui, R.; Xiong, Z.

In: IEEE Transactions on Circuits and Systems for Video Technology, Vol. 14, No. 8, 2004, p. 1064-1072.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Real-time error protection of embedded codes for packet erasure and fading channels

AU - Stankovic, V.

AU - Hamzaoui, R.

AU - Xiong, Z.

PY - 2004

Y1 - 2004

N2 - Reliable real-time transmission of packetized embedded multimedia data over noisy channels requires the design of fast error control algorithms. For packet erasure channels, efficient forward error correction is obtained by using systematic Reed-Solomon (RS) codes across packets. For fading channels, state-of-the-art performance is given by a product channel code where each column code is an RS code and each row code is a concatenation of an outer cyclic redundancy check code and an inner rate-compatible punctured convolutional code. For each of these two systems, we propose a low-memory linear-time iterative improvement algorithm to compute an error protection solution. Experimental results for the two-dimensional and three-dimensional set partitioning in hierarchical trees coders showed that our algorithms provide close to optimal average peak signal-to-noise ratio performance, and that their running time is significantly lower than that of all previously proposed solutions.

AB - Reliable real-time transmission of packetized embedded multimedia data over noisy channels requires the design of fast error control algorithms. For packet erasure channels, efficient forward error correction is obtained by using systematic Reed-Solomon (RS) codes across packets. For fading channels, state-of-the-art performance is given by a product channel code where each column code is an RS code and each row code is a concatenation of an outer cyclic redundancy check code and an inner rate-compatible punctured convolutional code. For each of these two systems, we propose a low-memory linear-time iterative improvement algorithm to compute an error protection solution. Experimental results for the two-dimensional and three-dimensional set partitioning in hierarchical trees coders showed that our algorithms provide close to optimal average peak signal-to-noise ratio performance, and that their running time is significantly lower than that of all previously proposed solutions.

KW - channel coding

KW - data compression

KW - multimedia communication packet radio networks

KW - product codes

KW - tree codes

KW - circuits

KW - electrical engineering

UR - http://dx.doi.org/10.1109/TCSVT.2004.831964

U2 - 10.1109/TCSVT.2004.831964

DO - 10.1109/TCSVT.2004.831964

M3 - Article

VL - 14

SP - 1064

EP - 1072

JO - IEEE Transactions on Circuits and Systems for Video Technology

T2 - IEEE Transactions on Circuits and Systems for Video Technology

JF - IEEE Transactions on Circuits and Systems for Video Technology

SN - 1051-8215

IS - 8

ER -