We investigate joint source-channel coding for transmission of video over time-varying channels. We assume that the channel state is known at the receiver, but only statistical description of the time varying nature of the channel is available at the transmitter. A multimode coder is proposed to e ciently quantize the input video, and generate a quasi xed-length bit stream of unequal importance...

Arithmetic Coding is generalized to provide a method for transforming source output se quences into sequences whose probability distribution approaches any desired probability distribution. A further modi cation in which gaps are introduced be tween source intervals allows arithmetic encoders to produce code sequences with any information rate, enabling the encoder to perform joint source-cha...

Introduction: Joint source-channel coding (JSCC) approaches have recently emerged as a good alternative to the strict application of Shannon’s source-channel separation principle for delay-constrained transmission scenarios. A subset of these techniques is given by joint source-channel decoding, where residual source redundancy increases the error-correction capability of the decoder [1, 2]. Es...

We investigate the problem of transmiting independent sources over the Gaussian Multiple Access Channel (MAC) using a CDMA-like access scheme that allows users to transmit at different rates. Rather than using standard digital communications systems, we focus on analog joint source-channel coding techniques to encode each user’s source. We analyze the performance of the proposed scheme and demo...

The FlexCode project is a joint research project of KTH Stockholm, RWTH Aachen University, Ericsson AB, Nokia Siemens Networks, and Orange/France Telecom under the umbrella of the sixth framework programme of the European Commission (http://www.flexcode.eu). In this paper we present the channel coding approach used in the FlexCode project. Furthermore, a brief introduction to the channel model ...

In this paper we review concepts and methods of communication systems equipped with side information. We focus on the channel coding problem, where side information is available to the transmitter in either a causal or non-causal manner, and we also consider the source coding problem with side information at the receiver. We first summarize the main results for channels with causal/noncausal si...

Given a general source V = {V n } ∞ n=1 with countably infinite source alphabet and a general channel W = {W n } ∞ n=1 with arbitrary abstract channel input/channel output alphabets, we study the joint source-channel coding problem from the information-spectrum point of view. First, we generalize Feinstein's lemma (direct part) and Verdú-Han's lemma (converse part) so as to be applicable to the...

Coded speech transmission over noisy channels can be interpreted as a delayconstrained encoding/decoding problem for a set of continuous-amplitude signals; the latter are the parameters extracted from the actual speech signal by advanced source coding schemes. The optimization problem for the encoder/decoder-design is formulated and it is shown, that its direct solution is intractable in most r...

The research described in this publication was carried out in part at the Jet Propulsion Laboratory, California Institute of Technology, under a contract with the National Aeronautics and Space Administration. The work by the University of Southern California and JPL was funded through the NASA/JPL Director’s Research and Development Fund (DRDF) and the Strategic University Research Partnership...

This work is devoted to practical joint source channel coding. Although the proposed approach has more general scope, for the sake of clarity we focus on a specific application example, namely, the transmission of digital images over noisy binary-input output-symmetric channels. The basic building blocks of most stateof the art source coders are: 1) a linear transformation; 2) scalar quantizati...