Robust image transmission over energy-constrained time-varying channels using multiresolution joint source-channel coding

Abstract

We explore joint source-channel coding (JSCC) for time-varying channels using a multiresolution framework for both source coding and transmission via novel multiresolution modulation constellations. We consider the problem of still image transmission over time-varying channels with the channel state information (CSI) available at 1) receiver only and 2) both transmitter and receiver being informed about the state of the channel, and we quantify the effect of CSI availability on the performance. Our source model is based on the wavelet image decomposition, which generates a collection of subbands modeled by the family of generalized Gaussian distributions. We describe an algorithm that jointly optimizes the design of the multiresolution source codebook, the multiresolution constellation, and the decoding strategy of optimally matching the source resolution and signal constellation resolution "trees" in accordance with the time-varying channel and show how this leads to improved performance over existing methods. The realtime operation needs only table lookups. Our results based on a wavelet image representation show that our multiresolutionbased optimized system attains gains on the order of 2 dB in the reconstructed image quality over single-resolution systems using channel optimized source coding.

A Two Tier QoS Provisioning Scheme for Satellite based Multimedia Communication

“…Where as, with uniform mapping, errors may occur with equal probability for all coefficients. The probability of error for HR constellation under the influence of channel SNR is given as [7 & 8] (2) K is the error coefficient which is determined by the average number of signals at the minimum distance. Q(.)…”

Efficient Source Decoding Over Memoryless Noisy Channels Using Higher Order Markov Models

“…The states now form a firstorder Markov sequence. Using this property and the memoryless assumption of the channel (see (1)- (3)), in line with the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm [47], the probability of a particular state given the observed sequence is given by the following forward recursive equation: (10) where the summation is over a subset of states in time step , that are connected to the state . Throughout the paper, we use the notation as a factor normalizing the sum of probabilities to one.…”

“…We note that in each time step, the forward recursion of (10) proceeds one step forward through the trellis while the backward term is recomputed over the entire backward window as indicated in (12) and (13). 2 Now, using the presented trellis structure and the forward equation (10), the probabilities required for the asymptotically 2 It is noteworthy that the forward-backward algorithm [47] has been used in different forms and applications such as channel decoding and the decoding in hidden Markov models. In another work [38], similar developments are related to the prediction and filtering within the context of Kalman filtering.…”

“…A related classical work is the work of Sundberg [8] in which he analyzed the effect of error in different bits on the reconstruction of a pulse-code modulation (PCM) coded signal. Examples of more recent applications of UEP is present in [9] and [10].…”

Unequal error protection for radiography image transmission using protograph double LDPC codes

“…The source coding and channel coding are designed separately in [2]- [4], while [5]- [9] are focused on joint source-channel coding (JSCC) design [10], which is just the scheme mainly investigated in this paper because the JSCC scheme has greater performance and more improvement on the overall efficiency than the separate design.…”