This work present a joint source-channel technique based on Channel Optimized Vector Quantization (COVQ) for transmission over bursty channels applied to LSP parameters coding. The bursty channel is modeled as a Finite State Channel (FSC) with two states. We call Bursty COVQ (BCOVQ) to the resulting quantization technique. The case in which channel state information is only available at the rec...

An example of arithmetic coding : The source symbols are a, b, c with p(a) = 0.011, p(b) = 0.011, p(c) = 0. Wavelet coefficients of test images. Subbands are independently scaled. Most energy is concentrated in the low frequency (upper-left) subbands and a few coefficients in other subbands (in the locations of edges).. 2.6 (a)-A factor graph for a [6, 3, 3] binary code C. Function nodes are dr...

Analog joint source-channel coding (JSCC) is a communication strategy that does not follow the separation principle of conventional digital systems but has been shown to approach the optimal distortion-cost tradeoff over additive white Gaussian noise channels. In this work, we investigate the feasibility of analog JSCC over multiple-input multiple-output (MIMO) fading channels. Since, due to co...

It is well known that Shannon's separation result does not hold under nite computation or nite delay constraints, thus joint source-channel coding is of great interest for practical reasons. For progressive source-channel coding systems, eecient codes have been proposed for feed forward channels 1] and the important problem of rate allocation between the source and channel codes has been solved...

We propose an efficient bit allocation algorithm for a joint source/channel video codec over noisy channels. The approach is to distribute the available source and channel coding bits among the subbands in such a way that the expected distortion is minimized. The constructed distortion curves bound the performance degradation should the channel be estimated incorrectly. The algorithm can be use...

In this work, we study the problem of lossy joint source-channel coding in an energy harvesting single-user communication system with causal energy arrivals, where the energy storage unit may have leakage. In particular, we investigate the achievable distortion in the transmission of a single source with arbitrary alphabets via an energy harvesting transmitter over a point-to-point channel. We ...

Given a general source V = fV gn=1 with countably in nite source alphabet and a general channel W = fW ng1 n=1 with arbitrary abstract channel input and output alphabets, we study the joint source-channel coding problem from the information-spectrum point of view. First, we generalize Feinstein's lemma (direct part) and Verd u-Han's lemma (converse part) so as to be applicable to the general jo...

We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error correction capability. The performance of this system may be measured by the expected distortion or by the expected number of correctly received source bits subject to a target total transmission rate. Whereas a rate-bas...

A novel Joint Source Channel Scheme for the two user Gaussian Broadcast channel is developed here. The scheme transmits a Bivariate Gaussian Source over a Discrete Memoryless Additive White Gaussian Noise Channel. The scheme belongs to the family of codes termed Nested Quantization. The ultimate theoretical communication limits of the Gaussian Broadcast channel are given and the different codin...