Strong data processing inequalities in power-constrained Gaussian channels
Author(s)
Calmon, Flavio P.; Polyanskiy, Yury; Wu, Yihong
DownloadPolyanskiy_Strong data.pdf (169.2Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
This work presents strong data processing results for the power-constrained additive Gaussian channel. Explicit bounds on the amount of decrease of mutual information under convolution with Gaussian noise are shown. The analysis leverages the connection between information and estimation (I-MMSE) and the following estimation-theoretic result of independent interest. It is proved that any random variable for which there exists an almost optimal (in terms of the mean-squared error) linear estimator operating on the Gaussian-corrupted measurement must necessarily be almost Gaussian (in terms of the Kolmogorov-Smirnov distance).
Date issued
2015-06Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Proceedings of the 2015 IEEE International Symposium on Information Theory (ISIT)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Calmon, Flavio P., Yury Polyanskiy, and Yihong Wu. “Strong Data Processing Inequalities in Power-Constrained Gaussian Channels.” 2015 IEEE International Symposium on Information Theory (ISIT) (June 2015).
Version: Author's final manuscript
ISBN
978-1-4673-7704-1