Nariman Farvardin

Learn More
An embedded source code allows the decoder to reconstruct the source progressively from the preexes of a single bit stream. It is desirable to design joint source-channel coding schemes which retain the capability of progressive reconstruction in the presence of channel noise or packet loss. Here, we address the problem of joint source-channel coding of(More)
Ahsfracf -We present an analysis of the zero-memory quantization of memoryless sources when the quantizer output is to be encoded and transmitted across a noisy channel. Necessary conditions for the joint optimization of the quantizer and the encoder/decoder pair are presented, and an iterative algorithm for obtaining a locally opt imum system is developed.(More)
We describe and show the results of video coding based on a three-dimensional (3-D) spatio-temporal subband decomposition. The results include a 1-Mbps coder based on a new adaptive differential pulse code modulation scheme (ADPCM) and adaptive bit allocation. This rate is useful for video storage on CD-ROM. Coding results are also shown for a 384-kbps rate(More)
We consider the problem of detecting a discrete Markov source which is transmitted across a discrete memoryless channel. Two maximum a posteriori (MAP) formulations are considered: i) a sequence MAP detection in which the objective is to determine the most probable transmitted sequence given the observed sequence and ii) an instantaneous MAP detection which(More)
We present a scheme for joint source-channel coding for transmission of sources compressed by embedded source coders over a memoryless noisy channel. We nd an exact solution to the problem of optimal channel code allocation. Then we investigate the properties of the solution which allow us to transmit the source progressively while retaining the optimality(More)