Next: Coarse Grid Algorithm
Up: Package bank
Previous: Package bank
  Contents
  Index
Template placement is a problem of populating the binary
parameter space (masses, spins, etc.) with as small a number of
templates as possible, subject to the constraint that every signal
that lies within the space has an overlap greater
than or equal to a certain minimal match with at least one template in
the grid. Past studies [1,2,3]
have shown that this is most easily achieved by using the space of
chirp-times to lay templates rather than the space of component masses.
Figure:
The parameter space binary masses and corresponding
chirp-times. Chirp times are computed using an
of 40 Hz. Note
that our parameter is specified by
and
rather than by
(We use capital
to denote the total mass and lower-case
to denote
the component masses.) In the above example
and
|
|
The number of chirp
times that one can define is determined by the post-Newtonian order
one is working with. At the second post-Newtonian order (i.e.
an approximation accurate to order38.1
) and for
a binary consisting of two non-spinning compact objects in a quasi-circular
orbit, there are
four chirp-times
of which we can choose
any two to characterize the binary:
 |
(38.2) |
 |
(38.3) |
 |
(38.4) |
 |
(38.5) |
where
is the total mass of the
binary,
is the symmetric mass ratio and
is a fiducial velocity parameter corresponding
to a fiducial frequency
usually chosen to be the lower
frequency cutoff of the detector sensitivity.
This algorithm allows one to choose
a coarse grid of templates either in the
-
or
-
space depending on the value of the
enum
CoordinateSpace, which can take one of two values:
Tau0Tau2 or Tau0Tau3. The shape of the coordinate
spaces for some interesting range of masses is shown
in Fig.
. The important point to note in these
figures is that the
curve spans from the minimum to the
maximum value of the Newtonian chirp-time
This
feature will be used in the construction of the grid. Note that
the minimum (maximum) value of the Newtonian chirp-time occurs when
the two masses are equal and the total mass is a maximum (minimum).
Subsections
Next: Coarse Grid Algorithm
Up: Package bank
Previous: Package bank
  Contents
  Index
LAL test account
2003-10-23