Upper-Bounding Rate Distortion Functions based on the Minimum Mean-Square Error

Authors

M. Dörpinghaus, M. Rüngeler, R. Mathar,

Abstract

        We derive a new upper bound on the rate distortion function for arbitrary memoryless sources, which is based on the relation between mutual information and minimum mean-square error discovered by Guo et al. This upper bound is in general tighter than the well known upper bound given by the rate distortion function of a Gaussian source with an equal variance found by Shannon and becomes tight for Gaussian sources. We evaluate the new upper bound for various source distributions and compare it to the Shannon lower and upper bound and to the rate distortion function calculated with the Blahut Arimoto algorithm. This shows that the new upper bound is quite tight.

Additional Ressources

A Matlab tool to calculate the new upper bound on the rate distortion function can be found here.

BibTEX Reference Entry 

@inproceedings{DoRuMa12,
	author = {Meik D{\"o}rpinghaus and Matthias R{\"u}ngeler and Rudolf Mathar},
	title = "Upper-Bounding Rate Distortion Functions based on the Minimum Mean-Square Error",
	pages = "28-31",
	booktitle = "International Zurich Seminar on Communications",
	address = {Zurich, Switzerland},
	doi = http://dx.doi.org/10.3929/ethz-a-007071675,
	month = Feb,
	year = 2012,
	hsb = hsb999910135994,
	}

Downloads

 Download paper  Download bibtex-file

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights there in are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.