Skip to content
DraconiticResearch
Search Sources API
206,690 studies31 sourcesUpdated 23 min ago
PreprintarXiv licencearXiv

Some theoretical and practical results on noisy signals recovery

Abstract

We discuss some theoretical results and their applications to specific practical problems from wireless communications. We assume that we know the noisy version of the signal, which is sparse with respect to a given system of elements (dictionary), at a finite number of points and we want to approximately recover it. This problem of recovery of a noisy signal is closely related to the problem of establishing the Lebesgue-type inequalities for the corresponding algorithms and it motivates us to prove such inequalities. Under certain conditions on a dictionary (RIP-type condition, coherence condition) we obtain different kinds of the Lebesgue-type inequalities for the OMP and its version WOMP algorithms. The most important feature of our new theoretical result is the assumption that the dictionary has the RIP-type property instead of the assumption that it is the Riesz basis, which was used in the previous results. Our approach allows us to treat redundant (overcomplete) systems, which is important in applications. We consider the setting of sparse recovery for highly-coherent dictionaries that appear in OFDM setting for wireless communication. Our main example is the oversampled Fourier dictionary and the recovery of the frequency response of a sparse channel. We develop a general approach to such problems and we prove that under certain conditions the OMP algorithm recovers all dictionary elements with large coefficients, and estimate its accuracy (in NMSE metric) in terms of signal-to-noise ratio.

Related

  1. Practical Algebraic Parameter Estimation for Noisy Data via Gaussian Process Regression
    Oren Bassik, Alexander Demin, Alexey Ovchinnikov
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  2. Theoretical and Practical Advances in Hierarchical Bayesian Deep Learning Methodology
    Neil K. Chada, Simon Cotter, Kody J. H. Law +1
    arXivPreprintCC BY-NC-SA 4.0Full textStatisticsarXiv
  3. Spectral Recovery of Point Clouds from Noisy Geometric Graphs
    Tatiana Brailovskaya, Nicholas A. Cook, Sofia Poinelli
    arXivPreprintCC BY-NC-ND 4.0Full textProbabilityStatisticsarXiv
  4. Diagonal recovery from noisy Fourier--Hermite coefficients: exact orders of the error
    S. G. Solodky, Y. A. Volynets
    arXivPreprintCC0Full textNumerical analysis & scientific computingarXiv
  5. Matrix equivalence to Smith normal form: new theoretical results for multivariate polynomial matrices
    Dong Lu, Yuanyuan Ruan, Dingkang Wang +1
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
BibTeX
@misc{makurin2026some,
  title = {{Some theoretical and practical results on noisy signals recovery}},
  author = {M. Makurin and Yu. Malykhin and K. Ryutin and V. Temlyakov},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.11765},
  eprint = {2609.11765},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.11765},
}
RIS
TY  - UNPB
TI  - Some theoretical and practical results on noisy signals recovery
AU  - M. Makurin
AU  - Yu. Malykhin
AU  - K. Ryutin
AU  - V. Temlyakov
PY  - 2026
DA  - 2026/09/10
PB  - arXiv
DO  - 10.48550/arxiv.2609.11765
UR  - https://arxiv.org/abs/2609.11765
AB  - We discuss some theoretical results and their applications to specific practical problems from wireless communications. We assume that we know the noisy version of the signal, which is sparse with respect to a given system of elements (dictionary), at a finite number of points and we want to approximately recover it. This problem of recovery of a noisy signal is closely related to the problem of establishing the Lebesgue-type inequalities for the corresponding algorithms and it motivates us to prove such inequalities. Under certain conditions on a dictionary (RIP-type condition, coherence condition) we obtain different kinds of the Lebesgue-type inequalities for the OMP and its version WOMP algorithms. The most important feature of our new theoretical result is the assumption that the dictionary has the RIP-type property instead of the assumption that it is the Riesz basis, which was used in the previous results. Our approach allows us to treat redundant (overcomplete) systems, which is important in applications. We consider the setting of sparse recovery for highly-coherent dictionaries that appear in OFDM setting for wireless communication. Our main example is the oversampled Fourier dictionary and the recovery of the frequency response of a sparse channel. We develop a general approach to such problems and we prove that under certain conditions the OMP algorithm recovers all dictionary elements with large coefficients, and estimate its accuracy (in NMSE metric) in terms of signal-to-noise ratio.
ER  -