English
Related papers

Related papers: Vector Gaussian CEO Problem Under Logarithmic Loss…

200 papers

In this paper, we consider a distributed remote source coding problem, where a sequence of observations of source vectors is available at the encoder. The problem is to specify the optimal rate for encoding the observations subject to a…

Information Theory · Computer Science 2014-06-05 Adel Zahedi , Jan Ostergaard , Soren Holdt Jensen , Patrick Naylor , Soren Bech

This paper investigates the joint compression problem of a vector Gaussian source, where an individual distortion constraint is imposed on each source component. It is known that the rate-distortion function (RDF) is lower-bounded by the…

Information Theory · Computer Science 2026-02-09 Shuao Chen , Junyuan Gao , Yuxuan Shi , Yongpeng Wu , Giuseppe Caire , H. Vincent Poor , Wenjun Zhang

A comparison between the joint and the successive decoding schemes for a two-link case binary Chief Executive Officer (CEO) problem is presented. We utilize the logarithmic loss as the criterion for measuring and comparing the total…

Information Theory · Computer Science 2020-04-14 Mahdi Nangir , Jafar Pourrostam , Javad Musevi Niya , Behzad Mozaffari Tazehkand

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 determine the rate region of the vector Gaussian one-helper source-coding problem under a covariance matrix distortion constraint. The rate region is achieved by a simple scheme that separates the lossy vector quantization from the…

Information Theory · Computer Science 2011-12-30 Md. Saifur Rahman , Aaron B. Wagner

We study the rate-distortion problem for both scalar and vector memoryless heavy-tailed $\alpha$-stable sources ($0 < \alpha < 2$). Using a recently defined notion of ``strength" as a power measure, we derive the rate-distortion function…

Information Theory · Computer Science 2026-02-27 Karim Ezzeddine , Jihad Fahs , Ibrahim Abou-Faycal

We consider the problem of information embedding where the encoder modifies a white Gaussian host signal in a power-constrained manner to encode the message, and the decoder recovers both the embedded message and the modified host signal.…

Information Theory · Computer Science 2016-11-17 Pulkit Grover , Aaron B. Wagner , Anant Sahai

In the metric distortion problem there is a set of candidates $C$ and voters $V$ in the same metric space. The goal is to select a candidate minimizing the social cost: the sum of distances of the selected candidate from all the voters, and…

Computer Science and Game Theory · Computer Science 2024-07-12 Ben Berger , Michal Feldman , Vasilis Gkatzelis , Xizhi Tan

We study strategic Gaussian semantic compression under rate and compute constraints, where an encoder and decoder optimize distinct quadratic objectives. A latent Gaussian state generates a task dependent semantic variable, and the decoder…

Information Theory · Computer Science 2026-02-05 Emrah Akyol

We study stochastic team problems with static information structure where we assume controllers have linear information and quadratic cost but allow the noise to be from a non-Gaussian class. When the noise is Gaussian, it is well known…

Optimization and Control · Mathematics 2019-01-01 Ankur A. Kulkarni

Jointly Gaussian memoryless sources are observed at N distinct terminals. The goal is to efficiently encode the observations in a distributed fashion so as to enable reconstruction of any one of the observations, say the first one, at the…

Information Theory · Computer Science 2008-05-14 Saurabha Tavildar , Pramod Viswanath , Aaron B. Wagner

An encoder, subject to a rate constraint, wishes to describe a Gaussian source under squared error distortion. The decoder, besides receiving the encoder's description, also observes side information consisting of uncompressed source symbol…

Information Theory · Computer Science 2013-05-10 Chris T. K. Ng , Chao Tian , Andrea J. Goldsmith , Shlomo Shamai

A distributed lossy compression network with $L$ encoders and a decoder is considered. Each encoder observes a source and sends a compressed version to the decoder. The decoder produces a joint reconstruction of target signals with the mean…

Information Theory · Computer Science 2022-06-06 Siyao Zhou , Sadaf Salehkalaibar , Jingjing Qian , Jun Chen , Wuxian Shi , Yiqun Ge , Wen Tong

We consider a multiterminal source coding problem in which a source is estimated at a central processing unit from lossy-compressed remote observations. Each lossy-encoded observation is produced by a remote sensor which obtains a noisy…

Information Theory · Computer Science 2016-05-13 Ruiyang Song , Stefano Rini , Alon Kipnis , Andrea J. Goldsmith

We consider the distributed source coding system for $L$ correlated Gaussian observations $Y_i, i=1,2, ..., L$. Let $X_i,i=1,2, ..., L$ be $L$ correlated Gaussian random variables and $N_i,$ $i=1,2,... L$ be independent additive Gaussian…

Information Theory · Computer Science 2009-08-09 Yasutada Oohama

The rate-distortion saddle-point problem considered by Lapidoth (1997) consists in finding the minimum rate to compress an arbitrary ergodic source when one is constrained to use a random Gaussian codebook and minimum (Euclidean) distance…

Information Theory · Computer Science 2018-09-03 Lin Zhou , Vincent Y. F. Tan , Mehul Motani

We consider the distributed source coding system of $L$ correlated Gaussian sources $Y_i,i=1,2,...,L$ which are noisy observations of correlated Gaussian remote sources $X_k, k=1,2,...,K$. We assume that $Y^{L}={}^{\rm t}(Y_1,Y_2,$ $...,…

Information Theory · Computer Science 2011-02-21 Yasutada Oohama

We consider the transmission of a memoryless bivariate Gaussian source over an average-power-constrained one-to-two Gaussian broadcast channel. The transmitter observes the source and describes it to the two receivers by means of an…

Information Theory · Computer Science 2009-03-20 Shraga Bross , Amos Lapidoth , Stephan Tinguely

We introduce a distributed source coding scheme called successive Wyner-Ziv coding. We show that any point in the rate region of the quadratic Gaussian CEO problem can be achieved via the successive Wyner-Ziv coding. The concept of…

Information Theory · Computer Science 2016-11-17 Jun Chen , Toby Berger

Asymptotic energy-distortion performance of zero-delay communication scenarios under additive white Gaussian noise is investigated. Using high-resolution analysis for quantizer design, the higher-order term in the logarithm of the…

Information Theory · Computer Science 2018-01-01 Ceren Sevinç , Ertem Tuncel