A. Wyner. On source coding with side information at the decoder. IEEE Trans. Inform. Theory, 21:294--300, May 1975.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....SlepianWolf coding efficiency remains a difficult and open problem. Schemes that use long block codes and codes with memory are available, but these are mostly impractical for control systems because of the significant delay they entail. There are approaches based on binning and coset formation ([15], 16] that are more practical but mostly optimal only in the asymptotic sense. However, for the problem we consider, Slepian Wolf gain is indeed achievable with a single step quantization using a binning type argument. The approach we take is based on a uniform quantization interpretation and ....

A. D. Wyner, "On Source Coding With Side Information at the Decoder", IEEE Trans. Inf. Theory, vol. 21, pp. 244-300, May 1975.

....same time it can take the form of cost capacity like problem with nonfixed cost function. Moreover it combines these two problems in a way that is free of the arbitrary nature of both the distortion measure and channel cost. Another formally related problem is source coding with side information[14, 1]. The setting of this problem is very di#erent but the solution happen to be similar. See section 3 for a detailed discussion of this relationship. 1.1 Summary of Results We define the IB coding problem and the IB optimization problem in section 2. We discuss the relationship between the ....

.... since p(y x) in the exponent is defined implicitly in the terms of the assignment mapping p(x x) 3 Relation to Source Coding with Side Information The problem of source coding with side information at the decoder is being studied in the Information Theory community since the mid seventies [14, 1]. It is also known as the Wyner Ahlswede Koroner (WAK) problem. Lately it was discovered [3] that it is closely related to the Information Bottleneck. In order to explore the relations between the two frameworks we first give here a short description of the WAK problem. The WAK framework study ....

[Article contains additional citation context not shown here]

A. D. Wyner. On source coding with side information at the decoder. IEEE transaction on information theory, 21(3):294--300, May 1975.

....are dedicated, had a profound impact on information theory and on his colleagues including the first and third authors. Amongst Wyner s varied contributions were the conception and development of source coding problems that generalized Shannon s basic point to point communication problem [1] [2], 3] 4] 5] Network source coding problems inspired in part by Wyner s work currently occupy many theoreticians and compression practitioners. This paper concerns the analysis of one framework for communicating infinite sequences over a set of parallel channels, each of which is either ....

A. D. Wyner. On source coding with side information at the decoder. IEEE Trans. Inform. Th., IT-21(3):294--300, May 1975.

....sequence as side information, can provide an output with superior visual quality and average PSNR, in the presence of channel errors. Wyner Ziv coding refers to lossy compression with side information at the decoder. Achievable rates for this setting were derived in the mid 1970s by Wyner and Ziv [1, 2, 3]. It was proved that the minimum source encoding rate for a given distortion, when the side information is only known to the decoder, is greater than or equal to the rate obtainable when the side information is also available at the encoder. Our implementation of the Wyner Ziv codec consists of an ....

A. Wyner, "On source coding with side information at the decoder," IEEE Transactions on Information Theory, vol. IT-21, no. 3, pp. 294--300, May 1975.

....R(D x ; D y ) f(R 1 ; R 2 )g [2, 4] See Figure 1. Berger and Yeung [3] found the achievable rate region in the special case where fX k g is discrete and its reconstruction is required to be perfect in the usual Shannon sense. Their result consolidates earlier work of Slepian and Wolf [7] Wyner [8], Ahlswede and Korner [1] Wyner and Ziv [10] and Kaspi and Berger [5] We give the Berger Yeung problem a high resolution interpretation. We assume that X k is real valued, has a smooth conditional distribution given Y k , and is encoded with small mean squared error D x . We determine the ....

.... Here fY k g is discrete and D y is small (or zero) The Berger Yeung problem reduces to the Wyner Ziv (WZ) problem [10] for lossy coding of fY k g with perfect side information fX k g) if the rate of the X encoder is greater than H(X) and reduces to the Wyner Ahlswede Korner (WAK) problem [8, 1] (for lossless coding of fX k g with compressed side information on fY k g) if no condition is imposed on the Y distortion (i.e. if D y D y;max ) Likewise, our semi continuous problem gives high resolution (D x 0) interpretations to the WZ and the WAK problems when R 1 RX (D x ) and when D ....

[Article contains additional citation context not shown here]

A.D. Wyner. On source coding with side information at the decoder. IEEE Trans. Information Theory, IT-21:294--300, 1975.

....are dedicated, had a profound impact on information theory and on his colleagues including the first and third authors. Amongst Wyner s varied contributions were the conception and development of source coding problems that generalized Shannon s basic point to point communication problem [20] [31], 32] 30] 29] Network source coding problems inspired in part by Wyner s work currently occupy many theoreticians and compression practitioners. This paper concerns the analysis of one framework for communicating infinite sequences over a set of parallel channels, each of which is either ....

A. D. Wyner. On source coding with side information at the decoder. IEEE Trans. Inform. Th., IT-21(3):294--300, May 1975.

