H. Witsenhausen and A. D. Wyner, "Source Coding for Multiple Descriptions II: A Binary Source." Bell Labs Tech. Rept. TM-80-1217, Dec. 1980.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....information, generally a real number, to a set of integers (designing a quantizer) second, mapping each integer to the set of components to be transmitted over the channels (index assignment) This paper deals with the second part of the problem. The relevant works include [3] 4] 1] 12] [10], 11] 6] 8] 2] Applications of this problem arise in video and speech communication. To the best of our knowledge, this paper is rst to give lower bounds for the problem, and provide optimal algorithms that achieve the lower bound. In addition, the general case of k channels, when k 2, ....

Witsenhausen, H. S. and A.D. Wyner, \Source coding for multiple descriptions II: A binary source", Bell Syst. Tech. J., 60 (1981), 2281-2292.

....the best upper bound on the bandwidth of products of more than two cliques of size greater than 2. For a survey on the topic of graph bandwidth up to 1982, see [7] For a recent survey on Harper type techniques on graphs see [4] For more information on the subject of graph bandwidth see West, [28]. 1.3 Notation and Terminology Arrangement the inverse of encoding, that is a function from the cells of the matrix to the numbers to be put in those cells: A : I f1; mg; where I is a subset of the product of the sets of indices I 1 I k . Slice a full submatrix. An ....

Witsenhausen, H. S. and A.D. Wyner, \Source coding for multiple descriptions II: A binary source", The Bell System Technical Journal, 60 (1981), 2281-2292.

.... have been made on various side information lossy coding problems [153] 154] 128] 155] 129] 130] and [156] Furthermore, challenging new multiterminal rate distortion problems have been tackled with considerable success, including the multiple descriptions problem [145] 150] 146] [149], 151] 152] 157] 132] the successive refinements problem [133] and the CEO problem [134] 136] Applications of multiple descriptions to image, voice, audio, and video coding are currently in development, and practical schemes based on successive refinement theory are emerging that ....

H. A. Witsenhausen and A. D. Wyner, "Source coding for multiple descriptions II: A binary source," Bell Syst. Tech. J., vol. 60, pp. 2281--2292, 1981.

....generally a real number, to a set of integers (designing a quantizer) second, mapping each integer to the set of components to be transmitted over the channels (index assignment) This paper deals with the second part of the problem. The relevant works include [6] 10] 3] 19] 1] [16], 17] 12] 14] 4] Applications of this problem arise in video and speech ( 8] 9] 18] 2] communication. We are given k channels of capacities log n 1 ; log n 2 ; log n k bits. We consider the information to be sent over those channels as a number M with at most lg m bits, 1 m ....

Witsenhausen, H. S. and A.D. Wyner, "Source coding for multiple descriptions II: A binary source", The Bell System Technical Journal, 60 (1981), 2281--2292.

....the rate distortion region for the the special case of a memoryless Gaussian source and the squared error distortion criterion. The binary symmetric memoryless source with an error frequency distortion criterion has been studied by Berger and Zhang [4] 5] Ahlswede [6] Witsenhausen and Wyner [7], Wolf, Wyner and Ziv [8] It was conjectured that the achievable rate region given in [3] coincided with the rate distortion region in cases other than the Gaussian memoryless source and the squared error distortion criterion. However, this conjecture was disproved in [5] There have been no ....

H. S. Witsenhausen and A. D. Wyner, "Source coding for multiple descriptions II: A binary source," Bell Syst. Tech. J., vol. 60, pp. 2281--2292, December 1981.

....is not the case. However, in the sense made precise in Wringing Lemma 2 it is approximately true, and by the continuity property of C described in Proposition 2 the desired result will follow. Choose now l = Gamma2=5 and define Y 0 ( t) Phi y 2 Y : I( X 1t X 2t jY = y) 1=5 Psi (4.6a) Y(ae; t) y 2 Y : X x jP X t jY (xjy) Gamma PX t (x)j ae ) 4.6b) Y( ae; t) Y 0 ( t) Y(ae; t) 4.6c) By (4.1) and Chebyshev s inequality P Y Gamma Y 0 ( t) Delta 1 Gamma 2=5 ; for t = 1; 2; n: 4.7) By Wringing Lemma 2 there is a set N ....

....is in conv(F ) letting ffi and (ffi) ae(ffi) tend to zero (4.14) implies the existence of a cluster point I 2 conv(F ) of the right side vectors. Therefore, R i I i ; i = 1; 2 R 1 R 2 I 3 D i I i 4 ; i = 0; 1; 2 and thus (R 1 ; R 2 ; D 0 ; D 1 ; D 2 ) 2 conv(C ) D 0 ) ##CITE##5 ....

H.S. Witzenhausen and A.D. Wyner, "Source coding for multiple descriptions II: A binary source", Bell. Syst. Tech. J., vol. 60, no. 10, 2281--2292, 1981.

....component variables are much closer to independence than are Y n and Z n . The lemma was used by Dueck in [14] for strong converse proofs with oe; ffi held constant, but it turns out to be good enough in the present rate distortion situation , where oe = n ( arbitrary small) 5 Proof of Team Guessing Lemma 3 Application of the wringing lemma with oe = n and ffi = l, 1 l n, guarantees the existence of t 1 ; t k 2 f1; 2; ng such that I(U t V t jS) l; t = 1; 2; n (5.1) where S = U t 1 V t 1 : U t k V t k ; k nl Gamma1 : 5.2) ....

H.S. Witzenhausen and A.D. Wyner, "Source coding for multiple descriptions II: A binary source", Bell. Syst. Tech. J., vol. 60, no. 10, 2281--2292, 1981.

....this conjecture however was disproved by Zhang and Berger [45] It should be emphasized that, to this date, Ozarow s result for the gaussian source and squared error metric is the only one presenting a complete characterization of a MD rate distortion region. Witsenhausen, Wolf, Wyner and Ziv [40, 41] also considered this problem, focusing mostly on a (possibly biased) coin flipping source and Hamming distance as a distortion measure. Alswhede [1] showed that under the no excess rate condition (i.e. when R 1 R 2 = R(D 0 ) where R( Delta) is the classical rate distortion function of the ....

H. Witsenhausen and A. Wyner. Source Coding for Multiple Descriptions II: A Binary Source. The Bell System Technical Journal, 60:2281--2292, 1981.

No context found.

H. Witsenhausen and A. D. Wyner, "Source Coding for Multiple Descriptions II: A Binary Source." Bell Labs Tech. Rept. TM-80-1217, Dec. 1980.

No context found.

H.S. Witsenhausen and A.D. Wyner, "Source coding for multiple descriptions II: A binary source," Bell Syst. Tech. J., vol. 60, no. 10, pp. 2281-2292, Dec. 1981.

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