Type: Article
Publication Date: 2008-09-02
Citations: 5
DOI: https://doi.org/10.1088/0264-9381/25/18/184020
A generic 'chirp' of the form h(t) = A(t) cos φ(t) can be closely approximated by a connected set of multiscale chirplets with quadratically-evolving phase.The problem of finding the best approximation to a given signal using chirplets can be reduced to that of finding the path of minimum cost in a weighted, directed graph, and can be solved in polynomial time via dynamic programming.For a signal embedded in noise we apply constraints on the path length to obtain a statistic for detection of chirping signals in coloured noise.In this paper we present some results from using this test to detect binary black hole coalescences in simulated LIGO noise.