Metraipolis › archive › dc_b1e5d51f2b60
Some theoretical and practical results on noisy signals recovery — arXiv:2609.11765
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.11765
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T06:10:09.932Z
- SHA-256 of the archived text
52b4d759182fc5b147592efbca4c3f70930422b9d5994347ddd2c99e2154c480- Stable URL of this page
https://metraipolis.com/documento/dc_b1e5d51f2b60
How to cite
Some theoretical and practical results on noisy signals recovery — arXiv:2609.11765 — arXiv (en), https://arxiv.org/abs/2609.11765 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b1e5d51f2b60 (Metraipolis archive dc_b1e5d51f2b60, sha256 52b4d759182fc5b147592efbca4c3f70930422b9d5994347ddd2c99e2154c480)
BibTeX
@misc{dcb1e5d51f2b60,
title = {Some theoretical and practical results on noisy signals recovery — arXiv:2609.11765},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.11765},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b1e5d51f2b60; sha256 52b4d759182fc5b147592efbca4c3f70930422b9d5994347ddd2c99e2154c480},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11765. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.NA). Categorie arXiv: Numerical Analysis (math.NA) ; Functional Analysis (math.FA). Pagina del lavoro: https://arxiv.org/abs/2609.11765 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T05:55:33.339Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).