Universal Minimax Discrete Denoising under Channel Uncertainty
George Gemelos, Styrmir Sigurjonsson, Tsachy Weissman
Abstract
The goal of a denoising algorithm is to recover a signal from its noise-corrupted observations. Perfect recovery is seldom possible and performance is measured under a given single-letter fidelity criterion. For discrete signals corrupted by a known discrete memoryless channel, the DUDE was recently shown to perform this task asymptotically optimally, without knowledge of the statistical properties of the source. In the present work we address the scenario where, in addition to the lack of knowledge of the source statistics, there is also uncertainty in the channel characteristics. We propose a family of discrete denoisers and establish their asymptotic optimality under a minimax performance criterion which we argue is appropriate for this setting. As we show elsewhere, the proposed schemes can also be implemented computationally efficiently.
Create a lesson
Related papers
Galois Hulls of Generalized Roth-Lempel Codes and Their Applications to EAQECCs
Xuefei Wu, Qi Liu, Yingchun Chen et al.
Maximum Entropy Probability Distributions on Spheres with Fixed Mean Busemann Function and Holomorphic-Information-Geometric Model of Cognition
Vladimir Jacimovic
Norm-One Torus Decompositions and Decoding of Gashkov-Sidel'nikov Codes
Minjia Shi, Shitao Li, Yuhong Xia et al.
A Mirror Vanishing Band for Weight Distributions of Binary Linear Codes
Xianmang He
Tri-Hybrid Beamforming Design for Large-Scale MIMO ISAC Systems
Tianyu Fang, Mengyuan Ma, Markku Juntti et al.
Equivalence Between Nested Gibbs Measures and Log-Linear Combinations of Gibbs Measures
Yaiza Bermudez, Samir M. Perlaza, Iñaki Esnaola