Results 241 to 250 of about 6,423,663 (281)
Some of the next articles are maybe not open access.
Joint source/channel coding for variable length codes
IEEE Transactions on Communications, 2000Summary: When using entropy coding over a noisy channel, it is customary to protect the highly vulnerable bitstream with an error-correcting code. In this paper, we propose a technique which utilizes the residual redundancy at the output of the source coder to provide error protection for entropy coded systems.
Khalid Sayood, Hasan H. Otu, Nejat Demir
openaire +1 more source
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
Efficient LDPC codes for joint source-channel coding
Proceedings of the 2004 11th IEEE International Conference on Electronics, Circuits and Systems, 2004. ICECS 2004., 2005In this paper, the belief propagation (BP) decoding of LDPC codes is extended to the case of joint source-channel coding. The uncompressed source is treated as a Markov process, characterized by a transition matrix, T, which is utilized as side information for the joint scheme.
Haggai Kfir, Ido Kanter
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 +2 more sources
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 +2 more sources
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
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
Distributed joint source-channel coding of video
IEEE International Conference on Image Processing 2005, 2005Based 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 +3 more
openaire +2 more sources