On the optimality of symbol-by-symbol filtering and denoising

DOI10.1109/TIT.2005.860432MaRDI QIDQ3547434zbMATH OpenOpenAlexFDO

Authors Erik Ordentlich, Tsachy Weissman

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2005.860432

Mathematics Subject Classification ID

Inference from stochastic processes and prediction (62M20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Signal detection and filtering (aspects of stochastic processes) (60G35)

Recommendations

• Denoising and Filtering Under the Probability of Excess Loss Criterion
• Discrete optimal filtering
• On error-free filtering of some stationary processes
• A confidence-set approach to signal denoising
• Universal Filtering Via Hidden Markov Modeling

Cited in

(5)

• Asymptotics of input-constrained binary symmetric channel capacity
• Denoising and Filtering Under the Probability of Excess Loss Criterion
• On the entropy of a hidden Markov process
• Entropy of hidden Markov processes via cycle expansion
• Stationary measures for projective transformations: the Blackwell and Furstenberg measures

This page was built for publication: On the optimality of symbol-by-symbol filtering and denoising

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547434)