Results 211 to 220 of about 13,186 (254)

Sparse approximations for joint source-channel coding

2008 IEEE 10th Workshop on Multimedia Signal Processing, 2008
This paper considers the application of sparse approximations in a joint source-channel (JSC) coding framework. The considered JSC coded system employs a real number BCH code on the input signal before the signal is quantized and further processed. Under an impulse channel noise model, the decoding of error is posed as a sparse approximation problem ...
Gagan Rath, Christine Guillemot, Jean-Jacques Fuchs   +2 more
openaire   +1 more source

Joint source-channel coding for cribbing models

2012 IEEE International Symposium on Information Theory Proceedings, 2012
In this work we study problems of joint source-channel coding for the multiple access channel with cribbing encoders. These problems are motivated by modern communication scenarios such as an uplink channel for cellular users. Provided that the users are close enough to each other, they can causally crib to the output signals of their neighbours, thus ...
Eliron Amir, Yossef Steinberg
openaire   +1 more source

Dynamic joint source-Channel coding with feedback

2013 IEEE International Symposium on Information Theory, 2013
This paper considers real time joint source-channel coding of a Markov source over a discrete memoryless channel with noiseless feedback. The encoder incurs a cost which is minimized along with a real-time end-to-end distortion. The problem is mapped to a partially observable Markov decision problem and the corresponding optimality equations, in the ...
Tara Javidi, Andrea Goldsmith
openaire   +1 more source

Duality theorems for joint source-channel coding

IEEE Transactions on Information Theory, 2000
Summary: We consider joint source-channel coding for a memoryless Gaussian source and an additive white Gaussian noise channel. For a given code defined by an encoder-decoder pair \((\alpha,\beta)\), its dual code is obtained by interchanging the encoder and decoder: \((\beta,\alpha)\). It is shown that if a code \((\alpha,\beta)\) is optimal at rate \(
Udar Mittal, Nam Phamdo
openaire   +2 more sources

Random-coding joint source-channel bounds

2011 IEEE International Symposium on Information Theory Proceedings, 2011
Random-coding exact characterizations and bounds to the error probability of joint source-channel coding are presented. In particular, upper bounds using maximum-a-posteriori and threshold decoding are derived as well as a lower bound motivated by Verdu-Han's lemma.
Adrià Tauste Campo, Gonzalo Vazquez-Vilar, Albert Guillen i Fabregas, Alfonso Martinez   +3 more
openaire   +1 more source

Joint source-channel LZ'77 coding

Data Compression Conference, 2003. Proceedings. DCC 2003, 2003
Limited memory and bounded communication resources require powerful data compression techniques, but at the same time noisy tetherless channels and/or corrupted file systems need error correction capabilities. Joint source-channel coding has emerged as a viable solution to this problem.
Stefano Lonardi, Wojciech Szpankowski
openaire   +1 more source

Distributed joint source-channel coding of video

IEEE International Conference on Image Processing 2005, 2005
Based on recent works on source-channel coding for Wyner-Ziv coding, we consider the case with noisy channel in Wyner-Ziv coding and address distributed joint source-channel coding, while targeting at the important application of video transmission over packet erasure channels.
Qian Xu 0001, Vladimir Stankovic 0001, Angelos D. Liveris, Zixiang Xiong   +3 more
openaire   +1 more source

Joint Source-Channel Coding Using Variable-Length Codes

Problems of Information Transmission, 2001
The paper presents a decoding algorithm for joint source-channel coding when variable-length codes are used for information transmission over a discrete memoryless channel. The asymptotic lower bound on the exponent of the decoding error probability for variable-length codes has been established.
openaire   +3 more sources

Zero-delay joint source-channel coding

2014 Iran Workshop on Communication and Information Theory (IWCIT), 2014
In zero-delay joint source-channel coding each source sample is mapped to a channel input, and the samples are directly estimated at the receiver based on the corresponding channel output. Despite its simplicity, uncoded transmission achieves the optimal end-to-end distortion performance in some communication scenarios, significantly simplifying the ...
I. E. Aguerri, M. Varasteh, D. Gunduz
openaire   +1 more source

A strong converse for joint source-channel coding

2012 IEEE International Symposium on Information Theory Proceedings, 2012
We consider a discrete memoryless joint source-channel setting. In this setting, if a source sequence is reconstructed with distortion below some threshold, we declare a success event. We prove that for any joint source-channel scheme, if this threshold lower (better) than the optimum average distortion, then the success probability approaches zero as ...
Da Wang, Amir Ingber, Yuval Kochman
openaire   +1 more source