English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Best chirplet chain: near-optimal detection of gravitational wave chirps

MPS-Authors

Pai,  Archana
Astrophysical Relativity, AEI-Golm, MPI for Gravitational Physics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

042003.pdf
(Publisher version), 728KB

0512137.pdf
(Preprint), 705KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Chassande-Mottin, E., & Pai, A. (2006). Best chirplet chain: near-optimal detection of gravitational wave chirps. Physical Review D, 73: 042003. doi:10.1103/PhysRevD.73.042003.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0013-4BBD-B
Abstract
The list of putative sources of gravitational waves possibly detected by the ongoing worldwide network of large scale interferometers has been continuously growing in the last years. For some of them, the detection is made difficult by the lack of a complete information about the expected signal. We concentrate on the case where the expected GW is a quasi-periodic frequency modulated signal i.e., a chirp. In this article, we address the question of detecting an a priori unknown GW chirp. We introduce a general chirp model and claim that it includes all physically realistic GW chirps. We produce a finite grid of template waveforms which samples the resulting set of possible chirps. If we follow the classical approach (used for the detection of inspiralling binary chirps, for instance), we would build a bank of quadrature matched filters comparing the data to each of the templates of this grid. The detection would then be achieved by thresholding the output, the maximum giving the individual which best fits the data. In the present case, this exhaustive search is not tractable because of the very large number of templates in the grid. We show that the exhaustive search can be reformulated (using approximations) as a pattern search in the time-frequency plane. This motivates an approximate but feasible alternative solution which is clearly linked to the optimal one. [abridged version of the abstract]