Results 201 to 210 of about 12,453 (251)
Some of the next articles are maybe not open access.
Joint Source Channel Anytime Coding
GLOBECOM 2020 - 2020 IEEE Global Communications Conference, 2020Joint source channel coding (JSCC) is an effective technique in the non-asymptotic and low latency regime, while suffers from high error floor for sequences with high source probabilities and short block-lengths (HSP-SB). Aiming to address this issue, a joint source channel anytime coding (JSCAC) based on the anytime spatially coupled repeat-accumulate
Li Deng +5 more
openaire +1 more source
Joint Source and Channel Coding
IEEE Signal Processing Magazine, 2010The objectives of this article are two-fold: First, to present the problem of joint source and channel (JSC) coding from a graphical model perspective and second, to propose a structure that uses a new graphical model for jointly encoding and decoding a redundant source.
Maria Fresia +3 more
openaire +1 more source
Joint Source-Channel Coding Using Variable-Length Codes
Problems of Information Transmission, 2001The 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 for Multiple Images
IEEE Transactions on Communications, 2005A 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 +2 more
openaire +1 more source
Joint source-channel coding via hybrid coding
2011 IEEE International Symposium on Information Theory Proceedings, 2011A 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 +2 more
openaire +1 more source
Joint Source Channel Coding Using LDPC Codes
2012 Fourth International Conference on Computational Intelligence and Communication Networks, 2012A 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, 2001Summary: 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. +2 more
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.
Adria Tauste Campo +3 more
openaire +1 more source
Robust joint source-channel coding theory
Proceedings of IEEE International Symposium on Information Theory, 2002We 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., 2004In 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