A New Achievable Region for Gaussian Multiple Descriptions Based on Subset Typicality
|
|
- Linda Spencer
- 6 years ago
- Views:
Transcription
1 0 IEEE Information Theory Workshop A New Achievable Region for Gaussian Multiple Descriptions Based on Subset Typicality Kumar Viswanatha, Emrah Akyol and Kenneth Rose ECE Department, University of California - Santa Barbara {kumar,eakyol,rose}@ece.ucsb.edu Abstract This paper addresses the L channel multiple descriptions problem for a Gaussian source under mean squared error (MSE distortion metric. We focus on particular crosssections of the general rate-distortion region where a subset the L distortion constraints are not imposed. Specifically, we assume that certain descriptions are never received simultaneously at the decoder and thereby the transmitted codewords require joint typicality only within prescribed subsets. We derive a new encoding scheme and an associated rate-distortion region wherein joint typicality of codewords only within the prescribed subsets is maintained. We show that enforcing joint typicality of all the codewords entails strict suboptimality in the achievable rate-distortion region. Specifically, we consider a 3 descriptions scenario wherein descriptions and 3 are never received simultaneously at the decoder and show that a strictly larger achievable region is obtained when the encoder maintains joint typicality of codewords only within the required subsets. To prove these results, we derive a lemma called the subset typicality lemma which plays a critical role in establishing the new achievable region. Index Terms Subset typicality lemma, Gaussian multiple descriptions under MSE, L channel multiple descriptions I. INTRODUCTION The Multiple Descriptions (MD problem has been studied extensively since the late seventies, see for eg. [, [, [3, [4, [5, [6, [7, [8, [9, [0, [. It was originally designed as a source-channel coding strategy to cope with channel failures, where multiple source descriptions are generated and sent over different paths. In the L descriptions setting, the encoder generates L packets which are transmitted over L available channels. It is assumed that the decoder receives a subset of the descriptions perfectly and the remaining are lost. The objective is to characterize the set of achievable rate-distortion tuples for the L description rates and the L distortions, one for each possible combination of the received descriptions. One of the first achievable regions for the -channel MD problem was derived by El-Gamal and Cover in 98 [. It is given by the convex closure over all tuples (R, R, D, D, D for which there exist auxiliary random variables ˆX, ˆX jointly distributed with X taking values over arbitrary alphabets and functions ψ K, K {,, } such The work was supported by the NSF under grants CCF and CCF-8075 that, R i I(X; ˆX i R + R I(X; ˆX, ˆX + I( ˆX ; ˆX [ D K E d K (X, ψ K K K {,, } ( where { ˆX} K denotes the set { ˆX i : i K}. Ozarow [4 showed that for the descriptions setting, the El-Gamal Cover region is complete for a Gaussian source under mean squared error (MSE distortion metric. Specifically, he showed that the complete region can be achieved using a correlated quantization scheme which imposes the following joint distribution for ˆX, ˆX : ˆX X + W, ˆX X + W ( where W and W are zero mean Gaussian random variables independent of X with covariance matrix K WW and the functions ψ K K are given by the respective minimum mean squared error (MMSE optimal estimators, for eg., ψ ( ˆX, ˆX E [X ˆX, ˆX. The covariance matrix K WW is set to satisfy all the distortion constraints. We denote the complete Gaussian-MSE -descriptions region by RD. It has been shown in the literature that the El-Gamal Cover region is complete for general sources and distortion measures in the no-excess rate regime [3. However, Zhang and Berger showed in [ that this region is not complete in general. Specifically, for a binary source and Hamming distortion measure, they showed that sending a common codeword among the two descriptions can lead to a strictly larger achievable region. There have been several publications on extending the Gaussian -channel results to the L channel framework [5, [0, [, [. A natural extension of the correlated quantization coding scheme for the L channel setting (see for example [5 is described as follows. Let W, W,..., W L be zero mean Gaussian random variables independent of X with covariance matrix K W and let ˆXi be such that: ˆX i X + W i, i L (3 Note that the original characterization of El-Gamal and Cover also includes a refinement random variable ˆX. However, it was shown recently in [7 that ˆX can be set to a constant without loss of optimality //$ IEEE 45
2 0 IEEE Information Theory Workshop where L {,,..., L}. Let K L, ψ K K E [X { ˆX} K and the covariance matrix K W be such that: Var (X { ˆX} K D K (4 i.e., all the L distortion constraints are satisfied. Then any rate tuple (R, R,..., R L satisfying the following conditions is achievable: h( ˆX i h K X K L (5 i K R i i K The convex closure of such achievable rate tuples over all K W satisfying the distortion constraints is an achievable region for the L channel Gaussian MD problem and is denoted hereafter by RD L. The coding scheme involves generating L independent codebooks, one each for ˆX i i L, at respective rates of nri. Upon observing a typical sequence X n, the encoder looks for one codeword from each codebook such that they are all jointly typical with the observed sequence X n. If the encoder fails to find one such codeword tuple, it randomly picks a tuple. The index of the codeword from codebook i is sent in description i i L. The decoders estimate the source using MMSE estimators based on the subset of the codewords they receive. If the encoding is errorfree, all the prescribed distortion constraints are met as the covariance matrix K W satisfies (4. It can be shown using standard typicality arguments (see for example, the proof of Theorem in [5 that the probability of error at the encoder asymptotically approaches zero if the rates satisfy (5. It was shown recently that RD L is complete when one imposes only individual and central distortion constraints [0, i.e., when only D, D,..., D L and D {...L} are imposed. It was further shown in [ that the above strategy, in conjunction with a random binning mechanism used to further exploit the correlations among the descriptions, is sum rate optimal under symmetric distortion constraints when distortions at only two levels of receivers are imposed, i.e, when D K: K k and D {...L} are imposed, where K denotes the cardinality of set K. Our objective in this paper is to derive a new coding scheme and an associated achievable region for the L channel Gaussian MD problem which strictly improves upon RD L for particular cross-sections of the rate-distortion region where we impose only a particular subset of the L distortion constraints. Specifically, let K, K,..., K M be M proper (strict subsets of L. We focus on cross-sections wherein only distortions {D} K, {D} K,..., {D} K are imposed, where K denotes the set of all subsets (power set of K and {D} K i {D S : S Ki }. It is critical to observe that, under these distortion constraints, joint typicality of codewords within subsets { ˆX} K, { ˆX} K,..., { ˆX} KM is infact sufficient to achieve the prescribed distortions and imposing joint typicality of all the transmitted codewords is an unnecessary restriction. In this paper, we derive a new coding scheme which maintains joint typicality only within the required subsets and show that enforcing joint typicality of all the codewords entails strict suboptimality in the achievable rate-distortion region. In preparation, we derive a critical lemma called the subset typicality lemma, which plays a pivotal role in achieving the new region. We note that these results have potential broader implications in related problems in multi-terminal information theory which are beyond the scope of this paper. We also note that the principles underlying the proposed scheme can be easily extended to incorporate refinement layer random variables similar to [5 in conjunction with binning modules as indicated in [6, [ and to include common layer random variables as shown in [, [8, [9. However, in general, the optimal joint distributions of the auxiliary random variables are hard to establish for these schemes and explicit characterizations of the achievable regions are not easily tractable. The rest of the paper is organized as follows. In section II, we state the subset typicality lemma which plays an important role in the proofs that follow. In section III, we formally state the problem and derive a new achievable rate-distortion region. In section IV, we consider a particular cross-section of the 3- descriptions MD setup and show that the new rate-distortion region strictly improves upon R. II. SUBSET TYPICALITY LEMMA We introduce the notation before establishing the lemma. n independent and identically distributed (iid random variables and their realizations are denoted by X0 n and x n 0 respectively. We denote by Tɛ n (P, the length n, ɛ-typical set corresponding to a random variable distributed according to P. Through out the paper, for any set S, we use the shorthand {U} S to denote the set {U i : i S}. Also, in the following Lemma, we use the notation P (A. nr to denote n(r+δ(ɛ P (A n(r δ(ɛ for some δ(ɛ 0 as ɛ 0. Lemma. Subset Typicality Lemma :Let (X, X,... X N be N random variables taking values on arbitrary finite alphabets (X, X,... X N with marginal distributions P (X, P (X..., P N (X N, respectively. Let S, S... S M be M subsets of {,,..., N} and for all j {,,..., M}, let P Sj ({X} Sj be any given joint distribution for {X} Si consistent with each other and with the given marginal distributions. Generate sequences x n, x n... x n N, each independent of the other, where x n i is drawn iid according to the marginal distribution P i (X i, i.e., x n i n l P i(x il. Then, ( P {x} n S j Tɛ n (. PSj, j {... M} n( N i H(Xi H(P where P is a distribution over (X, X..., X N which satisfies: ( P arg max H P (7 P subject to P ({X} Sj P Sj ({X} Sj j {... M}. To avoid resolvable but unnecessary complications, we assume that there exists at least one joint distribution consistent with the prescribed per subset distributions for subsets S, S,..., S M. (6 46
3 0 IEEE Information Theory Workshop Proof: The proof follows directly from Sanov s Theorm. We omit the details here and refer to [3 for a detailed analysis. In [3 we also establish a conditional version of Lemma. This conditional version plays an important role in several related network information theoretic setups. However in this paper, the above lemma is sufficient to establish the new region. We also note that a particular instance of Lemma was derived in [4. However, as it turns out, for the setup they consider, this Lemma does not help in deriving an improved achievable region. III. PROBLEM SETUP AND A NEW ACHIEVABLE REGION In this section, we first formally state the problem being addressed in this paper and then derive a new achievable ratedistortion region for the L channel MD setup. We assume the source to be a zero mean, unit variance Gaussian random variable, i.e., X N (0,. In the L channel MD setup, there are L encoding functions, f l ( l L, which map X n to the descriptions J l f l (X n, where J l takes on values in the set {,... B l }. The rate of description l is defined as R l n log (B l. Description l is sent over channel l and is either received at the decoder error free or is completely lost. Let K, K,..., K M be M proper (strict subsets of L and let S denote the union over all i {,..., M} of the set of all subsets of K i, i.e., S {K : K K i for some i {,,..., M}, K φ}, where φ denotes the null set. In this paper, we assume that the decoder always receives a subset K of the transmitted descriptions such that K S. There is a decoding function for each possible received com- bination of the descriptions ˆX n K ( ˆX( K, ˆX ( K..., ˆX (n g K (J l : l K, K S, where ˆX K takes on real values. The distortion (MSE at the decoder when a subset K of the descriptions is received is measured as: D K E [ n n (X (t t ˆX (t K We say that a rate-distortion tuple (R i, D K : i L, K S is achievable if there exit L encoding functions with rates (R..., R L and S decoding functions yielding respective distortions D K. The closure of the set of all achievable ratedistortion tuples is defined as the rate-distortion region for the set S. Note that, this region has L + S dimensions and is a cross-section of the general rate-distortion region for the L channel Gaussian MD problem. In the following theorem, we give an achievable region for any given subsets K, K,..., K M. Theorem. Let W, W,..., W L be zero mean Gaussian random variables independent of X with covariance matrix K W and let ˆXi be defined as: ˆX i X + W i i {,,..., L} (9 Let ψ K K E [X { ˆX} K and the covariance matrix K (8 K W be such that: Var (X { ˆX} K D K K S (0 Then any rate tuple (R, R,..., R L satisfying the following conditions is achievable: h( ˆX i h K X K L ( where, i K R i i K ( h { ˆX} ( X K max h { X} K X P ( X K X where P ( X K X is subject to: P ({ X} X K Kj P X K Kj ( j {... M} (3 The convex closure over all such K W satisfying (0 is an achievable rate-distortion region and is denoted by RD L. Proof: We again omit the details of the proof here as it follows almost directly from Theorem in [3. Remark. Observe that for any K S, the conditions in ( are the same as the conditions in (5. However, when K / S, the above theorem asserts that all the constraints in (5 can be set to their respective optima simultaneously. This is precisely what provides the strict improvement over RD L as each of the constraints are typically optimized by a different K W and hence it is impossible to achieve simultaneous optimality of all the constraints in RD L. Remark. We note that the rate-distortion region can be enlarged, in general, by defining a convex closure of the achievable rate-distortion tuples over all joint densities P X L and functions ψ K K that satisfy the distortion constraints. However, it can be shown using the contrapolymatroidal nature of the achievable region that for the Gaussian source under MSE distortion metric, the form considered in the theorem for P X L and ψ K K is sufficient to achieve all the corner points. IV. STRICT IMPROVEMENT In the following theorem, we show that RD L is strictly larger than RD L for any L >. Theorem. (i RD L RD L, i.e., in general, RD L subsumes RD L. (ii L >, There exists scenarios for which, RD L RD L (4 i.e RD L contains points that are strictly outside RD L L >. Proof: We note that part (i of the theorem follows directly as the RHS in ( is smaller than or equal to the RHS in (5 for each hyperplane. The challenging task to the prove part (ii of the theorem. Also note that to prove (ii it is sufficient for us to show the result for L 3. We consider the following cross-section of the 3-descriptions rate-distortion 47
4 0 IEEE Information Theory Workshop region wherein we impose distortions D, D,, D and. Observe that for this cross-section, we have K {, } and K {, 3} and hence it is sufficient to maintain joint typicality of sequences (ˆx n, ˆx n, x n and (ˆx n, ˆx n 3, x n respectively. We will show that imposing joint typicality of all the sequences leads to a strict sub-optimality. We first specialize and restate the regions R and RD 3 for K {, }, K {, 3}. Let W, W, W 3 be zero mean Gaussian random variables independent of X with covariance matrix K W and let ˆXi X + W i. Let K W be such that all the prescribed distortion constraints are satisfied. Then all rate tuples satisfying the following conditions are part of R : R i I(X; ˆX i i {,, 3} R + R I(X; ˆX, ˆX + I( ˆX ; ˆX R + R 3 I(X; ˆX, ˆX 3 + I( ˆX ; ˆX 3 R + R 3 h( ˆX + h( ˆX 3 h( ˆX, ˆX 3 X R + R + R 3 h( ˆX + h( ˆX + h( ˆX 3 h( ˆX, ˆX, ˆX 3 X (5 The corresponding constraints for RD 3 are given by: R i I(X; ˆX i i {,, 3} R + R I(X; ˆX, ˆX + I( ˆX ; ˆX R + R 3 I(X; ˆX, ˆX 3 + I( ˆX ; ˆX 3 R + R + R 3 h( ˆX + h( ˆX + h( ˆX 3 h ( ˆX, ˆX, ˆX 3 X (a I( ˆX ; X, ˆX + I( ˆX ; X, ˆX 3 +I(X; X (6 The convex closure of such rates over all K W satisfying the distortion constraints defines the respective regions R and RD 3. Observe that the condition on R + R 3 is not imposed in (6. This is because the term h( ˆX, ˆX 3 X in (5 is set to its maximum entropy subject to the pairwise distributions of (X, ˆX and (X, ˆX 3 (refer to (3 in Theorem, i.e., h( ˆX, ˆX 3 X h( ˆX X + h( ˆX 3 X and hence the constraint on R + R 3 is redundant. Equality (a follows from the fact that the maximum entropy term, h ( ˆX, ˆX, ˆX 3 X, subject to the given distributions within subsets (X, ˆX, ˆX and (X, ˆX 3, ˆX is achieved by a joint density of the form ˆX (X, ˆX ˆX 3 and hence h ( ˆX, ˆX, ˆX 3 X can be written as h( ˆX X + h( ˆX X, ˆX + h( ˆX 3 X, ˆX. We will show that in (6, the K W which achieves the optimum sum rate (which of course satisfies ˆX (X, ˆX ˆX 3 does not satisfy the condition ˆX X ˆX 3 and hence leads to a suboptimal bound on R + R 3. This argument is in fact sufficient to show that RD 3 strictly subsumes R. More precisely, we consider one point on the boundary of RD 3 and prove that this point does not lie in R. Define P min { log( D, R min, log( } where R min is given by: { R min inf R : R log(, R 3 D log( } (R, R, R 3 R (D, D,, D, (7 Similarly we define Pmin { log( D, Rmin, log( } where Rmin is obtained by replacing R by RD 3 in (7. Observe that strict improvement is proved if we show that Rmin < R min. Recall that log( D is the rate distortion function at distortion D for a Gaussian source under MSE distortion measure and the unique rate-distortion optimal reconstruction random variable is jointly Gaussian with the source. Hence imposing R log( D and R 3 log( in (5, enforces the random variables ˆX and ˆX 3 to be independent given X such that P ( ˆX X and P ( ˆX X are the respective RD-optimal channels. This implies that W and W 3 are independent zero mean Gaussian random variables with respective variances D /( D and /(. Hence the minimization for R min in (7 is over all positive definite K W of the form: K W σw ρ σ W σ W 0 ρ σ W σ W ρ 3 σ W σ W3 0 ρ 3 σ W σ W3 σw 3 D (8 where σw D and σw 3 and where, ρ, ρ 3 achieve the other three distortion constraints. However, observe that Rmin is obtained by optimizing over all positive definite K W of the form: σw ρ σ W σ W ρ 3 σ W σ W3 K W ρ σ W σ W ρ 3 σ W σ W3 (9 ρ 3 σ W σ W3 ρ 3 σ W σ W3 σw 3 D where σw D and σw 3 and where, ρ, ρ 3, ρ 3 achieve the remaining distortion constraints. It is this extra degree of freedom that provides leeway to achieve a strictly lower Rmin. Hence, all that remains for us to show is that Rmin is not achieved by a K W which has ρ 3 0. Towards this end, we first find R from (6 for a fixed K W which has the form (9: R ( log ( + σ W ( ρ ρ 3 ρ 3 + ρ ρ 3 ρ 3 (0 To find Rmin, we need to minimize the RHS of (0 over all, ρ, ρ 3, ρ 3 subject to the distortion constraints, D, D and. Observe that ρ 3 does not contribute to any of the distortion constraints and hence can be optimized by setting the differential of the RHS in (0 to 0 for fixed, ρ and ρ 3. We obtain the optimum ρ 3 as: ρ 3 ρ ρ 3 ( Note that if ρ 3 ρ ρ 3, then K W is always positive definite for any ρ, ρ 3 : ρ <, ρ 3 <. Also observe that ρ 3 ρ ρ 3 induces the condition ˆX (X, ˆX ˆX 3 48
5 0 IEEE Information Theory Workshop which is necessary for sum rate optimality in (6. Now, the RHS in (0 can be rewritten as: R ( log ( + σ W ( ρ ( ρ 3 ( and Rmin is obtained by minimizing ( over all, ρ, ρ 3 subject to the distortion constraints. We first σ denote W by D (+σw. Clearly, we require D D to satisfy the distortion constraint for ˆX. Next, observe that for a fixed D, R decreases as ρ,ρ 3 decrease. Hence, using arguments similar to [4, [4, it follows that ρ and ρ 3 should be set equal to the respective largest values in the range (, 0, such that distortions D and are satisfied with equality. It can be easily shown that (see [5: πijd +γij ij π ijdij Dij ρ ( D ij D D j + D ij D i i Dj ij π ij Dj + D D i Dj ij D i 0 Dij D j (3 for i {, 3} and[ j, where π ij ( D i ( D j and γ ij ( D ij (D i D ij ( D j D ij + D ij D i Dj Dij and where D D ij ijd i D i D ij+d id ij. We choose D to be such that D + D < + D and + D < + hold. Then it is sufficient for us to show that the optimum D is strictly greater than D and, i.e., Dj > D ij for both i, 3. Then we will have ρ and ρ 3 strictly less than 0, implying ρ 3 0. On substituting the optimum values for ρ ij (assuming D ij < D j + D ij D i holds for both i, 3, we have the following expression for R : R ( log D 3 (4 ij D i( D ij ( D ij [( D ij ( D i( D j (D i D ij( D j D ij i {, 3} and j. Rmin is then obtained by minimizing the RHS of (4 with respect to D subject to the constraint that D D. In general, it is hard to derive a closed form solution for the minimizing ( D. Instead, we plot the variation of log D 3 as a function of D for a particular D,, D and and show that D > D : {R D D > R D D }. Let us set D 0. and D 0.05 ( and D Fig. shows the variation of log D 3 in the range D D + D D. It can be verified that R D D.99 and R D Hence the optimum D is strictly greater than D and. Therefore, it follows that ρ and ρ 3 are strictly less than 0 and consequently ρ 3 0 proving the theorem. V. CONCLUSION In this paper, we focused on the L channel Gaussian MD problem where it is known apriori that certain descriptions are Figure. Variation of R as a function of D not received simultaneously at the decoder. This assumption allows us to design encoding schemes wherein joint typicality of codewords is required only within prescribed subsets. We derived a new achievable rate-distortion region for this setup by establishing a lemma called the subset typicality lemma. We showed using a 3 descriptions setting that a strictly larger ratedistortion region is obtained by maintaining joint typicality only within the required subsets as opposed a scheme which maintains joint typicality of all the transmitted codewords. REFERENCES [ A. El Gamal and T. M. Cover, Achievable rates for multiple descriptions, IEEE Trans. Inf. Theory, vol. IT-8, pp , Nov. 98. [ Z. Zhang and T. Berger, New results in binary multiple descriptions, IEEE Trans. Inf. Theory, vol. IT-33, pp. 50 5, July 987. [3 R. Ahlswede, The rate-distortion region for multiple descriptions without excess rate," IEEE Trans. Inf. Theory, vol. 3, pp. 7-76, Nov [4 L. Ozarow, On a source-coding problem with two channels and three receivers, Bell Syst. Tech. J., vol. 59, no. 0, pp , Dec [5 R. Venkataramani, G. Kramer, V.K. Goyal, Multiple description coding with many channels, IEEE Trans. on Information Theory, vol.49, no.9, pp. 06-4, Sept 003. [6 R. Puri, S. S. Pradhan, and K. Ramchandran, n-channel symmetric multiple descriptions-part II: an achievable rate-distortion region, IEEE Trans. Information Theory, vol. 5, pp , Apr [7 J. Wang, J. Chen, L. Zhao, P. Cuff and H. Permuter, On the role of the refinement layer in multiple description coding and scalable coding, IEEE Transactions on Information Theory, vol.57, no.3, pp , Mar. 0. [8 K. Viswanatha, E. Akyol and K. Rose, A strictly larger achievable region for multiple descriptions using combinatorial message sharing, in Proc. IEEE Information Theory Workshop (ITW, Oct. 0. [9 E. Akyol, K. Viswanatha and K. Rose, On random binning versus conditional codebook methods in multiple descriptions coding, in Proc. IEEE Information Theory Workshop (ITW, Sep. 0. [0 J. Chen, Rate region of Gaussian multiple description coding with individual and central distortion constraints," IEEE Transactions on Information Theory, vol.55, no.9, pp , Sep [ S. Mohajer, C. Tian and S. Diggavi, Asymmetric multilevel diversity coding and asymmetric Gaussian multiple descriptions, IEEE Transactions on Information Theory, vol.56, no.9, pp , Sep. 00. [ H. Wang and P. Viswanath,, Vector Gaussian multiple description with two levels of receivers, IEEE Transactions on Information Theory, vol.55, no., pp.40-40, Jan [3 K. Viswanatha, E. Akyol and K. Rose, Subset typicality lemmas and improved achievable regions in multiterminal source coding, In Technical report, Available for download at: [4 E. Perron, S. Diggavi, E. Telatar, On the role of encoder sideinformation in source coding for multiple decoders," In Proc. IEEE International Symposium on Information Theory (ISIT, vol., no., pp , 9-4 Jul 006. [5 R. Zamir, Gaussian codes and Shannon bounds for multiple descriptions, IEEE Transactions on Information Theory, vol.45, no.7, pp , Nov
Subset Typicality Lemmas and Improved Achievable Regions in Multiterminal Source Coding
Subset Typicality Lemmas and Improved Achievable Regions in Multiterminal Source Coding Kumar Viswanatha, Emrah Akyol and Kenneth Rose ECE Department, University of California - Santa Barbara {kumar,eakyol,rose}@ece.ucsb.edu
More informationOn Common Information and the Encoding of Sources that are Not Successively Refinable
On Common Information and the Encoding of Sources that are Not Successively Refinable Kumar Viswanatha, Emrah Akyol, Tejaswi Nanjundaswamy and Kenneth Rose ECE Department, University of California - Santa
More informationOn Scalable Coding in the Presence of Decoder Side Information
On Scalable Coding in the Presence of Decoder Side Information Emrah Akyol, Urbashi Mitra Dep. of Electrical Eng. USC, CA, US Email: {eakyol, ubli}@usc.edu Ertem Tuncel Dep. of Electrical Eng. UC Riverside,
More informationMultiuser Successive Refinement and Multiple Description Coding
Multiuser Successive Refinement and Multiple Description Coding Chao Tian Laboratory for Information and Communication Systems (LICOS) School of Computer and Communication Sciences EPFL Lausanne Switzerland
More information3238 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 60, NO. 6, JUNE 2014
3238 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 60, NO. 6, JUNE 2014 The Lossy Common Information of Correlated Sources Kumar B. Viswanatha, Student Member, IEEE, Emrah Akyol, Member, IEEE, and Kenneth
More informationOn Scalable Source Coding for Multiple Decoders with Side Information
On Scalable Source Coding for Multiple Decoders with Side Information Chao Tian School of Computer and Communication Sciences Laboratory for Information and Communication Systems (LICOS), EPFL, Lausanne,
More informationApproximating the Gaussian multiple description rate region under symmetric distortion constraints
Approximating the Gaussian multiple description rate region under symmetric distortion constraints Chao Tian AT&T Labs-Research Florham Park, NJ 0793, USA. tian@research.att.com Soheil Mohajer Suhas Diggavi
More informationAfundamental problem of multiple description coding is to
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 3, MARCH 2011 1443 On the Role of the Refinement Layer in Multiple Description Coding and Scalable Coding Jia Wang, Jun Chen, Member, IEEE, Lei Zhao,
More informationRepresentation of Correlated Sources into Graphs for Transmission over Broadcast Channels
Representation of Correlated s into Graphs for Transmission over Broadcast s Suhan Choi Department of Electrical Eng. and Computer Science University of Michigan, Ann Arbor, MI 80, USA Email: suhanc@eecs.umich.edu
More informationarxiv: v1 [cs.it] 5 Feb 2016
An Achievable Rate-Distortion Region for Multiple Descriptions Source Coding Based on Coset Codes Farhad Shirani and S. Sandeep Pradhan Dept. of Electrical Engineering and Computer Science Univ. of Michigan,
More informationLossy Distributed Source Coding
Lossy Distributed Source Coding John MacLaren Walsh, Ph.D. Multiterminal Information Theory, Spring Quarter, 202 Lossy Distributed Source Coding Problem X X 2 S {,...,2 R } S 2 {,...,2 R2 } Ẑ Ẑ 2 E d(z,n,
More informationMultiuser Successive Refinement and Multiple Description Coding
Multiuser Successive Refinement and Multiple Description Coding Chao Tian, Member, IEEE, Jun Chen, Member, IEEE, Suhas N. Diggavi, Member, IEEE Abstract We consider the multiuser successive refinement
More informationJoint Source-Channel Coding for the Multiple-Access Relay Channel
Joint Source-Channel Coding for the Multiple-Access Relay Channel Yonathan Murin, Ron Dabora Department of Electrical and Computer Engineering Ben-Gurion University, Israel Email: moriny@bgu.ac.il, ron@ee.bgu.ac.il
More informationA Graph-based Framework for Transmission of Correlated Sources over Multiple Access Channels
A Graph-based Framework for Transmission of Correlated Sources over Multiple Access Channels S. Sandeep Pradhan a, Suhan Choi a and Kannan Ramchandran b, a {pradhanv,suhanc}@eecs.umich.edu, EECS Dept.,
More informationON SCALABLE CODING OF HIDDEN MARKOV SOURCES. Mehdi Salehifar, Tejaswi Nanjundaswamy, and Kenneth Rose
ON SCALABLE CODING OF HIDDEN MARKOV SOURCES Mehdi Salehifar, Tejaswi Nanjundaswamy, and Kenneth Rose Department of Electrical and Computer Engineering University of California, Santa Barbara, CA, 93106
More informationA Comparison of Two Achievable Rate Regions for the Interference Channel
A Comparison of Two Achievable Rate Regions for the Interference Channel Hon-Fah Chong, Mehul Motani, and Hari Krishna Garg Electrical & Computer Engineering National University of Singapore Email: {g030596,motani,eleghk}@nus.edu.sg
More informationLattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function
Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function Dinesh Krithivasan and S. Sandeep Pradhan Department of Electrical Engineering and Computer Science,
More informationYAMAMOTO [1] considered the cascade source coding
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 58, NO 6, JUNE 2012 3339 Cascade Triangular Source Coding With Side Information at the First Two Nodes Haim H Permuter, Member, IEEE, Tsachy Weissman, Senior
More informationThe Capacity Region of the Gaussian Cognitive Radio Channels at High SNR
The Capacity Region of the Gaussian Cognitive Radio Channels at High SNR 1 Stefano Rini, Daniela Tuninetti and Natasha Devroye srini2, danielat, devroye @ece.uic.edu University of Illinois at Chicago Abstract
More informationMultiaccess Channels with State Known to One Encoder: A Case of Degraded Message Sets
Multiaccess Channels with State Known to One Encoder: A Case of Degraded Message Sets Shivaprasad Kotagiri and J. Nicholas Laneman Department of Electrical Engineering University of Notre Dame Notre Dame,
More informationOn The Binary Lossless Many-Help-One Problem with Independently Degraded Helpers
On The Binary Lossless Many-Help-One Problem with Independently Degraded Helpers Albrecht Wolf, Diana Cristina González, Meik Dörpinghaus, José Cândido Silveira Santos Filho, and Gerhard Fettweis Vodafone
More informationUpper Bounds on the Capacity of Binary Intermittent Communication
Upper Bounds on the Capacity of Binary Intermittent Communication Mostafa Khoshnevisan and J. Nicholas Laneman Department of Electrical Engineering University of Notre Dame Notre Dame, Indiana 46556 Email:{mhoshne,
More informationAmobile satellite communication system, like Motorola s
I TRANSACTIONS ON INFORMATION THORY, VOL. 45, NO. 4, MAY 1999 1111 Distributed Source Coding for Satellite Communications Raymond W. Yeung, Senior Member, I, Zhen Zhang, Senior Member, I Abstract Inspired
More informationLecture 4 Noisy Channel Coding
Lecture 4 Noisy Channel Coding I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw October 9, 2015 1 / 56 I-Hsiang Wang IT Lecture 4 The Channel Coding Problem
More informationOn Gaussian MIMO Broadcast Channels with Common and Private Messages
On Gaussian MIMO Broadcast Channels with Common and Private Messages Ersen Ekrem Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 20742 ersen@umd.edu
More informationSUCCESSIVE refinement of information, or scalable
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 8, AUGUST 2003 1983 Additive Successive Refinement Ertem Tuncel, Student Member, IEEE, Kenneth Rose, Fellow, IEEE Abstract Rate-distortion bounds for
More informationApproximating the Gaussian Multiple Description Rate Region Under Symmetric Distortion Constraints
Approximating the Gaussian Multiple Description Rate Region Under Symmetric Distortion Constraints Chao Tian, Member, IEEE, Soheil Mohajer, Student Member, IEEE, and Suhas N. Diggavi, Member, IEEE Abstract
More informationExtended Gray Wyner System with Complementary Causal Side Information
Extended Gray Wyner System with Complementary Causal Side Information Cheuk Ting Li and Abbas El Gamal Department of Electrical Engineering, Stanford University Email: ctli@stanford.edu, abbas@ee.stanford.edu
More informationThe Capacity of the Semi-Deterministic Cognitive Interference Channel and its Application to Constant Gap Results for the Gaussian Channel
The Capacity of the Semi-Deterministic Cognitive Interference Channel and its Application to Constant Gap Results for the Gaussian Channel Stefano Rini, Daniela Tuninetti, and Natasha Devroye Department
More informationNew Results on the Equality of Exact and Wyner Common Information Rates
08 IEEE International Symposium on Information Theory (ISIT New Results on the Equality of Exact and Wyner Common Information Rates Badri N. Vellambi Australian National University Acton, ACT 0, Australia
More informationSuperposition Encoding and Partial Decoding Is Optimal for a Class of Z-interference Channels
Superposition Encoding and Partial Decoding Is Optimal for a Class of Z-interference Channels Nan Liu and Andrea Goldsmith Department of Electrical Engineering Stanford University, Stanford CA 94305 Email:
More informationOn Optimal Coding of Hidden Markov Sources
2014 Data Compression Conference On Optimal Coding of Hidden Markov Sources Mehdi Salehifar, Emrah Akyol, Kumar Viswanatha, and Kenneth Rose Department of Electrical and Computer Engineering University
More informationA Random Variable Substitution Lemma With Applications to Multiple Description Coding
1 A Random Variable Substitution Lemma With Applications to Multiple Description Coding Jia Wang, Jun Chen, Lei Zhao, Paul Cuff, and Haim Permuter arxiv:0909.3135v1 [cs.it] 17 Sep 2009 Abstract We establish
More informationEfficient Use of Joint Source-Destination Cooperation in the Gaussian Multiple Access Channel
Efficient Use of Joint Source-Destination Cooperation in the Gaussian Multiple Access Channel Ahmad Abu Al Haija ECE Department, McGill University, Montreal, QC, Canada Email: ahmad.abualhaija@mail.mcgill.ca
More informationA Comparison of Superposition Coding Schemes
A Comparison of Superposition Coding Schemes Lele Wang, Eren Şaşoğlu, Bernd Bandemer, and Young-Han Kim Department of Electrical and Computer Engineering University of California, San Diego La Jolla, CA
More informationA Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying
A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying Ahmad Abu Al Haija, and Mai Vu, Department of Electrical and Computer Engineering McGill University Montreal, QC H3A A7 Emails: ahmadabualhaija@mailmcgillca,
More informationInteractive Decoding of a Broadcast Message
In Proc. Allerton Conf. Commun., Contr., Computing, (Illinois), Oct. 2003 Interactive Decoding of a Broadcast Message Stark C. Draper Brendan J. Frey Frank R. Kschischang University of Toronto Toronto,
More informationAn Achievable Rate Region for the 3-User-Pair Deterministic Interference Channel
Forty-Ninth Annual Allerton Conference Allerton House, UIUC, Illinois, USA September 8-3, An Achievable Rate Region for the 3-User-Pair Deterministic Interference Channel Invited Paper Bernd Bandemer and
More informationThe Poisson Channel with Side Information
The Poisson Channel with Side Information Shraga Bross School of Enginerring Bar-Ilan University, Israel brosss@macs.biu.ac.il Amos Lapidoth Ligong Wang Signal and Information Processing Laboratory ETH
More informationError Exponent Region for Gaussian Broadcast Channels
Error Exponent Region for Gaussian Broadcast Channels Lihua Weng, S. Sandeep Pradhan, and Achilleas Anastasopoulos Electrical Engineering and Computer Science Dept. University of Michigan, Ann Arbor, MI
More informationSoft Covering with High Probability
Soft Covering with High Probability Paul Cuff Princeton University arxiv:605.06396v [cs.it] 20 May 206 Abstract Wyner s soft-covering lemma is the central analysis step for achievability proofs of information
More informationDegrees of Freedom Region of the Gaussian MIMO Broadcast Channel with Common and Private Messages
Degrees of Freedom Region of the Gaussian MIMO Broadcast hannel with ommon and Private Messages Ersen Ekrem Sennur Ulukus Department of Electrical and omputer Engineering University of Maryland, ollege
More informationThe Duality Between Information Embedding and Source Coding With Side Information and Some Applications
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 5, MAY 2003 1159 The Duality Between Information Embedding and Source Coding With Side Information and Some Applications Richard J. Barron, Member,
More informationK User Interference Channel with Backhaul
1 K User Interference Channel with Backhaul Cooperation: DoF vs. Backhaul Load Trade Off Borna Kananian,, Mohammad A. Maddah-Ali,, Babak H. Khalaj, Department of Electrical Engineering, Sharif University
More informationAn Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 4, APRIL 2012 2427 An Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel Ersen Ekrem, Student Member, IEEE,
More informationDelayed Sequential Coding of Correlated Sources
Delayed Sequential Coding of Correlated Sources Nan Ma, Ye Wang, and Prakash Ishwar Department of Electrical and Computer Engineering Boston University, Boston, MA 02215 {nanma, yw, pi}@bu.edu Abstract
More informationLinear Exact Repair Rate Region of (k + 1, k, k) Distributed Storage Systems: A New Approach
Linear Exact Repair Rate Region of (k + 1, k, k) Distributed Storage Systems: A New Approach Mehran Elyasi Department of ECE University of Minnesota melyasi@umn.edu Soheil Mohajer Department of ECE University
More informationOn the Duality between Multiple-Access Codes and Computation Codes
On the Duality between Multiple-Access Codes and Computation Codes Jingge Zhu University of California, Berkeley jingge.zhu@berkeley.edu Sung Hoon Lim KIOST shlim@kiost.ac.kr Michael Gastpar EPFL michael.gastpar@epfl.ch
More informationOn the Duality of Gaussian Multiple-Access and Broadcast Channels
On the Duality of Gaussian ultiple-access and Broadcast Channels Xiaowei Jin I. INTODUCTION Although T. Cover has been pointed out in [] that one would have expected a duality between the broadcast channel(bc)
More informationRandomized Quantization and Optimal Design with a Marginal Constraint
Randomized Quantization and Optimal Design with a Marginal Constraint Naci Saldi, Tamás Linder, Serdar Yüksel Department of Mathematics and Statistics, Queen s University, Kingston, ON, Canada Email: {nsaldi,linder,yuksel}@mast.queensu.ca
More informationAn Achievable Error Exponent for the Mismatched Multiple-Access Channel
An Achievable Error Exponent for the Mismatched Multiple-Access Channel Jonathan Scarlett University of Cambridge jms265@camacuk Albert Guillén i Fàbregas ICREA & Universitat Pompeu Fabra University of
More informationThe Capacity Region for Multi-source Multi-sink Network Coding
The Capacity Region for Multi-source Multi-sink Network Coding Xijin Yan Dept. of Electrical Eng. - Systems University of Southern California Los Angeles, CA, U.S.A. xyan@usc.edu Raymond W. Yeung Dept.
More informationEnergy Efficient Estimation of Gaussian Sources Over Inhomogeneous Gaussian MAC Channels
Energy Efficient Estimation of Gaussian Sources Over Inhomogeneous Gaussian MAC Channels Shuangqing Wei, Ragopal Kannan, Sitharama Iyengar and Nageswara S. Rao Abstract In this paper, we first provide
More informationThe Gaussian Many-Help-One Distributed Source Coding Problem Saurabha Tavildar, Pramod Viswanath, Member, IEEE, and Aaron B. Wagner, Member, IEEE
564 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 1, JANUARY 2010 The Gaussian Many-Help-One Distributed Source Coding Problem Saurabha Tavildar, Pramod Viswanath, Member, IEEE, and Aaron B. Wagner,
More informationInformation Theory. Lecture 10. Network Information Theory (CT15); a focus on channel capacity results
Information Theory Lecture 10 Network Information Theory (CT15); a focus on channel capacity results The (two-user) multiple access channel (15.3) The (two-user) broadcast channel (15.6) The relay channel
More informationAn Alternative Proof of Channel Polarization for Channels with Arbitrary Input Alphabets
An Alternative Proof of Channel Polarization for Channels with Arbitrary Input Alphabets Jing Guo University of Cambridge jg582@cam.ac.uk Jossy Sayir University of Cambridge j.sayir@ieee.org Minghai Qin
More informationOn Source-Channel Communication in Networks
On Source-Channel Communication in Networks Michael Gastpar Department of EECS University of California, Berkeley gastpar@eecs.berkeley.edu DIMACS: March 17, 2003. Outline 1. Source-Channel Communication
More informationCapacity Region of Reversely Degraded Gaussian MIMO Broadcast Channel
Capacity Region of Reversely Degraded Gaussian MIMO Broadcast Channel Jun Chen Dept. of Electrical and Computer Engr. McMaster University Hamilton, Ontario, Canada Chao Tian AT&T Labs-Research 80 Park
More informationInformation Theory Meets Game Theory on The Interference Channel
Information Theory Meets Game Theory on The Interference Channel Randall A. Berry Dept. of EECS Northwestern University e-mail: rberry@eecs.northwestern.edu David N. C. Tse Wireless Foundations University
More informationOn Side-Informed Coding of Noisy Sensor Observations
On Side-Informed Coding of Noisy Sensor Observations Chao Yu and Gaurav Sharma C Dept, University of Rochester, Rochester NY 14627 ABSTRACT In this paper, we consider the problem of side-informed coding
More informationReliable Computation over Multiple-Access Channels
Reliable Computation over Multiple-Access Channels Bobak Nazer and Michael Gastpar Dept. of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley, CA, 94720-1770 {bobak,
More informationQUANTIZATION FOR DISTRIBUTED ESTIMATION IN LARGE SCALE SENSOR NETWORKS
QUANTIZATION FOR DISTRIBUTED ESTIMATION IN LARGE SCALE SENSOR NETWORKS Parvathinathan Venkitasubramaniam, Gökhan Mergen, Lang Tong and Ananthram Swami ABSTRACT We study the problem of quantization for
More informationOn the Capacity of the Interference Channel with a Relay
On the Capacity of the Interference Channel with a Relay Ivana Marić, Ron Dabora and Andrea Goldsmith Stanford University, Stanford, CA {ivanam,ron,andrea}@wsl.stanford.edu Abstract Capacity gains due
More informationLin Song Shuo Shao Jun Chen. 11 September 2013
and Result in Song Shuo Shao 11 September 2013 1 / 33 Two s and Result n S Encoder 1: f1 R 1 Decoder: Decoder: g 1 g1,2 d 1 1 1,2 d1,2 Encoder 2: f Encoder 2 R 2 Decoder: g 2 Decoder d 2 2 2 / 33 Two s
More informationSum Capacity of General Deterministic Interference Channel with Channel Output Feedback
Sum Capacity of General Deterministic Interference Channel with Channel Output Feedback Achaleshwar Sahai Department of ECE, Rice University, Houston, TX 775. as27@rice.edu Vaneet Aggarwal Department of
More informationLecture 5 Channel Coding over Continuous Channels
Lecture 5 Channel Coding over Continuous Channels I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw November 14, 2014 1 / 34 I-Hsiang Wang NIT Lecture 5 From
More informationSimultaneous Nonunique Decoding Is Rate-Optimal
Fiftieth Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 1-5, 2012 Simultaneous Nonunique Decoding Is Rate-Optimal Bernd Bandemer University of California, San Diego La Jolla, CA
More informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 62, NO. 5, MAY
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 6, NO. 5, MAY 06 85 Duality of a Source Coding Problem and the Semi-Deterministic Broadcast Channel With Rate-Limited Cooperation Ziv Goldfeld, Student Member,
More informationSCALABLE AUDIO CODING USING WATERMARKING
SCALABLE AUDIO CODING USING WATERMARKING Mahmood Movassagh Peter Kabal Department of Electrical and Computer Engineering McGill University, Montreal, Canada Email: {mahmood.movassagh@mail.mcgill.ca, peter.kabal@mcgill.ca}
More informationCut-Set Bound and Dependence Balance Bound
Cut-Set Bound and Dependence Balance Bound Lei Xiao lxiao@nd.edu 1 Date: 4 October, 2006 Reading: Elements of information theory by Cover and Thomas [1, Section 14.10], and the paper by Hekstra and Willems
More informationOn the Capacity Region of the Gaussian Z-channel
On the Capacity Region of the Gaussian Z-channel Nan Liu Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 74 nkancy@eng.umd.edu ulukus@eng.umd.edu
More informationEnergy State Amplification in an Energy Harvesting Communication System
Energy State Amplification in an Energy Harvesting Communication System Omur Ozel Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland College Park, MD 20742 omur@umd.edu
More informationSide-information Scalable Source Coding
Side-information Scalable Source Coding Chao Tian, Member, IEEE, Suhas N. Diggavi, Member, IEEE Abstract The problem of side-information scalable (SI-scalable) source coding is considered in this work,
More informationOn Lossless Coding With Coded Side Information Daniel Marco, Member, IEEE, and Michelle Effros, Fellow, IEEE
3284 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 7, JULY 2009 On Lossless Coding With Coded Side Information Daniel Marco, Member, IEEE, Michelle Effros, Fellow, IEEE Abstract This paper considers
More informationComputing sum of sources over an arbitrary multiple access channel
Computing sum of sources over an arbitrary multiple access channel Arun Padakandla University of Michigan Ann Arbor, MI 48109, USA Email: arunpr@umich.edu S. Sandeep Pradhan University of Michigan Ann
More informationProblemsWeCanSolveWithaHelper
ITW 2009, Volos, Greece, June 10-12, 2009 ProblemsWeCanSolveWitha Haim Permuter Ben-Gurion University of the Negev haimp@bgu.ac.il Yossef Steinberg Technion - IIT ysteinbe@ee.technion.ac.il Tsachy Weissman
More informationOptimal Power Control in Decentralized Gaussian Multiple Access Channels
1 Optimal Power Control in Decentralized Gaussian Multiple Access Channels Kamal Singh Department of Electrical Engineering Indian Institute of Technology Bombay. arxiv:1711.08272v1 [eess.sp] 21 Nov 2017
More informationEquivalence for Networks with Adversarial State
Equivalence for Networks with Adversarial State Oliver Kosut Department of Electrical, Computer and Energy Engineering Arizona State University Tempe, AZ 85287 Email: okosut@asu.edu Jörg Kliewer Department
More informationRemote Source Coding with Two-Sided Information
Remote Source Coding with Two-Sided Information Basak Guler Ebrahim MolavianJazi Aylin Yener Wireless Communications and Networking Laboratory Department of Electrical Engineering The Pennsylvania State
More informationInterference Channel aided by an Infrastructure Relay
Interference Channel aided by an Infrastructure Relay Onur Sahin, Osvaldo Simeone, and Elza Erkip *Department of Electrical and Computer Engineering, Polytechnic Institute of New York University, Department
More informationDispersion of the Gilbert-Elliott Channel
Dispersion of the Gilbert-Elliott Channel Yury Polyanskiy Email: ypolyans@princeton.edu H. Vincent Poor Email: poor@princeton.edu Sergio Verdú Email: verdu@princeton.edu Abstract Channel dispersion plays
More informationRegenerating Codes and Locally Recoverable. Codes for Distributed Storage Systems
Regenerating Codes and Locally Recoverable 1 Codes for Distributed Storage Systems Yongjune Kim and Yaoqing Yang Abstract We survey the recent results on applying error control coding to distributed storage
More informationDesign of Optimal Quantizers for Distributed Source Coding
Design of Optimal Quantizers for Distributed Source Coding David Rebollo-Monedero, Rui Zhang and Bernd Girod Information Systems Laboratory, Electrical Eng. Dept. Stanford University, Stanford, CA 94305
More informationTHIS paper addresses the quadratic Gaussian two-encoder
1938 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 54, NO 5, MAY 2008 Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem Aaron B Wagner, Member, IEEE, Saurabha Tavildar, Pramod Viswanath,
More informationCases Where Finding the Minimum Entropy Coloring of a Characteristic Graph is a Polynomial Time Problem
Cases Where Finding the Minimum Entropy Coloring of a Characteristic Graph is a Polynomial Time Problem Soheil Feizi, Muriel Médard RLE at MIT Emails: {sfeizi,medard}@mit.edu Abstract In this paper, we
More informationOn Multiple User Channels with State Information at the Transmitters
On Multiple User Channels with State Information at the Transmitters Styrmir Sigurjónsson and Young-Han Kim* Information Systems Laboratory Stanford University Stanford, CA 94305, USA Email: {styrmir,yhk}@stanford.edu
More informationShannon s noisy-channel theorem
Shannon s noisy-channel theorem Information theory Amon Elders Korteweg de Vries Institute for Mathematics University of Amsterdam. Tuesday, 26th of Januari Amon Elders (Korteweg de Vries Institute for
More informationLayered Synthesis of Latent Gaussian Trees
Layered Synthesis of Latent Gaussian Trees Ali Moharrer, Shuangqing Wei, George T. Amariucai, and Jing Deng arxiv:1608.04484v2 [cs.it] 7 May 2017 Abstract A new synthesis scheme is proposed to generate
More informationThe Gallager Converse
The Gallager Converse Abbas El Gamal Director, Information Systems Laboratory Department of Electrical Engineering Stanford University Gallager s 75th Birthday 1 Information Theoretic Limits Establishing
More informationMismatched Multi-letter Successive Decoding for the Multiple-Access Channel
Mismatched Multi-letter Successive Decoding for the Multiple-Access Channel Jonathan Scarlett University of Cambridge jms265@cam.ac.uk Alfonso Martinez Universitat Pompeu Fabra alfonso.martinez@ieee.org
More informationNoise-Shaped Predictive Coding for Multiple Descriptions of a Colored Gaussian Source
Noise-Shaped Predictive Coding for Multiple Descriptions of a Colored Gaussian Source Yuval Kochman, Jan Østergaard, and Ram Zamir Abstract It was recently shown that the symmetric multiple-description
More informationCapacity Region of the Permutation Channel
Capacity Region of the Permutation Channel John MacLaren Walsh and Steven Weber Abstract We discuss the capacity region of a degraded broadcast channel (DBC) formed from a channel that randomly permutes
More informationSecure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel
Secure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel Pritam Mukherjee Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 074 pritamm@umd.edu
More informationConstellation Shaping for Communication Channels with Quantized Outputs
Constellation Shaping for Communication Channels with Quantized Outputs Chandana Nannapaneni, Matthew C. Valenti, and Xingyu Xiang Lane Department of Computer Science and Electrical Engineering West Virginia
More informationII. THE TWO-WAY TWO-RELAY CHANNEL
An Achievable Rate Region for the Two-Way Two-Relay Channel Jonathan Ponniah Liang-Liang Xie Department of Electrical Computer Engineering, University of Waterloo, Canada Abstract We propose an achievable
More informationApproximately achieving the feedback interference channel capacity with point-to-point codes
Approximately achieving the feedback interference channel capacity with point-to-point codes Joyson Sebastian*, Can Karakus*, Suhas Diggavi* Abstract Superposition codes with rate-splitting have been used
More informationQuantization for Distributed Estimation
0 IEEE International Conference on Internet of Things ithings 0), Green Computing and Communications GreenCom 0), and Cyber-Physical-Social Computing CPSCom 0) Quantization for Distributed Estimation uan-yu
More informationMinimum Expected Distortion in Gaussian Source Coding with Uncertain Side Information
Minimum Expected Distortion in Gaussian Source Coding with Uncertain Side Information Chris T. K. Ng, Chao Tian, Andrea J. Goldsmith and Shlomo Shamai (Shitz) Dept. of Electrical Engineering, Stanford
More informationFeedback Capacity of the Gaussian Interference Channel to Within Bits: the Symmetric Case
1 arxiv:0901.3580v1 [cs.it] 23 Jan 2009 Feedback Capacity of the Gaussian Interference Channel to Within 1.7075 Bits: the Symmetric Case Changho Suh and David Tse Wireless Foundations in the Department
More informationDuality Between Channel Capacity and Rate Distortion With Two-Sided State Information
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 6, JUNE 2002 1629 Duality Between Channel Capacity Rate Distortion With Two-Sided State Information Thomas M. Cover, Fellow, IEEE, Mung Chiang, Student
More information