Results 201 to 210 of about 13,186 (254)

Joint Source Channel Anytime Coding

GLOBECOM 2020 - 2020 IEEE Global Communications Conference, 2020
Joint 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 0004, Yixin Wang 0005, Xiaoxi Yu, Md. Noor-A-Rahim, Yong Liang Guan 0001, Zhiping Shi 0001   +5 more
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 ...
Yossef Steinberg, Neri Merhav
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
Billy D. Pettijohn, Michael W. Hoffman, Khalid Sayood   +2 more
openaire   +2 more sources

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
Zhenyu Wu 0005, Ali Bilgin, Michael W. Marcellin   +2 more
openaire   +1 more source

Joint source/channel coding for variable length codes

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225), 2002
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.
Nejat Demir, Khalid Sayood
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 0001   +2 more
openaire   +1 more source

Joint source/channel coding for variable length codes

IEEE Transactions on Communications, 2000
Summary: 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

Efficient LDPC codes for joint source-channel coding

Proceedings of the 2004 11th IEEE International Conference on Electronics, Circuits and Systems, 2004. ICECS 2004., 2005
In 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

Joint source-channel subband coding of images

1997 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2002
This 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

Joint source-channel iterative decoding of codes

2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 2004
In 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, Bartolo Scanavino, Gabriella Olmo   +2 more
openaire   +1 more source