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

Authors:
V. M. Stankovic;R. Hamzaoui;Zixiang Xiong
Affiliations:
Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA;-;-
Venue:
IEEE Transactions on Circuits and Systems for Video Technology
Year:
2004

Citing 0
Cited 8

Opportunistic decoding of unequal erasure protected partially-decodable scalable source

Proceedings of the 4th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Error protection and interleaving for wireless transmission of JPEG 2000 images and video

IEEE Transactions on Image Processing
Optimal switching for smart and robust JPEG 2000 images and video transmission over wireless networks

SoftCOM'09 Proceedings of the 17th international conference on Software, Telecommunications and Computer Networks
Improved joint source-channel decoding of JPEG2000 images and Reed-Solomon codes

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Distortion optimal transmission of multi-layered FGS video over wireless channels

IEEE Journal on Selected Areas in Communications
Joint decoding of unequally protected JPEG2000 bitstreams and reed-Solomon codes

IEEE Transactions on Image Processing - Special section on distributed camera networks: sensing, processing, communication, and implementation
A framework for error protection of region of interest coded images and videos

Image Communication
Rate-distortion optimized unequal loss protection for video transmission over packet erasure channels

Image Communication

Quantified Score

Hi-index	0.00

Visualization

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.