PhaseJumps: fast computation of zeros from planar grid samples
Antti Haimi, G\"unther Koliander, Jos\'e Luis Romero

TL;DR
PhaseJumps is a novel algorithm that efficiently computes zeros of complex functions from grid samples, applicable to non-analytic functions, with proven robustness and accuracy in noisy signal processing contexts.
Contribution
We introduce PhaseJumps, a new method for zero-finding in complex functions from grid samples, extending applicability to non-analytic functions and analyzing its robustness under noise.
Findings
Accurately computes zeros with error proportional to the square root of grid spacing.
Robust to noise, with failure probability decreasing logarithmically with grid resolution.
Effective for short-time Fourier transform zeros in signal processing applications.
Abstract
We consider complex-valued functions on the complex plane and the task of computing their zeros from samples taken along a finite grid. We introduce PhaseJumps, an algorithm based on comparing changes in the complex phase and local oscillations among grid neighboring points. The algorithm is applicable to possibly non-analytic input functions, and also computes the direction of phase winding around zeros. PhaseJumps provides a first effective means to compute the zeros of the short-time Fourier transform of an analog signal with respect to a general analyzing window, and makes certain recent signal processing insights more widely applicable, overcoming previous constraints to analytic transformations. We study the performance of (a variant of) PhaseJumps under a stochastic input model motivated by signal processing applications and show that the input instances that may cause the…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Stochastic Gradient Optimization Techniques · Markov Chains and Monte Carlo Methods
