T. Berger, "Multiterminal source coding," Lectures presented at CISM Summer School on the Information Theory Approach to Communications, July 1977.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....paper [111] Several simpler decoders have been proposed for the DMC (2) under the name of typicality decoders. These decoders are usually classified as weak typicality decoders [39] which are sometimes referred to as entropy typicality decoders [44] and joint typicality decoders [24], 44] 126] which are sometimes referred to as strong typicality decoders) We describe below the joint type typicality decoder as well as a more stringent version which relies on a notion of typicality in terms of the Kullback Leibler divergence (cf. e.g. 44] Given a set of codewords ....

T. Berger, "Multiterminal source coding," in The Information Theory Approach to Communications (CISM Course and Lecture Notes, no. 229), G. Longo, Ed. Berlin, Germany: Springer-Verlag, 1977, pp. 172--231.

....extension of distributed source coding in a sensor network setting was tackled in [5] where the encoders observe independent noisy versions of a source X and separately encode their observed data to a remote joint decoder to get the best joint estimate of X. Further extensions are studied in [6]. Practical construction of encoders and decoders for such problems was considered in [7] where a trellis based code construction was formulated and analyzed under the name of DIstributed Source Coding Using Syndromes (DISCUS) The construction in [7] is an asymmetric version of the problem ....

T. Berger, "Multiterminal source coding," in The information theory approach to communication, (CISM Courses and Lecture Notes No. 229), G. Longo, Ed., Wien and New York: Springer-Verlag., 1977. Encoder-1 Encoder-2

....with sensitivity matrix under the constraint that compresses the vector coordinates independently. An obvious advantage of such a companding scheme is a dramatic decrease in complexity. Another interesting application of independent companders can be given in lossy multiterminal source coding [30]. The goal is to minimize subject to the constraint that the compressor be of the form where the are scalar compressors which are invertible and possess nonzero and continuous derivatives , Then so that we obtain (16) where (17) In the Appendix we show that minimize (16) if and only if ....

T. Berger, "Multiterminal source coding," in The Information Theory Approach to Communications, G. Longo, Ed. (CISM Course and Lecture Notes, no. 229). New York: Springer, 1977.

....matrix M(x) fm ij (x)g under the constraint that F compresses the vector coordinates independently. An obvious advantage of such a companding scheme is a dramatic decrease in complexity. Another interesting application of independent companders can be given in lossy multiterminal source coding [30]. The goal is to minimize C 2 (F ) k 2 log C 1 (F ) subject to the constraint that the compressor be of the form F (x) F 1 (x 1 ) F k (x k ) where the F i : R R are scalar compressors which are invertible and possess nonzero and continuous derivatives F 0 i , 1 i k. Then ....

T. Berger, "Multiterminal source coding," in The Information Theory Approach to Communications (G. Longo, ed.), CISM Cource and Lecture Notes No. 229, New York: Springer, 1977.

....the asymptotic performance for a general d(x; y) with sensitivity matrix M(x) fm ij (x)g under the constraint that F compresses the vector coordinates independently. An obvious advantage of such a companding scheme is a dramatic decrease in complexity. In lossy multiterminal source coding [30], another interesting application of independent companders can be given. This aspect will be considered elsewhere. The goal is to minimize C 2 (F ) k 2 log C 1 (F ) subject to the constraint that the compressor be of the form F (x) F 1 (x 1 ) F k (x k ) where the F i : R R are ....

T. Berger, "Multiterminal source coding," in The Information Theory Approach to Communications (G. Longo, ed.), CISM Cource and Lecture Notes No. 229, New York: Springer, 1977.

....can compute f(X i ; Y i ) for all i. 2 The protocol uses roughly I(W ; XjY ) HG (XjY ) bits to convey to PY a sequence w that is robustly typical with X. It strengthens similar (strong typicality) results of Wyner and Ziv [21] and Csisz ar and Korner [4] The proof follows the outlines in Berger [2] and Cover and Thomas [3] It also addresses subtleties arising in the detailed proof. For every rate r HG (XjY ) we exhibit a collection of deterministic protocols. Each protocol s rate is r, and the collection s average block error probability is exponentially small. Standard arguments imply ....

