Results 221 to 230 of about 160,109 (272)

Joint Source/Channel Coding for Multiple Images

IEEE Transactions on Communications, 2005
A joint source/channel coding algorithm is proposed for the transmission of multiple image sources over memoryless channels. The proposed algorithm uses a quality scalable image coder to allocate a limited bit budget optimally among all the sources to achieve the optimal overall distortion reduction for the multiple reconstructed images. In addition to
null Zhenyu Wu, A. Bilgin, M.W. Marcellin   +2 more
openaire   +1 more source

Joint source-channel coding via hybrid coding

2011 IEEE International Symposium on Information Theory Proceedings, 2011
A new analog-digital hybrid coding architecture for joint source-channel coding is proposed. The encoder generates a channel input by a symbol-by-symbol mapping of the observed (analog) source and its (digital) compression codeword, while the decoder reconstructs the source by a symbol-by-symbol mapping of the (analog) channel output and the decoded ...
Paolo Minero, Sung Hoon Lim, Young-Han Kim   +2 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

Joint Source Channel Coding Using LDPC Codes

2012 Fourth International Conference on Computational Intelligence and Communication Networks, 2012
A novel method of combined source-channel coding using LDPC codes is presented in this paper. The system presented is designed to transmit a discrete time, continuous amplitude signal over an Additive White Gaussian Noise (AWGN) channel where a Low Density Parity Check (LDPC) code is used for error correction purposes.
S. Nandan, P.P. Deepthi
openaire   +1 more source

Joint source/channel coding using arithmetic codes

Proceedings DCC 2000. Data Compression Conference, 2001
Summary: Reserving space for a symbol that is not in the source alphabet has been shown to provide excellent error detection. In this paper, we show how to exploit this capability using two sequential decoder structures to provide powerful error correction capability. This joint source/channel coder design provides significant packet loss recovery with
Pettijohn, Billy D., Hoffman, Michael W., Sayood, Khalid   +2 more
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.
Adria Tauste Campo, Gonzalo Vazquez-Vilar, Albert Guillen i Fabregas, Alfonso Martinez   +3 more
openaire   +1 more source

Robust joint source-channel coding theory

Proceedings of IEEE International Symposium on Information Theory, 2002
We consider joint source-channel coding for a memoryless Gaussian source and an additive white Gaussian noise (AWGN) channel. A code is said to be robust if its performance is arbitrarily close to the theoretical limit for a wide range of channel noise conditions. The existence of robust codes depends on the ratio of the channel bandwidth to the source
U. Mittal, N. Phamdo
openaire   +1 more source

On hierarchical joint source-channel coding

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004
In this paper, we extend the setting of source coding with successive refinement into a joint source-channel coding setting: two descriptions of a memoryless source are to be transmitted across two independent memoryless channels. The output of the channel corresponding to the first (coarse) description is also available to the decoder of the second ...
Y. Steinberg, N. Merhav
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.
S. Lonardi, W. Szpankowski
openaire   +1 more source

Image/video communications: joint source/channel coding

International Journal of Communication Systems, 1999
Transmission of image/video messages over communication networks is becoming a standard way of communication due to very efficient compression algorithms that reduce required channel capacity to an acceptable level. However, all compression standard techniques are strongly sensitivitive to channel disturbances and their application is suitable only for
openaire   +2 more sources