English
Related papers

Related papers: Rate-distortion function via minimum mean square e…

200 papers

The error exponent of fixed-length lossy source coding was established by Marton. Ahlswede showed that this exponent can be discontinuous at a rate $R$, depending on the probability distribution $P$ of the given information source and the…

Information Theory · Computer Science 2023-04-25 Yutaka Jitsumatsu

The Gauss-Markov source produces $U_i = aU_{i-1} + Z_i$ for $i\geq 1$, where $U_0 = 0$, $|a|<1$ and $Z_i\sim\mathcal{N}(0, \sigma^2)$ are i.i.d. Gaussian random variables. We consider lossy compression of a block of $n$ samples of the…

Information Theory · Computer Science 2019-09-26 Peida Tian , Victoria Kostina

The relation between rate distortion function (RDF) and Bayesian filtering theory is discussed. The relation is established by imposing a causal or realizability constraint on the reconstruction conditional distribution of the RDF, leading…

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

In this paper, we study the computation of the rate-distortion-perception function (RDPF) for discrete memoryless sources subject to a single-letter average distortion constraint and a perception constraint that belongs to the family of…

Information Theory · Computer Science 2023-05-09 Giuseppe Serra , Photios A. Stavrou , Marios Kountouris

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 setup involving zero-delay sequential transmission of a vector Markov source over a burst erasure channel is studied. A sequence of source vectors is compressed in a causal fashion at the encoder, and the resulting output is transmitted…

Information Theory · Computer Science 2014-10-10 Farrokh Etezadi , Ashish Khisti , Mitchell Trott

This paper deals with arbitrarily distributed finite-power input signals observed through an additive Gaussian noise channel. It shows a new formula that connects the input-output mutual information and the minimum mean-square error (MMSE)…

Information Theory · Computer Science 2007-07-13 Dongning Guo , Shlomo Shamai , Sergio Verdu

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

Structural similarity (SSIM)-based distortion $D_\text{SSIM}$ is more consistent with human perception than the traditional mean squared error $D_\text{MSE}$. To achieve better video quality, many studies on optimal bit allocation (OBA) and…

Multimedia · Computer Science 2021-04-06 Yang Li , Xuanqin Mou

The Shannon lower bound is one of the few lower bounds on the rate-distortion function that holds for a large class of sources. In this paper, it is demonstrated that its gap to the rate-distortion function vanishes as the allowed…

Information Theory · Computer Science 2016-11-17 Tobias Koch

A Delta-Sigma modulator that is often utilized to convert analog signals into digital signals can be modeled as a static uniform quantizer with an error feedback filter. In this paper, we present a rate-distortion analysis of quantizers…

Systems and Control · Computer Science 2017-10-11 Shuichi Ohno , Teruyuki Shiraki , M. Rizwan Tariq , Masaaki Nagahara

The enormous size of modern deep neural networks makes it challenging to deploy those models in memory and communication limited scenarios. Thus, compressing a trained model without a significant loss in performance has become an…

Information Theory · Computer Science 2019-01-25 Weihao Gao , Yu-Han Liu , Chong Wang , Sewoong Oh

The amount of information lost in sub-Nyquist sampling of a continuous-time Gaussian stationary process is quantified. We consider a combined source coding and sub-Nyquist reconstruction problem in which the input to the encoder is a noisy…

Information Theory · Computer Science 2016-01-26 Alon Kipnis , Andrea J. Goldsmith , Yonina C. Eldar , Tsachy Weissman

In this paper, we consider the rate-distortion-perception (RDP) trade-off for the lossy compression of a Bernoulli vector source, which is a finite collection of independent binary random variables. The RDP function quantifies in a way the…

Information Theory · Computer Science 2025-01-22 Praneeth Kumar Vippathalla , Mihai-Alin Badiu , Justin P. Coon

The source-coding problem with side information at the decoder is studied subject to a constraint that the encoder---to whom the side information is unavailable---be able to compute the decoder's reconstruction sequence to within some…

Information Theory · Computer Science 2016-11-15 Amos Lapidoth , Andreas Malär , Michèle Wigger

Shannon's rate-distortion theory treats source symbols as unstructured labels. When the source is a knowledge base equipped with a logical proof system, a natural fidelity criterion is closure fidelity: a reconstruction is acceptable if it…

Information Theory · Computer Science 2026-04-14 Jianfeng Xu

Two-port demodulation reference signals (DMRS) have been employed in new radio (NR) recently. In this paper, we firstly propose a minimum mean square error (MMSE) scheme with full priori knowledge (F-MMSE) to achieve the channel estimation…

Signal Processing · Electrical Eng. & Systems 2021-05-04 Dejin Kong , Xiang-Gen Xia , Pei Liu , Qibiao Zhu

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

In Sequential Massive Random Access (SMRA), a set of correlated sources is jointly encoded and stored on a server, and clients want to access to only a subset of the sources. Since the number of simultaneous clients can be huge, the server…

Information Theory · Computer Science 2018-01-18 Elsa Dupraz , Thomas Maugey , Aline Roumy , Michel Kieffer

We investigate the Wyner-Ziv coding in which the statistics of the principal source is known but the statistics of the channel generating the side-information is unknown except that it is in a certain class. The class consists of channels…

Information Theory · Computer Science 2013-05-06 Shun Watanabe , Shigeaki Kuzuoka