Results 261 to 270 of about 15,313 (301)
Some of the next articles are maybe not open access.
Progressive joint source-channel coding in feedback channels
Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096), 1999It is well known that Shannon's separation result does not hold under finite computation or finite delay constraints, thus joint source-channel coding is of great interest for practical reasons. For progressive source-channel coding systems, efficient codes have been proposed for feedforward channels and the important problem of rate allocation between
Jin Lu 0004 +2 more
openaire +1 more source
Joint source-channel subband coding of images
1997 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2002This paper proposes a new adaptive source-channel coding scheme in the context of subband coding. We first express the total mean-squared distortion suffered by the source in terms of source and channel distortions of the subbands. We then minimize this total distortion by an appropriate choice of source and channel coding rates for the subbands.
Murari Srinivasan, Rama Chellappa
openaire +1 more source
Scalable Joint Source and Channel Coding of Meshes
IEEE Transactions on Multimedia, 2008This paper proposes a new approach for joint source and channel coding (JSCC) of meshes, simultaneously providing scalability and optimized resilience against transmission errors. An unequal error protection approach is followed, to cope with the different error-sensitivity levels characterizing the various resolution and quality layers produced by the
Dan C. Cernea +4 more
openaire +2 more sources
Joint source-channel iterative decoding of codes
2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 2004In this paper an innovative joint source channel coding scheme is presented. The system is based on iterative soft decoding of arithmetic codes, by means of a novel soft-in soft-out decoder based on suboptimal search and pruning of a binary tree. An error resilient arithmetic coder with a forbidden symbol is used in order to improve the performance of ...
Marco Grangetto +2 more
openaire +1 more source
Sparse approximations for joint source-channel coding
2008 IEEE 10th Workshop on Multimedia Signal Processing, 2008This 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 +2 more
openaire +1 more source
Joint source-channel coding for cribbing models
2012 IEEE International Symposium on Information Theory Proceedings, 2012In 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, 2013This 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, 2000Summary: 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, 2011Random-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 +3 more
openaire +1 more source
Joint source-channel LZ'77 coding
Data Compression Conference, 2003. Proceedings. DCC 2003, 2003Limited 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