By Topic

Tree-structured oversampled filterbanks as joint source-channel codes: application to image transmission over erasure channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Motwani, R. ; Data Storage Inst., Singapore ; Guillemot, C.

This paper studies oversampled filterbanks for robust transmission of multimedia signals over erasure channels. Oversampled filterbanks implement frame expansions of signals in l2(Z). The dependencies between the expansion coefficients introduced by the oversampled filterbank are first characterized both in the z-domain and in the time-domain. Conditions for recovery of some typical erasure patterns like bursty erasure patterns are derived. The analysis leads to the design of two erasure recovery algorithms that are first studied without quantization noise. The reconstruction algorithm derived from the time-domain analysis exploits the fact that an oversampled filterbank represents signals with more than one set of basis functions. The erased samples are first reconstructed from the received ones, and then, signal space projection is applied. The effect of quantization noise on the reconstructed signal is studied for both algorithms. Using image signals, the theoretical results are validated for a number of erasure patterns, considering unequal error protection enabled tree-structured decompositions.

Published in:

Signal Processing, IEEE Transactions on  (Volume:52 ,  Issue: 9 )