TL;DR
This paper introduces the Kravchuk transform, a covariant, discrete time-frequency representation that improves zero-based signal detection by addressing discretization and boundedness issues, demonstrating robustness and superior detection performance.
Contribution
The paper presents the Kravchuk transform as a novel, covariant, and numerically tractable discrete time-frequency representation tailored for zero-based signal detection, with demonstrated invariance and robustness.
Findings
Kravchuk transform is covariant under SO(3) and invertible.
Zeros of the Kravchuk transform of Gaussian noise match spherical Gaussian Analytic Function.
Proposed detection method outperforms existing zeros-based procedures, especially at low SNR and small sample sizes.
Abstract
Recent work in time-frequency analysis proposed to switch the focus from the maxima of the spectrogram toward its zeros, which, for signals corrupted by Gaussian noise, form a random point pattern with a very stable structure leveraged by modern spatial statistics tools to perform component disentanglement and signal detection. The major bottlenecks of this approach are the discretization of the Short-Time Fourier Transform and the boundedness of the time-frequency observation window deteriorating the estimation of summary statistics of the zeros, on which signal processing procedures rely. To circumvent these limitations, we introduce the Kravchuk transform, a generalized time-frequency representation suited to discrete signals, providing a covariant and numerically tractable counterpart to a recently proposed discrete transform, with a compact phase space, particularly amenable to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
