Source Coding with Causal Side Information at the Decoder

نویسندگان

  • Abbas El Gamal
  • Tsachy Weissman
چکیده

2 ⌋ }. The i-th reconstruction is of the form X̂i(T, Y ), i.e., it is allowed to depend on the side information, but only causally. The motivation for studying this problem comes from source coding systems that are constrained to operate with no, or with limited, delay. Sequential source codes with a limited-delay encoder and a sequential, zero-delay, decoder with access to side information comprise a subfamily of the schemes that our notion of causal decoder side information allows, since our formulation does not limit the encoding delay. In particular, our formulation encompasses “real-time Wyner Ziv” coding schemes, as recently introduced in [8]. Consequently, our negative (converse) results immediately apply to all such source coding scenarios. On the positive side, as we show, in some cases, schemes from the more limited (and realistic) family of “real-time” codes can achieve optimum performance within the larger family that we allow. Another motivation for our work is to better understand the duality between channel coding and source coding problems. If the Wyner-Ziv problem [13] is the source coding analogue of the Gelfand-Pinsker setting of channel coding with non-causal state information at the transmitter [1], then the problem we consider here is the source coding analogue of channel coding with causal state information at the transmitter, as considered by Shannon in [6]. Our work characterizes the relationship between the non-causal and causal versions of the source coding problem and highlights some similarities to the relationship between the non-causal and causal channel coding problems. Our work can also be viewed a complement to the recent study in [9], which examined various causal source coding scenarios involving side information. Specifically, the effect of the introduction of side information into the causal source coding framework of Neuhoff and Gilbert [4] was studied. As was pointed out, Neuhoff and Gilbert’s notion of causal source codes is not well-matched for situations involving side information at the decoder which, consequently, were not considered in [9].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Zero-Delay and Causal Single- User and Multi-User Lossy Source Coding with Decoder Side Information

We consider zero-delay single-user and multi-user lossy source coding with decoder side information. The zero-delay constraint translates into causal (sequential) encoder and decoder pairs as well as the use of instantaneous codes. For the single-user setting, we show that optimal performance is attained by time sharing at most two scalar encoder-decoder pairs, that use zero-error side informat...

متن کامل

Distributed and cascade lossy source coding with a side information "vending machine"

Source coding with a side information "vending machine" is a recently proposed framework in which the statistical relationship between the side information available at the decoder and the source sequence can be controlled by the decoder based on the message received from the encoder. In this paper, the characterization of the optimal rate-distortion performance as a function of the cost associ...

متن کامل

Source Coding with Decoder Side Information

In this report, we study source coding problems with decoder side information (SI). Source coding problems with decoder side information are a special case of distributed source coding problems. We outline the relation between various distributed source coding problems in Table 1 with the help of Figure 1. For reference, we also include the standard single-source lossless and lossy compression ...

متن کامل

Superposition Coding for Source Coding with Side Information at the Decoder

Problems of noisy channel coding with side information at the encoder and of lossy source coding with side information at the decoder have many practical applications. Unfortunately, the theoretical performance bounds are obtained by randomly partitioning a randomly generated source or channel code into an ensemble of channel or source codes, which is highly non-practical. A scheme has recently...

متن کامل

Sequential decoding for lossless streaming source coding with side information

The problem of lossless fixed-rate streaming coding of discrete memoryless sources with side information at the decoder is studied. A random time-varying tree-code is used to sequentially bin strings and a Stack Algorithm with a variable bias uses the side information to give a delay-universal coding system for lossless source coding with side information. The scheme is shown to give exponentia...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005