English
Related papers

Related papers: Achieving the Gaussian Rate-Distortion Function by…

200 papers

An achievable rate region, based on lattice interference alignment, is derived for a class of time-invariant Gaussian interference channels with more than two users. The result is established via a new coding theorem for the two-user…

Information Theory · Computer Science 2011-06-21 Or Ordentlich , Uri Erez

Direct evaluation of the rate-distortion function has rarely been achieved when it is strictly greater than its Shannon lower bound. In this paper, we consider the rate-distortion function for the distortion measure defined by an…

Information Theory · Computer Science 2013-02-27 Kazuho Watanabe

We extend the recent analysis of the rate-reliability tradeoff in deterministic identification (DI) to general linear Gaussian channels, marking the first such analysis for channels with continuous output. Because DI provides a framework…

Information Theory · Computer Science 2026-02-13 Pau Colomer , Christian Deppe , Holger Boche , Andreas Winter

We revisit the Gray-Wyner lossy source coding problem and derive the first-order asymptotic optimal rate-distortion-perception region when additional perception constraints are imposed on reproduced source sequences. The optimal trade-off…

Information Theory · Computer Science 2026-01-19 Yu Yang , Yingxin Zhang , Weijie Yuan , Lin Zhou

We investigate whether uncoded schemes are optimal for Gaussian sources on multiuser Gaussian channels. Particularly, we consider two problems: the first is to send correlated Gaussian sources on a Gaussian broadcast channel where each…

Information Theory · Computer Science 2017-03-02 Chao Tian , Jun Chen , Suhas Diggavi , Shlomo Shamai

We consider the problem of rate allocation in a fading Gaussian multiple-access channel (MAC) with fixed transmission powers. Our goal is to maximize a general concave utility function of transmission rates over the throughput capacity…

Information Theory · Computer Science 2008-10-08 Ali ParandehGheibi , Atilla Eryilmaz , Asuman Ozdaglar , Muriel Medard

This paper investigates a lossy source coding problem in which two decoders can access their side-information respectively. The correlated sources are a product of two component correlated sources, and we exclusively investigate the case…

Information Theory · Computer Science 2013-05-29 Shun Watanabe

We study a large deviation functional of density fluctuation by analyzing stochastic non-linear diffusion equations driven by the difference between the densities fixed at the boundaries. By using a fundamental equality that yields the…

Statistical Mechanics · Physics 2009-11-13 Shin-ichi Sasa

The objective of this paper is to further investigate various applications of information Nonanticipative Rate Distortion Function (NRDF) by discussing two working examples, the Binary Symmetric Markov Source with parameter $p$ (BSMS($p$))…

Information Theory · Computer Science 2014-04-30 Photios A. Stavrou , Christos K. Kourtellaris , Charalambos D. Charalambous

It is shown how the Canonical Function approach can be used to obtain accurate solutions for the distorted wave problem taking account of direct static and polarisation potentials and exact non-local exchange. Calculations are made for…

Quantum Physics · Physics 2007-05-23 K. Fakhreddine , R. J. Tweed , G. Nguyen Vien , C. Tannous , J. Langlois , O. Robaux

We consider a linear Gaussian noise channel used with delayed feedback. The channel noise is assumed to be a ARMA (autoregressive and/or moving average) process. We reformulate the Gaussian noise channel into an intersymbol interference…

Information Theory · Computer Science 2007-07-13 Shaohua Yang , Aleksandar Kavcic

As shown by M\'edard, the capacity of fading channels with imperfect channel-state information (CSI) can be lower-bounded by assuming a Gaussian channel input $X$ with power $P$ and by upper-bounding the conditional entropy $h(X|Y,\hat{H})$…

Information Theory · Computer Science 2016-11-15 Adriano Pastore , Tobias Koch , Javier Rodríguez Fonollosa

We consider a rate-distortion problem with side information at multiple decoders. Several upper and lower bounds have been proposed for this general problem or special cases of it. We provide an upper bound for general instances of this…

Information Theory · Computer Science 2016-12-13 Sinem Unal , Aaron B. Wagner

This paper derives an achievable rate-distortion (R-D) region for the state-dependent discrete memoryless multiple access channel (SD-DMMAC), where the generalized feedback and causal side information are present at encoders, and the…

Information Theory · Computer Science 2024-09-27 Xinyang Li , Vlad C. Andrei , Ullrich J. Mönich , Holger Boche

Transformers achieve superior performance on many tasks, but impose heavy compute and memory requirements during inference. This inference can be made more efficient by partitioning the process across multiple devices, which, in turn,…

Machine Learning · Computer Science 2026-04-21 Anderson de Andrade , Alon Harell , Ivan V. Bajić

We introduce a parametric form of pooling, based on a Gaussian, which can be optimized alongside the features in a single global objective function. By contrast, existing pooling schemes are based on heuristics (e.g. local maximum) and have…

Computer Vision and Pattern Recognition · Computer Science 2012-07-03 Matthew D. Zeiler , Rob Fergus

Parallel, additive white Gaussian noise (AWGN) channels with an average sum power constraint are considered. It is shown how the waterfilling Shannon capacity can be approached by higher order modulation and probabilistic amplitude shaping…

Information Theory · Computer Science 2018-04-06 Fabian Steiner , Georg Böcherer , Patrick Schulte

The rate-distortion curve captures the fundamental tradeoff between compression length and resolution in lossy data compression. However, it conceals the underlying dynamics of optimal source encodings or test channels. We argue that these…

Information Theory · Computer Science 2023-07-03 Shlomi Agmon

The additive rate-distortion function (ARDF) was developed in order to universally bound the rate loss in the Wyner-Ziv problem, and has since then been instrumental in e.g., bounding the rate loss in successive refinements, universal…

Information Theory · Computer Science 2011-05-26 Jan Ostergaard , Ram Zamir

We consider rate-distortion with two decoders, each with distinct side information. This problem is well understood when the side information at the decoders satisfies a certain degradedness condition. We consider cases in which this…

Information Theory · Computer Science 2016-12-13 Sinem Unal , Aaron B. Wagner
‹ Prev 1 3 4 5 6 7 10 Next ›