Existing literature on source coding with side information (SCSI) uses channel codes like LDPC codes and turbo codes and assumes classical unique decoding. In this paper, in contrast to classical decoding, we have tak...
详细信息
Existing literature on source coding with side information (SCSI) uses channel codes like LDPC codes and turbo codes and assumes classical unique decoding. In this paper, in contrast to classical decoding, we have taken the list decoding approach and show that the theoretical limit of SCSI can then be achieved. We argue that, as opposed to channel coding, the correct sequence from the list produced by the list decoder can effectively be recovered in case of SCSI with a few CRC bits. The CRC bits, which allow the decoder to identify the correct sequence, incur negligible overhead for large block length. More importantly, these CRC bits are not subject to noise since we are dealing with a virtual noisy channel rather than a real noisy channel. Finally, we present a guideline for designing constructive SCSI schemes using Reed Solomon code, BCH code, and Reed-Muller code, which are the known list-decodable codes.
Exploration versus exploitation in a sensor field with a mobile agent is examined in the context of source coding. The encoder is the low complexity data gathering agent. The decoder is a high complexity fusion center...
详细信息
Exploration versus exploitation in a sensor field with a mobile agent is examined in the context of source coding. The encoder is the low complexity data gathering agent. The decoder is a high complexity fusion center. The encoder first sends a coarse description of the random field, then transmits a refined description of a region of interest, i.e., a subset of the correlated sources in the first stage and so on. The main source coding challenge is that the receiver wants to refine a subset of the correlated sources that is unknown to the encoder a priori. The conventional approach of scalable coding via conditional codebook encoding (CCE) requires a codebook that is exponential in size with respect to the number of sources and also the number of refinement stages. This paper studies an alternative approach, using random binning (RB), in lieu of CCE. The universality of RB plays a key role, as the encoder does not know a priori which sources the decoder wants to refine. It is shown that RB does not introduce any loss and can effectively replace CCE while providing significant storage reduction in terms of the number of codewords stored. Achievable rate regions are derived for the single and the multi-terminal encoding settings.
We look at the problem of transmitting information over time-varying channels with side information, where for time-varying channels the statistics of the channel change with time and by channel side information we me...
详细信息
We look at the problem of transmitting information over time-varying channels with side information, where for time-varying channels the statistics of the channel change with time and by channel side information we mean the current state of the channel. We show that when this side information is available at both the transmitter and the receiver, then for the power-constrained channel, the power allocation policy that achieves minimum end-to-end distortion is not necessarily the same as the one required for maximum transmission rate.
The source coding rate allocation problem for the orthogonal multiple-access relay channel with M users and compress-and-forward at the relay is addressed. In case of Gaussian codebooks at the sources and Gaussian cha...
详细信息
The source coding rate allocation problem for the orthogonal multiple-access relay channel with M users and compress-and-forward at the relay is addressed. In case of Gaussian codebooks at the sources and Gaussian channels, we show that the sum-rate-optimal assignment of source coding rate at the relay is given by waterfilling. For general modulation alphabets at the sources and finite-alphabet discrete memoryless channels, the source coding rate allocation problem is formulated using the information bottleneck method, based on which we appropriately modify a standard cutting-plane algorithm to numerically compute an optimal source coding rate vector at the relay.
This work studies problems of source coding under the requirement that the encoder can produce an exact copy of the compressed source constructed by the decoder. This requirement, termed here as a common knowledge con...
详细信息
This work studies problems of source coding under the requirement that the encoder can produce an exact copy of the compressed source constructed by the decoder. This requirement, termed here as a common knowledge constraint, is satisfied automatically in rate-distortion theory for single sources. However, in the common formulation of problems of lossy source coding with side information at the decoder (the Wyner-Ziv problem), distributed source coding, and joint source-channel coding for networks, the destination can exploit the information it receives in a manner that cannot be exactly reproduced at the sender side. Some applications, like the transmission of sensitive medical information, may require that both sides - the sender and the receiver - will share a common version of the compressed data, for the purpose of future discussions or consulting. The purpose of this work is to study the implications of common knowledge constraints on the achievable rates in scenarios of lossy source coding. A single letter characterization of the rate distortion function is developed, for the problem of source coding with side information at the decoder, under a common knowledge constraint. Implications of this constraint on problems of joint source channel coding for the degraded broadcast channel are studied. Specifically, it is shown that in this setup, a scheme based on separation achieves optimal distortions.
In this work, we address the capacity region of multi-source multi-terminal network communication problems, and study the change in capacity when one moves form independent to dependent source information. Specificall...
详细信息
In this work, we address the capacity region of multi-source multi-terminal network communication problems, and study the change in capacity when one moves form independent to dependent source information. Specifically, we ask whether the trade off between capacity and source independence is of continuous nature. We tie the question at hand to that of edge removal which has seen recent interest.
In this work, we consider a source coding model with feedforward. We analyze a system with a noiseless feedforward link where the decoder has knowledge of all previous source samples while reconstructing the present s...
详细信息
In this work, we consider a source coding model with feedforward. We analyze a system with a noiseless feedforward link where the decoder has knowledge of all previous source samples while reconstructing the present sample. The rate-distortion function for an arbitrary source with feedforward is derived in terms of directed information, a variant of mutual information. The special cases of discrete memoryless sources and Gaussian sources with feedforward are further examined. We also derive a random coding error exponent which is used to bound the probability of decoding error for a source code (with feedforward) of finite block length. The results are then extended to feedforward with an arbitrary delay larger than the block length.
A source coding system with side information at the decoder is a typical multiterminal source coding system where output sequences of two sources are independently encoded, but a decoder recovers only one output seque...
详细信息
ISBN:
(纸本)9781467377058
A source coding system with side information at the decoder is a typical multiterminal source coding system where output sequences of two sources are independently encoded, but a decoder recovers only one output sequence from two codewords. Since Wyner, Ahlswede and Körner independently investigated this system, we call it as the WAK coding system. This paper investigates the ε-achievable rate region of the WAK coding system which allows the probability of error within a fixed tolerance ε(∈ (0, 1)), and clarifies the ε-achievable rate region for correlated general sources in terms of the smooth max-entropy and the smooth max Rényi divergence. To this end, we show a new one-shot converse theorem for the WAK coding system, and a one-shot covering lemma which is a refined version of Warsi's result. Then, combining these results, we clarify the ε-achievable rate region of the WAK coding system.
We consider a source-coding scenario in which composite side information is available at the decoder, viz. part of it is known non-causally, whereas the other part is available only causally - by this combining the tr...
详细信息
We consider a source-coding scenario in which composite side information is available at the decoder, viz. part of it is known non-causally, whereas the other part is available only causally - by this combining the treatment of Wyner and Ziv with that of Weissman and El Gamal. We then consider the joint source-channel coding problem of transmitting a source with composite side information at the decoder over a channel with composite side information at the encoder. We show that the separation principle between source coding with composite side information and its dual channel problem holds, thus extending the result of Merhav and Shamai to the case of composite side informations. These results provide a unified framework for treating the causal side information case, the non-causal stateinformation case, as well as a mixture of the two.
暂无评论