نتایج جستجو برای: joint source and channel coding

تعداد نتایج: 16942289  

2012
Hu Chen

This thesis addresses the problem of Bayer-pattern video communications using Wyner-Ziv video coding (WZVC). It is studied how to take advantage of the low encoding complexity and the inherent error resiliency of WZVC for video compression and transmission. Moreover, it is investigated how to optimize the coding process specifically for Bayer-pattern video in order to improve the coding efficie...

2016
Zhenyu Wu Ali Bilgin Michael W. Marcellin

A practical joint source/channel coding algorithm is proposed for the transmission of multiple images and videos to reduce the overall reconstructed source distortion at the receiver within a given total bit rate. It is demonstrated that by joint coding of multiple sources with such an objective, both improved distortion performance as well as reduced quality variation can be achieved at the sa...

2008
Y. Zhong F. Alajaji Yangfan Zhong Fady Alajaji L. Lorne Campbell

We investigate the joint source-channel coding (JSCC) excess distortion exponent EJ (the exponent of the probability of exceeding a prescribed distortion level) for memoryless communication systems with continuous alphabets. We first establish upper and lower bounds for EJ for systems consisting of a memoryless Gaussian source under the squared-error distortion fidelity criterion and a memoryle...

2006
Sergio Verdú

This plenary talk gives an overview of recent joint work with G. Caire and S. Shamai on the use of linear error correcting codes for lossless data compression, joint source/channel coding and interactive data exchange.

2009
Zhenyu Wu Ali Bilgin Michael W. Marcellin

In [1], a practical joint source/channel coding algorithm was proposed for the transmission of multiple images to reduce the overall reconstructed source distortion at the receiver end within a given total bit rate. In this paper, it is demonstrated that by joint coding multiple sources with such an objective, both improved distortion performance as well as reduced quality variation can be achi...

2001
Raouf Hamzaoui Vladimir Stankovic Zixiang Xiong

We consider joint source-channel coding for Internet and wireless multimedia applications. Embedded source bitstreams are protected against noise in both binary symmetrie channels (BSC) and packet erasure channels. For each channel, a local search joint source-channel coding (JSCC) algorithm is proposed to search for the optimal unequal error protection (UEP) scheme. Each algorithm starts with ...

Journal: :IEEE transactions on image processing : a publication of the IEEE Signal Processing Society 1998
Philippe Burlina Fady Alajaji

This correspondence addresses the use of a joint source-channel coding strategy for enhancing the error resilience of images transmitted over a binary channel with additive Markov noise. In this scheme, inherent or residual (after source coding) image redundancy is exploited at the receiver via a maximum a posteriori (MAP) channel detector. This detector, which is optimal in terms of minimizing...

2003
Jörg Kliewer

In this paper, we propose a joint source-channel decoding approach for the robust image transmission over wireless channels. In addition to the explicit redundancy coming from channel codes, we also use implicit residual source redundancy for error protection. The source redundancy is modeled by a Markov random field (MRF) source model, which considers the residual spatial correlation after sou...

2000
M. Sandler

Current popular Internet audio streaming solutions impose a division between source coding (provided, for example, by MPEG layer III) and channel coding, typically accomplished in the server by means of packet re-transmission. A novel joint source and channel coder that provides packet-loss recovery and continuous bitrate scalability is presented. These functionalities are well suited to stream...

2002
Angelos D. Liveris Zixiang Xiong Costas N. Georghiades

We use systematic irregular repeat accumulate (IRA) codes as source-channel codes for the transmission of an equiprobable memoryless binary source with side information at the decoder. A special case of this problem is joint source-channel coding for a nonequiprobable memoryless binary source. The theoretical limits of this problem are given by combining the Slepian-Wolf theorem, the source ent...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید