Backend
Blind Deconvolution of Nonstationary Graph Signals over Shift-Invariant Channels
arXiv math.IT0 views
arXiv:2508.17210v2 Announce Type: replace Abstract: In this paper, we investigate the blind deconvolution of nonstationary graph signals from noisy observations transmitted through an unknown shift-invariant channel, under the assumption that the covariance structure of the source signals is known to the observer. Based on a phase retrieval framework, we develop a method to estimate the unknown channel and subsequently recover the source signals via frequency-domain Wiener filtering. We derive theoretical error bounds for both the proposed channel estimation and the resulting blind deconvolution. The effectiveness of the proposed approach is validated through numerical experiments on cycle graphs and a real-world temperature dataset collected in the Brest region of France.
Source:https://arxiv.org/abs/2508.17210PreviousA Primer on Zadoff Chu SequencesNextComparison of fast techniques for adaptive interval-based coding
Related posts
What Jobs Can a Fresher Get After Learning Python? A Practical Guide
0dev.to
Defensive Coding for Real-Time Scoreboard Components
0dev.to
Dev News Digest: 19 Nov 2026, 06:00
0dev.to News
Download Website as HTML: Get a Runnable Project From a Figma Capture
0dev.to Design
A bilingual article’s canonical URL changes from a draft decision to an API result
0dev.to Discuss
Signs of Wear: Evaluating Intelligent Speed Assistance Under Synthetic Adverse Conditions
0arXiv eess.IV