....the side information Y (which is correlated to X) X can be described with H(XjY ) bits sample. b) Only decoder has access to the side information Y (which is correlated to X) The Slepian Wolf theorem says that X can still be described with H(XjY ) bits sample. valued sources by Wyner and Ziv [5, 6, 7, 8], who showed that a similar result holds in the case where X and Y are correlated i:i:d: Gaussian random variables. If the decoder knows Y , then whether or not the encoder knows Y , the rate distortion performance for coding X is identical 1 . As in the lossless case, the result is asymptotic ....

A. D. Wyner, "On source coding with side information at the decoder," IEEE Trans. Inform. Theory, vol. IT-21, pp. 294--300, May 1975.

....as a rate distortion problem, and a single letter characterization of Delta(R) can be found. We then specialize the general Delta(R) to the horse race market. We observe that finding the doubling function for the horse race market can be reduced to source coding with side information of Wyner [26] and Ahlswede Korner [5] We solve for the doubling function for jointly Gaussian and jointly binary horse race markets. The jointly Gaussian source coding with side information has not been previously treated, since noiseless source coding is unmotivated for continuous random variables. After ....

....assume that the side information V , like X, is also a discrete random variable. The problem of finding the doubling function in the horse race market can be reduced to that of source coding with side information. Source coding with side information was independently investigated by Wyner [26] and by Ahlswede and Korner [5] The block diagram for source coding with side information is illustrated in Figure 3.1. Suppose (V i ; X i ) i = 1; n are independent, identically distributed copies of the pair (V; X) The first encoder observes V n and encodes it using R 1 ....

A. D. Wyner. On source coding with side information at the decoder. IEEE Transactions on Information Theory, IT--21:294--300, 1975.

....rate constraint in describing side information , the maximum increase in the growth rate is given by We then specialize the general to the horse race market. We observe that finding the incremental growth rate for the horse race market can be reduced to source coding with side information of Wyner [22] and Ahlswede Korner [5] We solve for the incremental growth rate for jointly Gaussian and jointly binary horse race markets. The jointly Gaussian source coding with side information has not been previously treated, since noiseless source coding is unmotivated for continuous random variables. ....

....the Markov relationship and the rate constraint. The problem of finding the incremental growth rate in the horse race market can be reduced to that of source coding with side information. Source coding with side information for discrete random variables was independently investigated by Wyner [22] and by Ahlswede and K orner [5] The block diagram for source coding with side information is illustrated in Fig. 4. Suppose are independent, identically distributed copies of the pair . The first encoder observes and encodes it using bits per symbol. The second encoder observes and uses bits per ....

A. D. Wyner, "On source coding with side information at the decoder," IEEE Trans. Inform. Theory, vol. IT-21, pp. 294--300, 1975.

No context found.

A. Wyner, "On source coding with side information at the decoder," IEEE Trans. Inform. Theory, vol. IT-21, no. 3, pp. 294--300, May 1975.

....is useful. Index Terms: Wyner Ziv coding, Gel fand Pinsker coding, side information, channel state information, separation theorem, joint source channel coding. 1 Introduction The Wyner Ziv (W Z) model of source coding with side information at the decoder (see, e.g. 21] 27] 29] [36], 37] 39] and the Gel fand Pinsker (G P) model for channel coding with channel state information at the encoder (see, e.g. 1] 2] 5] 11] 15] 16] 18] 19] 20] 22] 28] 32] 33] 34] 35] 38] as well as the duality between them (see, e.g. 3] 4] 7] 24] 30] ....

A. D. Wyner, \On source coding with side information at the decoder," IEEE Trans. Inform. Theory, vol. IT{21, no. 3, pp. 294-300, May 1975.

No context found.

A. Wyner. On source coding with side information at the decoder. IEEE Trans. Inform. Theory, 21:294--300, May 1975.

No context found.

A. Wyner. On source coding with side information at the decoder. IEEE Trans. Inform. Theory, 21:294--300, May 1975.

No context found.

A.D. Wyner, "On source coding with side information at the decoder," IEEE Trans. on Information Theory, vol. 21, pp. 244-300, May 1975.

No context found.

A. Wyner, "On source coding with side information at the decoder," IEEE Transactions on Information Theory IT-21, pp. 294--300, May 1975.

No context found.

A. D. Wyner. On Source Coding with Side Information at the Decoder. IEEE Trans. Inform. Theory, IT-21(3):294--300, 1975.

No context found.

A. D. Wyner, "On Source Coding with Side Information at the Decoder," IEEE Trans. Inform. Theory, vol. 21, pp. 294--300, May 1975.

No context found.

Wyner, A.D. (1975). \On source coding with side information at the decoder," IEEE Trans. Inform. Theory, 21(3), 294-300.

No context found.

A.D. Wyner. On source coding with side information at the decoder. IEEE Trans. on Info Theory, IT-21:294--300, 1975.

No context found.

A.D. Wyner. On source coding with side information at the decoder. IEEE Trans. on Info Theory, IT-21:294-300, 1975.

No context found.

A.D. Wyner, "On source coding with side information at the decoder," IEEE Trans. Inform. Theory, vol. IT-21, pp. 294-300, May 1975.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC