gstlal-inspiral  0.4.2
 All Classes Namespaces Files Functions Variables Pages
Low-latency, online search documentation

Table of Contents

Introduction

The prospect of detecting tens of compact binary mergers per year with Advanced LIGO and Virgo is ushering in a new era of gravitational-wave astronomy with potential for joint electromagnetic and astroparticle observations. The Compact Binary Coalescence group in the LIGO Scientific Collaboration (LSC) has identified the low-latency detection of gravitational waves, i.e., detection in less than 1 minute from the signal arriving at Earth, from coalescing neutron star and black hole binary systems as a science priority. Joint gravitational wave and electromagnetic observations will determine the progenitor models of some of violent transient astronomical events - such as gamma-ray bursts - and set the stage to discover completely unanticipated phenomena.

Algorithm development and search pipeline

Matched filtering is the baseline method to detect compact binaries. It is typically implemented in the frequency domain using fast Fourier transforms that are several times longer than the duration of the underlying signal (Phys. Rev. D 85, 122006 (2012)). Binary neutron stars may be observable for more than 30 minutes in the advanced LIGO band, which implies that the standard matched filtering paradigm incurs a O(1) hr latency. Naively implementing a time-domain matched filtering algorithm through brute force convolution would achieve the latency goals, but it would require O(10) GFLOPS per gravitational wave template (ApJ 748 136 (2012)), which is not feasible.

The Low Latency Online Inspiral Detection (LLOID) algorithm

Significant algorithmic development has led to computationally viable low-latency methods to implement matched filter searches for compact binaries (Astron Astrophys 541 A155 (2012), ApJ 748 136 (2012), Phys Rev D 86 024012 (2012)) by compressing the waveform parameter and/or sampling space. The results are algorithms with similar computational cost to the traditional FFT based search but with much lower latency.

The LLOID algorithm described in ApJ 748 136 (2012) applies two techniques to significantly reduce the computational cost of time-domain filtering.

  1. Singular value decomposition (SVD) of template waveforms (Phys Rev D82 044025 (2010)) to exploit degeneracy in the compact binary parameter space and avoid performing unnecessary template waveform convolutions.
  1. Exploiting the chirp (increasing frequency and amplitude) time-frequency evolution of compact binary systems to critically sample the templates according to the instantaneous Nyquist sampling limit by decomposing the strain data and templates into multiple power-of-two sample rates (multirate filtering).

The use of SVD and multirate filtering retains 99.7% of the signal-to-noise ratio (loses only 0.3%) obtained from conventional matched filtering. This can be compared to the acceptable signal-to-noise ratio loss from the discreteness of template banks, i.e., 3% (Phys. Rev. D 60, 022002 1999). The SVD and multirate filtering paradigm therefore leads to at most a 1% loss in event rate over a conventional matched filter search.

The LLOID algorithm applied to advanced LIGO BNS searches estimates the filtering cost for a real-time compact binary search to be O(1) MFLOPS per gravitational wave template for the advanced LIGO design sensitivity using the waveform decomposition described in ApJ 748 136 (2012). It is an open question, however, if different choices of template decomposition combined, perhaps, with special hardware features could further reduce the computation cost. Since that is not currently known the remaining estimates on this page use the decomposition described in ApJ 748 136 (2012).

The O(1) MFLOPs cost neglects all other costs of performing the analysis including additional signal consistency checks, coincidence analysis, background estimation, etc., but it roughly sets the order of magnitude required to do a low latency search with the LLOID algorithm.

Relationship to published work

Preliminaries

Gotchas:

Preparing the template banks

Instructions

Resources used

Setting up the analysis dag

A makefile automates the construction of a HTCondor DAG. The dag requires the template banks set up in the previous section.

Running the analysis dag

The running dag topology looks like this:

Adjusting the gracedb FAR threshold

Each gstlal_inspiral job that is running is also running its own webserver as a way to request information about the job or to post new configuration information to the job. One very useful result of this is a way to dynamically change the FAR threshold used to submit gracedb events. This can be done from the triggers directory with

    $ gstlal_ll_inspiral_gracedb_threshold --gracedb-far-threshold <FAR THRESH> *registry.txt

Resources used

Monitoring the output

As mentioned above you can monitor the output. Please see the gstlal_llcbcsummary for more information.

Events are uploaded to https://gracedb.ligo.org