....e Gamma (ffi 2 Gammaffi 1 ) 2 1 ffi 1 p(x;y)n=2 : The lemma follows from the union bound. 2 If (W;X) w; x) 2 T ffi 1 the lemma implies that with high probability (w; x; Y) 2 T ffi 2 . If W Gamma X Gamma Y is a Markov chain, fewer conditions suffice. Lemma 23 (Markov Lemma, Berger [2]) Let W Gamma X Gamma Y be a Markov chain. For every (w; x) 2 T ffi 1 , p[ w; x; Y) 2 T ffi 2 jX = x] 1 Gamma ffl ffi 1 ;ffi 2 (n) Proof: By Markovity and Lemma 22, for all (w; x) 2 T ffi 1 , p[ w; x; Y) 2 T ffi 2 jX = x] p[ w; x; Y) 2 T ffi 2 j(W; X) w; x) 1 Gamma ffl ffi 1 ;ffi 2 ....

T. Berger. Multiterminal source coding. In G. Longo, editor, The Information Theory Approach to Communications, CISM Courses and Lectures No. 229, pages 171--231. Springer Verlag, 1978.

....k g from separate encoders at rates R 1 and R 2 , respectively, and needs to reconstruct the sources subject to fidelity criteria D x and D y . The classical multiterminal source coding problem, currently an open problem, is to find the set of admissible rate pairs 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 ....

.... test channel associated with the high resolution link, namely X X N , where N is Gaussian with variance D x and is independent of (V; Y; X) If V satisfies X Y V , then this test channel induces a long Markov chain V Y X (X N) that is associated with an achievable rate region, [2], add (D x ; V ) R 1 I(X; X N jV ) R 2 I(Y ; V jX N) R 1 R 2 I(Y; X;V;X N) N N (0; D x ) 44) Furthermore, the rate pairs in (44) allow us to decode X with mean squared error D x (by setting X = X ....

[Article contains additional citation context not shown here]

T. Berger. Multiterminal Source Coding. In G.Longo, editor, the Information Theory Approach to Communications, Springer-Verlag, New York, 1977.

....resided in proving a converse to the unlikely effect that this performance cannot be improved upon, and then generalizing to (17) for arbitrary and . The advent of Wyner Ziv theory gave rise to a spate of papers on multiterminal lossy source coding, codified and summarized by Berger in 1977 [95]. Contributions described therein include works by Korner and Marton, 96] 98] Berger and Tung [99] 100] Chang [101] Shohara [102] Omura and Housewright [103] Wolfowitz [104] and Sgarro [105] In succeeding decades, further strides have been made on various side information lossy coding ....

T. Berger, "Multiterminal source coding," in The Information Theory Approach to Communications (CISM Courses and Lectures, no. 229). Wien, New York: Springer-Verlag, 1977, pp. 171--231.

No context found.

T. Berger, "Multiterminal source coding," Lectures presented at CISM Summer School on the Information Theory Approach to Communications, July 1977.

No context found.

T. Berger, "Multiterminal Source Coding," Information Theory Approach to Communication, (CISM Courses and Lecture Notes No. 229), G. Longo, Ed., Wien and New York: Springer-Verlag, 1977.

No context found.

T. Berger, "Multiterminal source coding," in The Information Theory Approach to Communications (G. Longo, ed.), ch. 4, Springer-Verlag, 1977.

No context found.

T. Berger, "Multiterminal source coding," Lectures presented at CISM Summer School on the Information Theory Approach to Communications, July 1977.

No context found.

T. Berger, "Multiterminal source coding," Lectures presented at CISM Summer School on the Information Theory Approach to Communications, July 1977.

No context found.

T. Berger. Multiterminal Source Coding. In G.Longo, editor, the Information Theory Approach to Communications, Springer-Verlag, New York, 1977. 17

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