English
Related papers

Related papers: A Framework for Robust Lossy Compression of Heavy-…

200 papers

We investigate the upper and lower bounds on the quantization distortions for independent and identically distributed sources in the finite block-length regime. Based on the convex optimization framework of the rate-distortion theory, we…

Information Theory · Computer Science 2013-06-21 Chen Gong , Xiaodong Wang

A composite source, consisting of multiple subsources and a memoryless switch, outputs one symbol at a time from the subsource selected by the switch. If some data should be encoded more accurately than other data from an information…

Information Theory · Computer Science 2024-11-14 Jiakun Liu , H. Vincent Poor , Iickho Song , Wenyi Zhang

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ć

Consider a lossy compression system with $\ell$ distributed encoders and a centralized decoder. Each encoder compresses its observed source and forwards the compressed data to the decoder for joint reconstruction of the target signals under…

Information Theory · Computer Science 2018-07-19 Yizhong Wang , Li Xie , Xuan Zhang , Jun Chen

We consider the k-encoder source coding problem with a quadratic distortion measure. We show that among all source distributions with a given covariance matrix K, the jointly Gaussian source requires the highest rates in order to meet a…

Information Theory · Computer Science 2016-11-15 Ilan Shomorony , A. Salman Avestimehr , Himanshu Asnani , Tsachy Weissman

We consider optimal scalar quantization with $r$th power distortion and constrained R\'enyi entropy of order $\alpha$. For sources with an absolutely continuous distribution the high rate asymptotics of the quantizer distortion has long…

Information Theory · Computer Science 2011-07-06 Wolfgang Kreitmeier , Tamas Linder

New bounds on the rate distortion function of certain non-Gaussian sources, with a proportional-weighted mean-square error (MSE) distortion measure, are given. The growth, g, of the rate distortion function, as a result of changing from a…

Information Theory · Computer Science 2007-07-13 Jacob Binia

We examine the coordinated and universal rate-efficient sampling of a subset of correlated discrete memoryless sources followed by lossy compression of the sampled sources. The goal is to reconstruct a predesignated subset of sources within…

Information Theory · Computer Science 2017-06-23 Vinay Praneeth Boda , Prakash Narayan

This paper considers the problem of lossy compression for the computation of a function of two correlated sources, both of which are observed at the encoder. Due to presence of observation costs, the encoder is allowed to observe only…

Information Theory · Computer Science 2013-07-22 Xi Liu , Osvaldo Simeone , Elza Erkip

We propose computationally efficient encoders and decoders for lossy compression using a Sparse Regression Code. The codebook is defined by a design matrix and codewords are structured linear combinations of columns of this matrix. The…

Information Theory · Computer Science 2014-05-20 Ramji Venkataramanan , Tuhin Sarkar , Sekhar Tatikonda

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

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

We study the problem of computing the rate-distortion function for sources with feed-forward and the capacity for channels with feedback. The formulas (involving directed information) for the optimal rate-distortion function with…

Information Theory · Computer Science 2007-07-18 Ramji Venkataramanan , S. Sandeep Pradhan

We characterize the rate-distortion function for zero-mean stationary Gaussian sources under the MSE fidelity criterion and subject to the additional constraint that the distortion is uncorrelated to the input. The solution is given by two…

Information Theory · Computer Science 2008-01-14 Milan S. Derpich , Jan Ostergaard , Graham C. Goodwin

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

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

A new source model, which consists of an intrinsic state part and an extrinsic observation part, is proposed and its information-theoretic characterization, namely its rate-distortion function, is defined and analyzed. Such a source model…

Information Theory · Computer Science 2022-06-02 Jiakun Liu , Shuo Shao , Wenyi Zhang , H. Vincent Poor

The distortion-rate function of output-constrained lossy source coding with limited common randomness is analyzed for the special case of squared error distortion measure. An explicit expression is obtained when both source and…

Information Theory · Computer Science 2024-03-25 Li Xie , Liangyan Li , Jun Chen , Zhongshan Zhang

Consider a pair of correlated Gaussian sources (X1,X2). Two separate encoders observe the two components and communicate compressed versions of their observations to a common decoder. The decoder is interested in reconstructing a linear…

Information Theory · Computer Science 2007-07-25 D. Krithivasan , S. S. Pradhan

In this monograph, we review recent advances in second-order asymptotics for lossy source coding, which provides approximations to the finite blocklength performance of optimal codes. The monograph is divided into three parts. In part I, we…

Information Theory · Computer Science 2024-10-25 Lin Zhou , Mehul Motani
‹ Prev 1 2 3 10 Next ›