9512.net
甜梦文库
当前位置:首页 >> >>

Best network chirplet-chain Near-optimal coherent detection of unmodeled gravitation wave c


AEI-2007-119

Best network chirplet-chain: Near-optimal coherent detection of unmodeled gravitation wave chirps with a network of detectors
Archana Pai?
Max-Planck Institut f¨ ur Gravitationsphysik, Am M¨ uhlenberg 1, 14476 Potsdam, Germany

? Eric Chassande-Mottin?
CNRS, AstroParticule et Cosmologie, 10, rue Alice Domon et L? eonie Duquet, 75205 Paris Cedex 13, France and Observatoire de la C? ote d’Azur, Bd de l’Observatoire, BP 4229, 06304 Nice, France

Olivier Rabaste?
CNRS, AstroParticule et Cosmologie, 10, rue Alice Domon et L? eonie Duquet, 75205 Paris Cedex 13, France (Dated: February 5, 2008)

arXiv:0708.3493v1 [gr-qc] 26 Aug 2007

The searches of impulsive gravitational waves (GW) in the data of the ground-based interferometers focus essentially on two types of waveforms: short unmodeled bursts from supernova core collapses and frequency modulated signals (or chirps) from inspiralling compact binaries. There is room for other types of searches based on di?erent models. Our objective is to ?ll this gap. More speci?cally, we are interested in GW chirps “in general”, i.e., with an arbitrary phase/frequency vs. time evolution. These unmodeled GW chirps may be considered as the generic signature of orbiting or spinning sources. We expect the quasi-periodic nature of the waveform to be preserved independently of the physics which governs the source motion. Several methods have been introduced to address the detection of unmodeled chirps using the data of a single detector. Those include the best chirplet chain (BCC) algorithm introduced by the authors. In the next years, several detectors will be in operation. Improvements can be expected from the joint observation of a GW by multiple detectors and the coherent analysis of their data namely, a larger sight horizon and the more accurate estimation of the source location and the wave polarization angles. Here, we present an extension of the BCC search to the multiple detector case. This work is based on the coherent analysis scheme proposed in the detection of inspiralling binary chirps. We revisit the derivation of the optimal statistic with a new formalism which allows the adaptation to the detection of unmodeled chirps. The method amounts to searching for salient paths in the combined time-frequency representation of two synthetic streams. The latter are time-series which combine the data from each detector linearly in such a way that all the GW signatures received are added constructively. We give a proof of principle for the full sky blind search in a simpli?ed situation which shows that the joint estimation of the source sky location and chirp frequency is possible.
PACS numbers: 04.80.Nn, 07.05.Kf, 95.55.Ym

I.

SUMMARY

A large e?ort is underway to analyze the scienti?c data acquired jointly by the long-baseline interferometric gravitational wave (GW) detectors GEO 600, LIGO, TAMA and Virgo [1]. In this paper, we contribute to the methodologies employed for this analysis, and in particular for the detection of impulsive GW signals. The current GW data analysis e?ort is targeted on two types of impulsive GWs. A ?rst target is poorly known short bursts of GWs with a duration in the hundredth of a millisecond range. The astrophysically known sources of such GW bursts are supernovae core collapses (or other similar cataclysmic phenomenon). The second target is frequency modulated signals or chirps radiated by inspiralling binaries of compact objects (either neutron stars

? Electronic ? Electronic

address: Archana.Pai@aei.mpg.de address: Eric.Chassande-Mottin@apc.univ-paris7.fr ? Electronic address: Olivier.Rabaste@apc.univ-paris7.fr

(NS) or black holes (BH)). These chirp waveforms are well modeled and expected to last for few seconds to few minutes in the detector bandwidth. Our objective is to enlarge the signal range of impulsive GWs under consideration and to ?ll this gap between these two types. More speci?cally, we are interested in the detection of unmodeled GW chirps which last from few tens of milliseconds to few seconds in the detector bandwidth. We shall detail in the next section the astrophysical motivation for considering this kind of GWs. Simultaneous observation and analysis of the jointly observed data from di?erent GW detectors has de?nite obvious bene?ts. First and foremost, a GW detection can get con?rmed or vetoed out with such a joint observation. Further, the detector response depends on the position and orientation of the source and polarization of the wave. For this reason, the joint observation by multiple detectors gives access to physical parameters such as source location and polarization. The use of multiple detectors also allows to enlarge the observational horizon and sky coverage. Till date, several methods have been proposed and im-

2 plemented to detect unmodeled GW chirps using a single detector which include the signal track search (STS) [2], the chirplet track search [3] and the best chirplet chain (BCC) search proposed by the authors [4]. However, none of the above addresses the multiple detector case. This requires the designing of speci?c algorithms which are able to combine the information received by the di?erent detectors. In practice, there are two approaches adopted to carry out network analysis from many detectors, coincidence and coherent approach. In coincidence approach, the data from each detector is processed independently and only coincident trigger events (in the arrival time and the parameter values) are retained and compared. On the other hand, in the coherent approach, the network as a whole is treated as a single “sensor”: the data from various detectors is analyzed jointly and combined into a single network statistic which is tested for detection. In the literature, it has been shown that the coherent approach performs better than the coincidence approach for GW short bursts [5] as well as GW chirps from coalescing binaries [6]. Indeed, the signal phase information is preserved with the coherent approach, whereas it is not with the coincidence approach which therefore leads to some information loss. Thus, we wish to follow the coherent approach for our analysis. Another reason for this choice is that the coincidence method is not adequate for unmodeled chirps. A large number of parameters (in the same order as the number of signal samples) is needed to characterize their frequency evolution. A coincident detection occurs when the parameter estimates obtained from the analysis of the individual detector data match. Because of the noise ?uctuation, the occurrence of such a coincidence is very unlikely when the number of parameters is large, unless the incoming GW has very large amplitude. In this article, we therefore adopt the coherent method and propose the coherent extension of the BCC algorithm. Coherent schemes have been already developed for the detection of inspiralling binary chirps [7, 8]. Here, we revisit the work presented in [7] with a new formalism. Comments in footnotes link the results presented here with the ones of [7]. We show that the new formalism presented here helps to understand the geometry of the problem and it is simple to establish connections with earlier works. The outline of the paper goes as follows. In Sec. II, we present and motivate our model of an arbitrary GW chirp. In Sec. III, we describe the response of the detector network to an incoming GW chirp. Further, we show that the linear component of the signal model (parameters acting as scaling factors and phase shifts, so called extrinsic parameters) can be factorized. This factorization evidences that the signal space can be represented as the direct product of two two-dimensional spaces i.e., the GW polarization plane and the chirp plane. This representation forms the backbone of the coherent detection scheme that follows in the subsequent section. In Sec. IV, based on a detailed geometrical argument, we show that the above signal representation manifests the possible degeneracy of the response. This degeneracy has been already noticed and studied at length in the context of burst detection [9, 10, 11]. We investigate this question in the speci?c context of chirps and obtain similar results as were presented earlier in the literature. In Sec. V, we obtain the expression of the network statistic. Following the principles of the generalized likelihood ratio test (GLRT), the statistic is obtained by maximizing the network likelihood ratio over the set of unknown parameters. We perform this maximization in two steps. We ?rst treat the linear part of the parameterization and show that such a maximization is nothing but a least square problem over the extrinsic parameters. The solution is obtained by projecting the data onto the signal space. We further study the e?ect of the response degeneracy on the resulting parameter estimates. The projection onto the signal space is a combined projection onto the GW polarization and chirp planes. The projection onto the ?rst plane generates two synthetic streams which can be viewed as the output of “virtual detectors”. The network statistic maximized over the extrinsic parameters can be conveniently expressed in terms of the processing of those streams. In practice, the synthetic streams linearly combine the data from each detector in such a way that the GW signature received by each detector is added constructively. With this rephrasing, the source location angles can be searched over e?ciently. Along with the projection onto the GW polarization plane, we also examine the projection onto its complement. While synthetic streams concentrate the GW contents, the so called null streams produced this way combines the data such that the GW signal is canceled out. The null streams are useful to veto false triggers due to instrumental artifacts (which don’t have this cancellation property). The null streams we obtained here are identical to the ones presented earlier in GW burst literature [12, 13, 14]. In Sec. VI, we perform the second and ?nal step of the maximization of the network statistic over the chirp phase function. This step is the di?cult part of the problem. For the one detector case, we have proposed an ef?cient method, the BCC algorithm which addresses this question. We show that this scheme can be adapted to the multiple detector case in a straightforward manner, hence refer to this as Best Network CC (BNCC). Finally, Sec. VII presents a proof of principle of the proposed method with a full-sky blind search in a simpli?ed situation.

II.

GENERIC GW CHIRPS A. Motivation

Known observable GW sources e.g., stellar binary systems, accreting stellar systems or rotating stars, com-

3 monly involve either orbiting or spinning objects. It is not unreasonable to assume that the similar holds true even for the unknown sources. The GW emission is essentially powered by the source dynamics which thus determines the shape of the emitted waveform. Under linearized gravity and slow motion (i.e., the characteristic velocity is smaller than the speed of light) approximation, the quadrup? ole formula [15] predicts that the amplitude of emitted GW is proportional to the second derivative of the quadrup? ole moment of the physical system. When the dominant part of the bulk motion follows an orbital/rotational motion, the quadrup? ole moment varies quasi-periodically, and so is the GW. The more the information we have about the GW signal, the easier/better is the detection of its signature in the observations. Ideally, this requires precise knowledge of the waveform, and consequently requires precise knowledge of the dynamics. This is not always possible. In general, predicting the dynamics of GW sources in the nearly relativistic regime requires a large amount of effort. This task may get further complicated if the underlying source model involves magnetic couplings, mass accretion, density-pressure-entropy gradients, anisotropic angular momentum distribution. Here, we are interested in GW sources where the motion is orbital/rotational but the astrophysical dynamics is (totally or partially) unknown. While our primary target is the unforeseen sources (this is why we remain intentionally vague on the exact nature of the sources), several identi?ed candidates enter this category because their dynamics is still not fully characterized. These include (see [4] for more details and references) binary mergers, quasi normal modes from young hot rotating NS, spinning BH accreting from an orbiting disk. As motivated before, following the argument of quadrup? ole approximation, the GW signature for such sources is not completely undetermined: it is expected to be quasi-periodic, possibly frequency modulated GW ; in brief, it is a GW chirp. This is the basic motivation for introducing a generic GW chirp model, as described in the next section. expanded in terms of mass multipole moments as [16]
∞ l

hT T (t) ∝
l=2 m=?l

(??Y lm )STF

dl lm I (t ? r/c). dtl

(1)

Here, STF means “symmetric transverse-tracefree”, Y lm are the spherical harmonics, and I lm are the mass multipole moments. We consider here isolated astrophysical systems with anisotropic mass distributions (e.g., binaries, accreting systems, bar/fragmentation instabilities) orbiting/rotating about a well-de?ned axis1 . It can be shown that these systems emit GW predominantly in the l = |m| = 2 mode. Contributions from any other mass moments are negligibly small 2 . The pure-spin tensor harmonic (??Y lm )STF term provides the GW polarization. For l = |m| = 2 mode, we have (??Y 22 )STF ∝ (1 + cos2 )e+ + 2i cos e× . (2)

The tensors e+ and e× form a pair of independent and linear-polarization GW tensors (e× is rotated by and angle π/4 with respect to e+ ). The orbital inclination angle is the angle between the line of sight to the source (in Earth’s frame) and the angular momentum vector (or the rotation axis) of the physical system, see Fig. 1 (a). This shows that the emitted GW in the considered case carries both GW polarizations. The GW tensor is fully described as hT T (t) = h+ (t)e+ + h× (t)e× . The phase shift between the two polarizations h+ and h× arises from the I lm term which is proportional to the moment of inertia tensor for l = |m| = 2. The quadratic nature of the moment of inertia tensor introduces a phase shift of π/2 between the two polarizations h+ and h× . This leads to the chirp model below 1 + cos2 cos(?(t ? t0 ) + φ0 ) , 2 h× (t) = A cos sin(?(t ? t0 ) + φ0 ), h+ (t) = A (3a) (3b)

B.

Generic GW chirp model

In this section, we describe the salient features of the generic GW chirp model used in this paper. We motivate the nature of GW polarization, the regularity of its phase and frequency evolution.

with t0 ≤ t < t0 + T and h+,× (t) = 0 outside this interval. The phase φ0 is the signal phase at t = t0 . Here, we assume the GW amplitude A to be constant. This is clearly an over-simpli?ed case since we indeed expect an amplitude modulation for real GW sources.

1

2

1.

Relation between the polarizations

The GW tensor (in transverse traceless (TT) gauge), associated to the GW emitted from slow-motion, weak gravity sources are mostly due to variations of the mass moments (in contrast to current moments) and can be

This condition can be relaxed to precessing systems provided that the precession is over time scales much longer than the observational time, typically of order of seconds. Recently, numerical relativity simulations [17] demonstrated that this is a fairly robust statement in the speci?c context of inspiralling BH binaries. The simulations show that BH binaries emit GW dominantly with l = |m| = 2. However, as the mass-ratio decreases, higher multipoles get excited. A similar claim was also made in the context of quasi-normal modes produced in the ringdown after the merger of two BH, on the basis of a theoretical argument, see [18], page 4538.

4 However we wish here to keep the model simple in order to focus the discussion on the aspects related to the coherent analysis of data from multiple detectors. We postpone the study of amplitude modulated GWs to future work. The chirp model described in Eq. (3) clearly depends upon several unknown parameters (which need to be estimated from the data) which include the amplitude A, the initial phase φ0 , the arrival time t0 of the chirp and the inclination angle . As no precise assumption on the exact nature and dynamics of the GW source is made, we consider the phase evolution function ?(·) to be an unknown parameter of the model (3) as well. Clearly, it is a more complicated parameter than the others which are simply scalars. Just like any scalar parameter can be constrained to a range of values (e.g., A > 0), the phase function ?(·) has to satisfy conditions to be physically realistic which we describe in the next section.
A. Coordinate frames

We follow the conventions of [7] and introduce three coordinate frames, namely, the wave frame, the Earth frame and the detector frame as given below, see Fig. 1. ? the wave frame xw ≡ (xw , yw , zw ) is the frame associated to the incoming GW with positive zw direction along the incoming direction and xw ? yw plane corresponds to the plane of the polarization of the wave. ? the Earth frame xE ≡ (xE , yE , zE ) is the frame attached to the center of the Earth. The xE axis is radially pointing outwards from the Earth’s center and the equatorial point that lies on the meridian passing through Greenwich, England. The zE axis points radially outwards from the center of Earth to the North pole. The yE axis is chosen to form a right-handed coordinate system with the xE and zE axes. ? the detector frame xd ≡ (xd , yd , zd ) is the frame attached to the individual detector. The (xd ? yd ) plane contains the detector arms and is assumed to be tangent to the surface of the Earth. The xd axis bisects the angle between the detector’s arms. The zd axis points towards the local zenith. The direction of the yd axis is chosen so that we get a right-handed coordinate system. A rotation transformation between the coordinate systems about the origin is speci?ed by the rotation operator O which is characterized by these three Euler angles. We de?ne these angles using the “x-convention” (also known as z ? x ? z convention) [19]. Let (φe , θe , ψe ) and (α, β, γ ) be Euler angles of the rotation operator relating pairs of the above coordinate systems as follows xw = O(φe , θe , ψe )xE , xd = O(α, β, γ )xE . (5) (6)

2.

Smoothness of the phase evolution

As explained above, the chirp phase is directly related to the orbital phase of the source. The regularity of the orbital phase can be constrained by the physical arguments: the orbital phase and its derivatives are continuous. The same applies to the chirp phase and derivatives. The detectors operate in a frequency window limited in the range from few tenths of Hz to a kHz and they are essentially blind outside. This restricts our interest to sources emitting in this frequency range, which results in lower and upper limits on the chirp frequency ν (t) ≡ (2π )?1 d?/dt and thus on the variations of the phase. In addition, the variation of the frequency (the chirping rate) can be connected to the rate at which the source loses its energy. For isolated systems, this is clearly bounded. This argument motivates the following bounds on the higher-order derivatives of the phase: dν ≤F , dt d2 ν ≤F . dt2 (4)

In this sense, Eq.(4) determines and strengthens the smoothness of the phase/frequency evolution. This is the reason why we coined the term “smooth GW chirp” in [4]. The choice of the allowed upper bounds F and F may be based on general astrophysical arguments on the GW source of interest.

All the angles in the Eqs. (5) and (6) are related to physical/geometrical quantities described in Fig. 1. More speci?cally, we have φe = φ ? π/2, θe = π ? θ, ψe = ψ, (7)

III. RESPONSE OF A NETWORK OF DETECTORS TO AN INCOMING GW

After describing the chirp model in the previous section, in this section we derive the response of a network of interferometric ground based detectors with arbitrary locations and orientations to an incoming GW chirp. The ?rst step towards this is to identify the coordinate frames.

where φ and θ are the spherical polar coordinates of the source in the Earth’s frame and the angle ψ is the socalled polarization-ellipse angle which gives the orientation of the source plane. Throughout the paper, we shall use θ and φ to indicate the source location.

5

(a)

zE
Earth θe

zw y
w

(b)

d Detector 1 L

z

y d
2

zE x d
Earth

Greenwich Meridian

yE xE xw
Line of nodes

l Greenwich Meridian

yE x
E

Wave Plane ψe Source
Angular Momentum Vector

Plane of the detector a2 N 2 E S 1

ε

xE

φe

ψe

xw

Wa 1

FIG. 1: Color online — Coordinate transformations. (a) O(φe , θe , ψe ): Earth frame xE : (xE , yE , zE ) → wave frame xw : (xw , yw , zw ), (b) O(α, β, γ ): Earth frame xE : (xE , yE , zE ) → detector frame: xd : (xd , yd , zd ). The latitude l and longitude L of the detector are related to the Euler angles by Eqs. (8) and (9).

TABLE I: Location and orientation informations of the Earth-based interferometric GW detectors. The location of the corner station (vertex) of each detector is given in terms of the latitude and longitude. The orientation of an arm is given by the angle through which one must rotate it clockwise (while viewing from top) to point the local North. The corresponding detector Euler angles (α, β, γ ) are listed. Vertex Vertex Arm 1 Arm 2 α latitude (N) longitude (E) a1 a2 TAMA-300 (T) 35? 40 35.6 139? 32 9.8 90.0? 180.0? 229.54? ? ? ? ? GEO-600 (G) 52 14 42.528 9 48 25.894 25 56 35 291 36 42 99.81? ? ? ? VIRGO (V) 43 37 53.0921 10 30 16.1878 341 25 57.2 70? 34 2.8 100.5? ? ? ? ? LIGO Hanford (LH) 46 27 18.528 ?119 25 27.5657 35.9994 125.9994 ?29.41? LIGO Livingstone (LL) 30? 33 46.4196 ?90? 46 27.2654 107.7165? 197.7165? ?0.77? Detector β 54.32? 37.75? 46.37? 43.55? 59.44? γ 225? 68.778? 116.0? 171.0? 242.72?

The detector Euler angles (α, β, γ ) are directly related to the location and orientation of the detector as follows: α = L + π/2, β = π/2 ? l, a1 + a2 γ= + 2 a1 + a2 = + 2 (8) (9) 3π 2 π 2 if |a1 ? a2 | > π, if |a1 ? a2 | ≤ π, (10) (11)

where O(φe , θe , ψe ) ≡ O(φe , θe , ψe )O?1 (α, β, γ ).
B. Network response

An interferometric response to the incident GW is obtained by contracting a GW tensor with the detector tensor [see Appendix B], which can be re-expressed as a linear combination of the two polarizations h+ and h× i.e. s = f+ h+ + f× h× ≡ [f ? h],

where l and L are the latitude and longitude of the corner station. The angles a1 and a2 describe the orientation of the ?rst and second arm respectively. It is the angle through which one must rotate the arm clockwise (while viewing from top) to point the local North. In Table I, we tabulate the currently running interferometric detectors along with their Euler angles. Combining Eqs. (5) and (6), we obtain the coordinate transformation from the wave frame to the detector frame as follows xs = O(φe , θe , ψe )xd , (12)

(13)

and the linear coe?cients f+ (φe , θe , ψe ) and f× (φe , θe , ψe ), commonly termed as the detector antenna pattern functions, represent the detector’s directional response to the + and × polarizations respectively. For the compact expression provided by Eq. (13), we have de?ned the complex GW signal to be h = h+ + ih× and the complex antenna pattern function to be f = f+ + if× .

6 The detector response s and the incident GW signal h are both times series. In a network where the various detectors are located at di?erent locations on the Earth, for example the LIGO-Virgo network, the GW will arrive at the detector sites at di?erent time instances. However, all the measurements at the various detectors need to be carried out with a reference time. Here, just for our convenience, we choose the observer attached to the Earth’s center as a reference and the time measured according to this observer is treated as a reference. Any other reference would be equally acceptable. Assuming that the detector response is labeled with this time reference (a single reference time for all detectors in a detector network), we have s(t) = [f ? h(t ? τ (φ, θ))], (14) In previous section, we have obtained the network response to any type of incoming GW with two polarizations. In what follows, we wish to investigate how this response manifests in case of a speci?c type of GW, namely GW chirp described in Eq. (3). We also want to understand how various parameters explicitly appear in the network response. It is insightful to distinguish the signal parameters based on their e?ect on the signal model. The parameters are separated into two distinct types traditionally referred to as the “intrinsic ” and “extrinsic ” parameters. The extrinsic parameters are those that introduce scaling factors or phase shifts but do not a?ect the shape of the signal model. Instead, intrinsic parameters signi?cantly alter the shape of the signal and hence the underlying geometry. The network response s mingles these two types of parameters. Our work is considerably simpli?ed if we can “factorize” the extrinsic parameters from the rest. For the chirp model described in Eq. (3), we count four extrinsic parameters, namely {A, φ0 , , ψe } and perform this factorization in two steps.
1. Extended antenna pattern includes the inclination angle

the de?nition) of the network complex beam pattern vector f = {fj , j = 1 . . . d} ∈ Cd×1 and the complex GW vector h = {h(tk ), tk = t0 + ts k with k = 0 . . . N ? 1} ∈ CN ×1 viz., s = [f ? ? h]. (15) The above expression is general enough to hold true for any type of incoming GW signal. The Kronecker product in this expression is the direct manifestation of the fact that the detector response is nothing but the tensor product between the detector and the wave tensors.
D. GW chirp as a linear model of the extrinsic parameters

where τ (φ, θ) = (rd ?rE )·w(φ, θ)/c denotes the di?erence in the arrival times of the GW (propagating with the unit wave vector w) at the detector and at the center of the Earth located at rd and rE , respectively. Note that this value can be positive or negative depending on the source location.

C.

Vector formalism

In the following, we distinguish scalars by using roman letters, vectors are denoted by small bold letters, and matrices by bold capitals. We denote the k -th element of vector a by a[k ] and correspondingly, the element of matrix A at row k and column l by A[k, l]. The matrices AT and AH ≡ (AT )? designate the real and hermitian transposes of A respectively. We consider now a GW detector network with d interferometers. Each detector and its associated quantities are labeled with an index j = 1, . . . , d which we also use as a subscript if required. We assume that the output response of each detector is sampled at the Nyquist rate νs ≡ 1/ts where ts is the sampling interval. We then divide the data in blocks of N consecutive samples. In this set-up, the detector as well as the network response is then de?ned by forming vectors with these blocks of data. Let us consider a given GW chirp source at sky location (φ, θ). Let the response of the j -th detector be sj with entry sj [k ] = sj (tk + τj (φ, θ)), where tk = t0 + kts , k = 0, . . . , N ? 1, and t0 is the reference time i.e. the time of arrival of GW at the center of the Earth. Note that, with the above de?nition, we compensate for the time delay τj (φ, θ) between the detector j and the Earth’s center. Thus, in this set-up, the GW signal starts and ends in the same rows in the data vectors sj of all the detectors. For compactness, we stack the data from all the detectors in the network into a single vector s of size N d × 1, T T such that sT = [sT 1 s2 . . . sd ] forms the network response. In this convention, the network response can be expressed compactly as the Kronecker product (see Appendix A for

We absorb the inclination angle into the antenna pattern functions and rewrite the network signal as ? ], s = [? f? ? h (16) ? ≡ ae is the GW vector. It only depends on the where h complex amplitude a = A exp iφ0 and on the phase vector e = {exp(i?[k ]), with ?[k ] ≡ ?(kts ), k = 0 . . . N ? 1}. The extended antenna pattern ? f incorporates the inclination angle as follows3 1 + cos2 ? f= 2 f+ + i cos f× . (17)

3

We remind the reader that similar quantity was previously introduced in Eq. (3.19) of [7].

7
2. Gel’fand functions factorize the polarization angles from source location angles

The second step is to separate the dependency of ? f on the polarization angles {ψ, } from the source location angle and the detector orientation angles. The earlier work [7] shows that the Gel’fand functions (which are representation of the rotation group SO(3)) provide an e?cient tool to do the same. For the sake of completeness, Appendix B reproduces some of the calculations of [7]. The ?nal result (see also Eqs. (3.14-3.16) of [7]) yields the following decomposition: ? f = t+ d + t? d? , (18)

columns of E which we shall refer to as chirp plane. These two spaces embody two fundamental characteristics of the signal: the former characterizes gravitational waves while the latter characterizes chirping signals. The Kronecker product in the expression of Π shows explicitly that the network response is the result of the projection of incoming GW onto the detector network. The norm of the network signal gives the “signal” (and not physical) energy delivered to the network, which is s
2

=

N A2 ? f 2

2

.

(22)

Clearly, the dependence on the number of samples N implies that the longer the signal duration, the larger is where the vector d ∈ Cd×1 carries the information of the the signal energy and is proportional to the length of the source location angles (φ, θ) via (φe , θe ) and the detector signal duration. The factor ? f is the modulus of the Euler angles {αj , βj , γj }. Its components are expressed extended antenna pattern vector. It can be interpreted as as the gain or attenuation depending on the direction of n=2 the source and on the polarization of the wave. d[j ] = ? iT2n (φe , θe , 0)[T2n (αj , βj γj )?T?2n (αj , βj , γj )]? .
n=?2

(19) The tensor Tmn designates rank-2 Gel’fand functions. The coe?cients t+ and t? depend only on the polarization angles {ψ, }, viz. t± = T2±2 (ψ, , 0) = (1 ± cos ) exp(?2iψ ). 4
2

IV.

INTERPRETATION OF THE NETWORK RESPONSE

(20)

Finally, we combine Eqs. (16) and (18) and obtain an expression of the network response where the extrinsic parameters are “factorized” as follows, ? ? ?? a t? ? ? ? ? a? t+ ? 1 ? ? ? ? ?? s=? ? ≡ Πp. (21) d d e e ? ?? 2 ? a t? + ? D E a? t?
p

In this section, we focus on understanding the underlying geometry of the signal model described in Eq. (21). A useful tool to do so is the Singular Value Decomposition (SVD) [20]. It provides an insight on the geometry by identifying the principal directions of linear transforms.

A.

Principal directions of the signal space: Singular Value Decomposition

Eq. (21) evidences the underlying linearity of the GW model with respect to the extrinsic parameters. The 4dimensional complex vector p de?nes a one-to-one (nonlinear) mapping between its components and the four physical extrinsic parameters {A, φ0 , , ψ } (we will detail this point later in Sec. V A 3). Note that the ?rst and fourth components as well as the second and third components of p are complex conjugates. This symmetry comes from the fact that the data is real. The signal space as de?ned by the network response is the range of Π and results from the Kronecker product of two linear spaces: the plane of Cd generated by the columns of D which we shall refer to as GW polarization plane 4 and the plane of CN generated by the

The SVD is a generalization of the eigen-decomposition for non-square matrices. The SVD factorizes a matrix H of three maA ∈ Cm×n into a product A = UA ΣA VA trices UA ∈ Cm×r , ΣA ∈ Rr×r and VA ∈ Cn×r where r ≤ m, n is the rank of A. The columns of UA and VA H are orthonormal i.e., UH A UA = VA VA = Ir . The diagonal of ΣA are the singular values (SV) of A. We use here the so-called “compact” SVD (we retain the non-zero SV only in the decomposition), such that the matrix ΣA is a positive de?nite diagonal matrix. The SVD is compatible with the Kronecker product [21]: the SVD of a Kronecker product is the Kronecker product of the SVDs. Applying this property to Π, we get Π = (UD ? UE )(ΣD ? ΣE )(VD ? VE )H . (23)

4

In [7], this plane was referred to as “helicity plane” because it is formed by the network beam patterns for all possible polarizations.

Therefore, the SVD of Π can be easily deduced from the one of D and E. We note that D and E have similar structure (two complex conjugated columns), see Eq. (21). In Appendix C, we analytically obtain the SVD of a matrix with such a structure. Thus, applying this result, we can straightaway write down the SVDs for D and E as shown in the following sections.

8
1. GW polarization plane: SVD of D

Let us ?rst introduce some variables
d

the case of interest. We can thus consider 5 that eT e ≈ 0 and eH e = N . Therefore, following Appendix C 2, the √ SVD of E √ is given by ΣE = N I2 /2, VE = I2 and UE = 2E/ N . (24)
3. Signal space: SVD of Π

D ≡ dH d =
j =1 d

|d[j ]|2 ,

? ≡ dT d =
j =1

d[j ]2 ,

(25) (26)

δ ≡ arg ?.

We obtain the SVD for Π using the compatibility of the SVD with the Kronecker product stated in Eq. (23). In the nominal case where D has rank 2, we have √ ΣΠ = N 2 σ1 I2 02 0 2 σ2 I2 , (32)

In the nominal case, the matrix D has rank 2, viz. ΣD = σ1 0 0 σ2 , (27)

with four left-singular vectors VΠ = v 1 ? I2 v2 ? I2 , (33)

D + |?| and σ2 = with two non-zero SV σ1 = D ? |?| (σ1 ≥ σ2 ) associated to a pair of left-singular vectors VD = [v1 , v2 ] with 1 v1 = √ 2 exp(?iδ ) 1 , 1 v2 = √ 2 exp(?iδ ) ?1 , (28) and of right-singular vectors UD = [u1 , u2 ] with u1 = u2 = exp(?iδ )d + d? 2(D + |?|) exp(?iδ )d ? d? 2(D ? |?|) , . (29) (30)

and four right-singular vectors 2 UΠ = √ N u1 ? e u1 ? e? u2 ? e u2 ? e? . (34)

B.

The signal model can be ill-posed

Note that the vector pair {u1 , u2 } results from the Gram-Schmidt ortho-normalization of {d, d? }. Barring the nominal case, for a typical network built with the existing detectors and for certain sky locations of the source, it is however possible for the smallest SV σ2 to vanish. In such situation, the rank of D reduces to 1. We then have ΣD = σ1 , VD = v1 and UD = u1 . We give an interpretation of this degeneracy later in Sec. IV B.

2.

Chirp plane: SVD of E

The results of the previous section essentially apply to SVD calculation of E. However, there is an additional simpli?cation due to the nature of the columns of E. Indeed, the cross-product
N ?1

In the previous section, we obtained the SVD of Π in the nominal case where the matrix D has 2 non-zero SVs. As we have already mentioned, for a typical detector network, there might exist certain sky locations where the second SV σ2 of D vanishes which implies that the rank of D degenerates to 1. In such cases, this degeneracy propagates to Π and subsequently its rank reduces from 4 to 2. In order to realize the consequences of this degeneracy, we ?rst consider a network of ideal GW detectors (with no instrumental noise). Let a GW chirp pass through such a network from a source in a sky location where σ2 = 0. The detector output is exactly equal to s. An estimate of the source parameters would then be obtained from the network data by inverting Eq. (21). However, in this case, this is impossible since it requires the inversion of an under-determined linear system (there are 4 unknowns and only 2 equations). This problem is identical to the one identi?ed and discussed at length in a series of articles devoted to unmodeled GW bursts [9, 10, 11], where this problem is formulated as follows: at those sky locations where D

eT e =
k=0

exp(2i?[k ]) ,

(31)

5

is an oscillating sum. This sum can be shown [4] to be of small amplitude under mild conditions compatible with

This amounts to saying that the two GW polarizations (i.e., the real and imaginary parts of exp i?[k]) are orthogonal and of equal norm. Note that this approximation is not required and can be relaxed. This would lead to use a version of the polarization pair ortho-normalized with a Gram-Schmidt procedure.

9 is degenerated, the GW response is essentially made of only one linear combination of the two GW polarizations. It is thus impossible to separate the two individual polarizations (unless additional prior information is provided). We want to stress here that this problem is not restricted to unmodeled GW bursts but also a?ects the case of chirping signals (and extends to the chirps from inspiralling binaries of NS or BH 6 ). This is mainly because the degeneracy arises from the geometry of the GW polarization plane which is same for any type of source. The degeneracy disappears at locations where σ2 > 0 even if it is in?nitesimally small. However, when σ2 is small, the inversion of the linear equations in Eq. (21) is very sensitive to perturbations. With real world GW detectors, instrumental noise a?ects the detector response i.e., perturbs the left-hand side of Eq. (21). A useful tool to investigate this is the condition number [11]. It is a well-known measure of the sensitivity of linear systems. The condition number of a matrix A is de?ned as the ratio of its largest SV to the smallest. For unitary matrices, cond (A) = 1. On the contrary, if A is rank de?cient, cond (A) → ∞. For the matrix Π, we have cond (Π) = σ1 = σ2 D + |?| . D ? | ?| (35)

FIG. 2: Degeneracy of the network response. We show here the inverse of cond(Π) for various detector networks (the abbreviated detector names are listed in Table I). The brighter regions of the sky correspond to the large conditioning number cond (Π). The fraction of the sky where 1/cond (Π) < 0.1 is (a) 25% (b) 4.5% (c) ? 0% (d) ? 0%. Since the LIGO detectors are almost aligned and they show the largest percentage of degeneracy.

In Fig. 2, we show full-sky plots of 1/cond(Π) for various con?gurations (these ?gures essentially reproduce the ones of [11]). We see that, even for networks of misaligned detectors, there are signi?cantly large patches where cond (Π) takes large values. In those regions, the inversion of Eq. (21) is sensitive to the presence of noise and the estimate of the extrinsic parameters thus have a large variance. a. Connection to the antenna pattern function — Interestingly, the SVs of D and F ≡ [f f ? ] coincide. This can be seen from the following relationships we directly obtained from the de?nitions in Eqs. (17), (18) and (20) t+ t? ? = F |t+ | |t? | . ? f ? f? = D |t? | |t+ | t? t? + (36)

When σ2 ? 0, we thus have |f+ × f× |2 ? 0 where f+ ≡ [f ] and f× ≡ [f ] are the network antenna pattern vectors. This means that at such sky locations, the antenna pattern vectors get aligned even if the detectors in the network are misaligned. In other words, despite the considered network is composed of misaligned detectors, it acts as a network of aligned detectors at those sky locations. (Of course, for perfectly co-aligned detectors, f+ ∝ f× at all sky locations.) Networks with many di?erent detectors having di?erent orientations are less likely to be degenerate. This is con?rmed in Fig. 2 where we see that the size of the degenerate sky patches reduces when the number of detector with varied orientations increases. For instance, with a network of LL-LH-G-V, (assuming they have identical noise spectrum), it goes to zero.

The matrix F can be obtained from D by a unitary transformation. Both matrices share the same singular spectrum. We can therefore write
d 2 σ2 = j =1 d 2

V. NETWORK LIKELIHOOD ANALYSIS: GW POLARIZATION PLANE AND SYNTHETIC STREAMS

|f [j ]|2 ?
j =1

f [j ] .

(37)

6

Contrary to the generic chirp model considered here, the phase and amplitude functions of inspiralling binary chirps follow a prescribed power-law time evolution. These di?erences a?ect only the geometry of the “chirp plane”, but not that of the “GW polarization plane”, hence the conclusion on the degeneracy remains the same.

Generally speaking, a signal detection problem amounts to testing the null hypothesis (H0 ) (absence of signal in the data) vs the alternate hypothesis (H1 ) (presence of signal in the data). Due to the presence of noise, two types of errors occur: false dismissals (decide H0 when H1 is present) and false alarms (decide H1 when H0 is present). There exist several objective criteria to determine the detection procedure (or statistic) which optimizes the occurrence of these errors. We choose the Neyman-Pearson (NP) approach which mini-

10 mizes the number of false dismissals for a ?xed false alarm rate. It is easily shown that for simple problems, the likelihood ratio (LR) is NP optimal. However, when the signal depends upon unknown parameters, the NP optimal (uniformly over all allowed parameter values) statistic is not easy to obtain. Indeed for most real-world problems, it does not even exist. However, the generalized likelihood ratio test (GLRT) [22] have shown to give sensible results and hence is widely used. In the GLRT approach, the parameters are replaced by their maximum likelihood estimates. In other words, the GLRT approach uses the maximum likelihood ratio as the statistic. Here, we opt for such a solution. As a ?rst step, we consider the simpli?ed situation where all detectors have independent and identical instrumental noises and this noise is white and Gaussian with unit variance. We will address the colored noise case later in Sec. V D. In this case, the logarithm of the network likelihood ratio (LLR) is given by Λ(x) = ? x ? s
2 2

Substituting Eq. (40) in Eq. (39), we get the LS minimum to be ? x) + x ? Λ(
2

= x ? UΠ UH Πx

2

,

(41)

H where we used VΠ VΠ = Ir . Eq. (41) can be further 7 simpli?ed into

? x ) = UH Λ( Πx

2

.

(42)

It is interesting to note that the operator UΠ UH Π is a (orthogonal) projection operator onto the signal space # (over the range of Π) i.e. UΠ UH Π Π = (ΠΠ )Π = Π.
2. Signal-to-noise ratio

+ x

2

,

(38)

where · is the Euclidean norm (here in RN d ) and we omitted an unimportant factor 1/2. The network data vector x is constructed on the similar lines as that of the network response s, i.e. ?rst, it stacks the data from T T all the detectors into xT = [xT 1 , x2 , . . . xd ] and then at each detector, the data is time-shifted to account for the delay in the arrival time xj = {xj [k ] = xj (tk + τj ), tk = ts k and k = 0 . . . N ? 1}.
A. Maximization over extrinsic parameters: scaling factors and phase shifts

The signal-to-noise ratio (SNR) measures the level of di?culty for detecting a signal in the noise. In the present case, along with the amplitude and duration of the incoming GW, the network SNR also depends on the relative position, orientation of the source with respect to the network. Therefore, the SNR should incorporate all these aspects. A systematic way to de?ne the SNR is to start from the statistic. Let the SNR ρ of an injected GW chirp s0 = Πp0 be
8

? s0 ). ρ2 ≡ Λ(

(43)

Following the GLRT approach, we maximize the network LLR Λ with respect to the parameters of s. We replace s by its model as given in Eq. (21) and consider at ?rst the maximization with respect to the extrinsic parameters p.
1. Least-square ?t

The maximization of the network LLR over p amounts to ?tting a linear signal model to the data in least square (LS) sense, viz. minimize ? Λ(x) + x
2

= x ? Πp

2

over p. (39)

This LS problem is easily solved using the pseudoinverse Π# of Π [20]. The estimate of p is then given by ? = Π# x . p (40) The pseudo-inverse can be expressed using the SVD 1 H # of Π as Π# = VΠ Σ? is always deΠ UΠ (note that Π ?ned since we use the compact SVD restricted to non-zero SVs).

Note that in this expression, the matrix Π in the statistic and in s0 are the same. Using the SVD of Π and the property of the projection operator UH Π UΠ = Ir , we get 2 2 ρ = s0 . The SNR is equal to the “signal energy” in the network √ data as de?ned in Eq. (22). Thus, the SNR ρ scales as N as expected and it depends on the source direction, polarization and network con?guration through f 9 . Fig. 3 illustrates how this factor the gain factor ? varies for the network formed by the two LIGO detectors and Virgo. Fig. 3 displays the ratio ρ/ρbest between the global SNR (obtained with a coherent analysis) and the largest individual SNR (obtained with the best detector of the network). The panels (a) and (b) are associated to the “worst” (minimum over all polarizations angles and ψ ) and “best” (maximum) cases respectively. Ideally, when the detectors √are aligned, the enhancement factor is expected to be d (≈ 1.73 in the present case). In the best case, the enhancement is 1.7 for more than half of the sky (94% of the sky when 1.4). In the worst case, the SNR enhancement is 1.28 at most and 8.5% of the sky gets a value 1.1.

7 8

9

For inspiral case, this expression is equivalent to Eq. (4.8) of [7]. If the noise power is not unity, it would divide the signal energy in this expression. When we have only one detector, the SNR ρ2 is consistent with the de?nition usually adopted in this case. The SNR ρ2 is similar to b2 de?ned in Eq. (3.17) of [7] in case of inspiralling binary signal and colored noise.

11 that the estimation goes worst with the conditioning of Π. Regularization techniques seem to give promising results in the context of GW burst detection [9, 10, 11]. Following this idea, we may consider to “regularize” the LS problem in Eq. (39). To do so, additional information on the expected parameters is required to counterbalance the rank-de?ciency. Unfortunately, we don’t expect p to follow a speci?c structure. The only sensible prior that can be assumed without reducing the generality of the search is that p is likely to be bound (since the GW have a limited amplitude A). It is known [23] that this type of prior is associated to the use of the so-called Tykhonov regulator and that we don’t expect signi?cant improvements upon the non-regularized solution. Probably, one di?erence might explain why regularization techniques do not work in the present case while it does work for burst detection. We recall that in the burst case, the parameter vector comparable to p are the samples of the waveform. This vector being a time-series, it is expected to have some structure, in particular it is expected to have some degree of smoothness. The use of this a priori information improves signi?cantly the ?nal estimation. While regularization will not help for the estimation of the extrinsic parameters, they may be of use to improve the detection statistic. We consider this separate question later in Sec. VII B.
B. Implementation with synthetic streams

FIG. 3: Bene?ts of a coherent network analysis (SNR enhancement). We display the polar maps of the following quantities for the LL-LH-V network (a) minψ, ρ/ρbest and (b) maxψ, ρ/ρbest . Here, ρbest designates the best SNR of the detectors in the network. The maximum, minimum are taken over all the polarization angles {ψ, }.

3.

From geometrical to physical parameter estimates

The components of p do not have a direct physical interpretation but as mentioned earlier, they are rather functions of the physical parameters. Following the above discussion, if we assume that we obtained pa? from the data through Eq. (40), rameter estimates p then one can retrieve the physical parameters A, φ0 , and ψ by inverting the non-linear map which links T ? ? ? to these parameters as p = a t? ? a t+ a t+ a t? given below ? = ( |p A ?[1]| + |p ?[2]|)2 , ?0 = 1 [arg(? φ p[1]) ? arg(? p[2])] , 2 ? = ? 1 [arg(? p[1]) + arg(? p[2])] , ψ 4 |p ?[2]| ? |p ?[1]| ? = cos?1 . |p ?[2]| + |p ?[1]| (44) (45) (46) (47)

In the previous section, we maximize the network LLR with respect to the extrinsic parameters resulting in the ? in Eq. (42). Here, we obtain a more simple statistic Λ ? which will be useful for and practical expression for Λ maximization over the remaining intrinsic parameters. From Eqs. (23) and (42), we have ? x) = (UD ? UE )H x Λ(
2

4.

Degeneracy and sensitivity of the estimate to noise

.

(49)

Upper-bounds for the estimation error can be obtained using a perturbative analysis of the LS problem in Eq. (39). A direct use of the result of [20], Sec. 5.3.8 yields √ ? ?p p N ≤ cond (Π). (48) p ρ This bound is a worst-case estimate obtained when the noise term which a?ects the data x is essentially concentrated along the directions associated to the smallest SV of Π. The noise is random and it spans isotropically all N d dimensions of the signal space. As described above, the space associated to the smallest SV has only 2 dimensions. Therefore, the worst case is very unlikely to occur and the above bound is largely over-estimated on the average. However, it gives a general trend and shows

It is useful to reshape the network data x into a N × d matrix X ≡ [x1 x2 . . . xd ]. This operation is inverse to the stack operator vec() de?ned in Appendix A. Using a property of the Kronecker product in Eq. (A2), we obtain the reformulation
? ? x) = vec(UH Λ( E XUD ) 2

.

(50)

There are two possibilities to make this matrix product, each being associated to a di?erent numerical imple? mentation for the evaluation of Λ. A ?rst choice is to ?rst multiply X by UH E and then by ? UD . In practice, this means that we ?rst compute the correlation of the data with a chirp template, then we combine the result using weights (related to the antenna pattern functions). This is the implementation proposed in [7]. It is probably the best for cases (like, searches of inspiralling binary chirps) where the number of chirp

12 templates is large (i.e., larger than the number of source locations) and where the correlations with templates are computed once and stored. The second choice is to ?rst multiply X by U? D and then by UH E which we adopt here. This means that we ?rst compute Y ≡ XU? D which transforms the network data into two N -dimensional complex data vectors [y1 , y2 ] ≡ Y through an “instantaneous” linear combination. Then, we correlate these vectors with the chirp template. We can consider y1 and y2 as the output of two “virtual” detectors. For this reason, we refer to those as synthetic streams in connection to [24] who ?rst coined the term for such combinations. Note that, irrespective of the number of detectors, one always gets at most two synthetic streams. We note that though the synthetic streams de?ned in [24] are ad-hoc (i.e., they have no relation with the LR), the ones obtained here directly arise from the maximization of the network LLR. We express the network LLR statistic in terms of the two synthetic streams as ? x) = 1 |eH y1 |2 + |eT y1 |2 + |eH y2 |2 + |eT y2 |2 , Λ( N (51) where yl = Xu? l for l = 1, 2. This expression can be further simpli?ed by using the symmetry (easily seen from Eqs. (29) and (30)), u? 1 = exp(iδ )u1 , We ?nally obtain ? x) = 2 (|eH y1 |2 + |eH y2 |2 ) . Λ( N (53) u? 2 = ? exp(iδ )u2 . (52)

FIG. 4: Color online — SNR per synthetic streams and bene?ts of a coherent network analysis (SNR enhancement). We display the polar maps of the following quantities for the LL-LH-V network: (a) ρ2 /ρ1 ψ, and (b) maxψ, ρ/ maxl ρl . We denote ρl the SNR of synthetic stream as de?ned in Eq. (57). The maximum and average are taken over all the polarization angles {ψ, }.

1.

SNR per synthetic streams

The network SNR can be split into the contributions from each synthetic stream i.e. we write ρ2 = 2 H p0 , as ΣΠ VΠ
2 ρ2 = ρ2 (56) 1 + ρ2 , √ where we de?ne ρl ≡ N σl (vl ? I2 )H p0 /2 for l = 1, 2. More explicitly, we have √ N ρl = σl |ql |A . (57) 2 The synthetic streams contributes di?erently depending on the polarization of the incoming wave. Fig. 4 illustrates this with the network formed by the two LIGO detectors and Virgo. Let us assume that p0 is randomly oriented. Since v1 and v2 have unit norms, we get the average value 0 < ρ2 /ρ1 ,ψ ∝ 1/cond (Π) ≤ 1 for most of the sky as indicated in Fig. 4 (a). Note that this panel matches well with Fig. 2 (b). Thus, on average, y1 contributes more to the SNR than y2 . However, the situation may be di?erent depending on the speci?c polarization state of the wave. Fig. 4 (b) show the maximum of the ratio ρ/ maxl=1,2 ρl for all √ polarization angles and ψ mostly takes the value ≈ 2. This implies that for a given direction, one can always ?nd polarization angles where the two synthetic streams contribute equally. This holds true for all the sky locations, except at the degenerate sky locations where y2 does not contribute, hence the SNR ratio is 1. Another way to see this is to examine the expression of the SNR di?erence in terms of the signal and network quantities, namely

The linear combination in each stream is such that the signal contributions from each detector add up constructively. In this sense, synthetic streams are similar to beam-formers used in array signal processing [25]. When the data is a noise free GW chirp, i.e., x = s, we then have
T ? T yl [k ] = pT (D ? E[k ])T u? l = p (σl vl ? E[k ] ) .

(54)

Here, E[k ] represents the k -th row of E. Writing explicitly, we have σ1 ? }eiδ/2 , y1 = √ {q1 h 2 iσ2 ? }eiδ/2 , y2 = √ {q2 h 2 (55)

where q1 = (t? e?iδ/2 + t+ eiδ/2 )? , q2 = (t? e?iδ/2 ? ? is as de?ned in Eq. (16). This t+ eiδ/2 )? and where h shows that the synthetic streams yl are rescaled and ? which enphase shifted copies of the initial GW chirp h hances the amplitude of the signal by the appropriate factor as shown above. To assess this enhancement, we compute the SNR per synthetic stream as below.

2 ρ2 l ? ρ2 =

N A2 4

|?| 2 +

1 + cos2 2 f+
4

2

+ cos2
4

? f× 2|?|

sin4 4

, (58)

13 where we have10 |?|2 = ( f+ + f× )2 ? 4 f+ × f× . In the simple case of a face-on source, i.e. = 0, and if f× is orthogonal to f+ with f× = f+ , then both synthetic streams carry the same SNR ρ1 = ρ2 = N/2A f+ . However, for other situations, some other wave polarization would lead the same. Inversely looking at min ,ψ ρ/ maxl ρl , it can be shown that one can always ?nd a GW polarization such that one of the synthetic streams does not contribute to the SNR.
2 2 2

C. 1.

Null streams

Review and relation to synthetic streams

The access to noise only data is crucial in signal detection problem. Such data is not directly available in GW experiments, but the use of multiple detectors allows to access it indirectly using the null streams. The general idea behind the null stream is to construct a data stream from the individual detector streams which nulli?es the signature of any incoming GW from a particular direction. Since this signal cancellation is speci?c to GWs, null streams naturally provide an extra tool to verify that a detected signal is indeed a GW or instead a GW like features mimicked by the detector noise whose detection thus has to be vetoed. This is a powerful check since it does not require detailed information about the potential GW signal under test, except an estimate of its source location. (Note that in practice, the implementation of the veto test may be complicated by the imprecision of the direction of arrival and of the errors of calibration [14]). The existence of null streams has been ?rst identi?ed in [12] in the case of three detector networks. At present, handful of literature [13, 14] exists on the use of null streams in GW data analysis. Null streams are usually introduced as a general postprocessing of the data independent of the detection of speci?c GWs. Below, we make this connection in the domain of our formalism. We recall that the network data at a given time (e.g., the ?rst row of the matrix X introduced in Sec. V B) is a d-dimensional vector in Rd . This space is a direct sum of the GW polarization plane and its orthogonal complementary space. We have shown that the GW polarization plane is a 2-dimensional space, spanned by a pair of orthonormal basis vectors which are associated to the two synthetic streams. The

complementary space to the GW polarization plane is a d ? 2 dimensional space and it is spanned by d ? 2 “null vectors”. Similarly to the synthetic streams, the null streams can be constructed from these null vectors. Thus, the numbers of synthetic and null streams sum up to d. Nominally, we have d ? 2 null streams. However, when the GW polarization plane degenerates to a 1-dimensional space (σ2 ? 0) as explained in Sec. IV B, the number of null vectors becomes d ? 1. For a two detector network, in the nominal case, there is no null stream as d ? 2 = 0. However, for degenerate directions, one can construct a null stream. For aligned pair of detectors (as it is almost the case for the two LIGO LH and LL), the fraction of the degenerate sky location is large, see Fig. 2. This null stream would turn out to be useful for vetoing in this case. In the next section, we explain how the null streams can be obtained numerically in the nominal case. The extension to the degenerate case is straightforward.

2.

Obtaining the null streams numerically

The numerical construction of the null streams can be achieved in various ways. One such approach could be to obtain the full SVD of D and construct the null streams from the eigen-vectors corresponding to the zero SVs. This approach was taken in [14]. Here, we take an alternative approach. We construct the null streams by successive construction of orthonormal vectors via multidimensional cross product as described below. Assuming some direction of arrival, we express any instantaneous linear combination of the time-shifted data (to compensate for di?erent time of arrivals at the detectors’ site with respect to the reference) as y(x) ≡ Xu, (59)

where the vector u ∈ Cd×1 contains the tap coe?cients. Eq. (59) can be rewritten as y(x) = vec(IN Xu) = (uT ? IN )x. (60)

The vector u de?nes a null-stream if y(x) = 0N whenever x is a GW. Let us assume that we indeed observe a GW chirp i.e., x = s0 ≡ Πp0 . We thus have
H y(s0 ) = [(uT UD ) ? UE ]ΣΠ VΠ p0 .

(61)

If u is in the null space of UD , the null-stream condition is satis?ed for all p0 . Since the null space of UD is orthogonal to its range, an obvious choice for u is
10

The synthetic streams (on the average sense) are also connected to the directional streams introduced in the context of LISA [26]. If we integrate ρ2 angles l over the inclination and polarization ? ?2 2 )/2 ? ? ? , ψ , we obtain (ρ2 ? ρ = 2 | ? | / 5 and f = 2D/5. ,ψ ,ψ 1 2 Thus, the SNRs of the synthetic streams ρ2 l when averaged over the polarization angles are proportional to the SNRs obtained by v+ and v× – the directional streams in the LISA data analysis, see Eqs.(25-28) of [26].

d? × d . u = u1 × u2 = √ D 2 ? ?2

(62)

Nominally, UD is a 2-dimensional plane in Cd . Its null space is therefore d ? 2 dimensional. An orthonormal basis of this space can be obtained recursively starting

14 from u3 = u as de?ned above and applying the following generalized vector cross-product formula for n > 3: un [i] =
ijkl...m u1 [j ]u2 [k ]u3 [l] . . . un?1 [m].

(63)

Here, ijkl...m is the Levi-Civita symbol 11 . The un denotes an orthonormal set of d ? 2 vectors, {un , for 3 ≤ n ≤ d}. The components of these vectors are the tap coe?cients to compute the null-streams. By construction, the resulting null streams are uncorrelated and have the same variance. To summarize the main features of our formalism. The representation of a GW network response of unmodeled chirp as a Kronecker product between the GW polarization plane and the chirp plane forms the main ingredient of this formalism. Such a representation allows the signal to reveal the degeneracy in a natural manner in the network response. It also evidences the two facets of the coherent network detection problem, namely, the network signal detection via synthetic streams and vetoing via null streams. The coherent formalism developed in [7] for inspiralling binaries lacked this vetoing feature due to the di?erence in the signal representation. In the rest of this paper, we do not discuss/demonstrate the null streams applied as a vetoing tool to the simulated data. This will be demonstrated in the subsequent work with the real data from the ongoing GW experiments.

E (a ? E[a])(a ? E[a])H where E[.] denotes the expectation. From the independence of the noise components, the overall covariance matrix of the network noise vector is then a block-diagonal matrix, where all the blocks are identical and equal to R0 : R = diag(R0 ) ≡ Id ? R0 . In this case, the network LLR becomes Λ(x) = ? x ? Πp
2 2 R?1

+ x

2 , R?1

(64)

where the notation · R?1 denotes the norm induced by the inner product associated to the covariance matrix 2 R?1 , i.e., a R?1 = aH R?1 a. ? = R?1/2 Π and Introducing the whitened version Π ? 1 / 2 ? = R x x of Π and x respectively, Eq. (64) can be rewritten as ? ? ? Πp Λ(x) = ? x
2

? + x

2

.

(65)

which is similar to Eq. (38) where all the quantities are replaced by their whitened version. Thus, the maximization of Λ(x) with respect to the extrinsic parameters p will follow the same algebra as that derived in V. However, for the sake of completeness, we detail it below. Following Sec. V, maximizing Λ(x) with respect to the extrinsic parameters p leads to ? #x ?=Π ?, p (66)

D.

Colored noise

? # is the pseudo-inverse of Π ? . Expressing this where Π ? as Π ?# = pseudo-inverse by means of the SVD of Π ?1 H VΠ Σ U and introducing Eq. (66) into Eq. (65) pro? Π ? ? Π vides the new statistic ? x ) = UH ? Λ( ?x Π
2

The formalism developed till now was exclusively targeted for the white noise case. We assumed that the noise at each detector is white Gaussian. In this subsection, we extend our formalism to the colored noise case. We remind the reader that the main focus of this paper is to develop the coherent network strategy to detect unmodeled GW chirps with an interferometric detector network. Hence, we give more emphasis on the basic formalism and keep the colored noise case with basic minimal assumption: the noise from the di?erent detectors is colored but with same covariance. Based on this ground work, the work is in progress to extend this to the colored noise case with di?erent noise covariances. Let us therefore assume now that the noise components in each detector are independent and colored, with the same covariance matrix R0 . Recall that the covariance matrix of a random vector a is de?ned as

.

(67)

Now, from the de?nition of Π and the speci?c structure of R, it is straightforward to see that ? = R?1/2 (D ? E) = D ? (R?1/2 E) = D ? E ?, Π 0 (68)

? = where we have introduced the whitened version e ?1/2 R0 e of the chirp signal and the corresponding matrix ? = [? ?? ]/2. E ee For the white noise case, the statistic (67) can then be ?: rewritten in terms of the SVD of the matrices D and E ? x) = (UD ? U ? )H x ? Λ( E
2

.

(69)

The computation of UE ? is similar to the computa?T e ? tion of UE 0, ? . Furthermore, if we note that e ?H e ? = N , it turns out that and if we assume that e √ √ ?1/2 ? UE E/ N . Using the property ? = 2E/ N = 2R0 of the Kronecker product in Eq. (A2), we then obtain ? ? ?) ? x) = vec(EH XU Λ( D
2

11

The Levi-Civita symbol is de?ned as
ij...

,

(70)

≡ +1 ≡ ?1 ≡0

when i, j, . . . is an even permutation of 1, 2, . . . when i, j, . . . is an odd permutation of 1, 2, . . . when any two labels are equal.

? ? = [x ? ? ? ?1x ?2 . . . x ? d ] contains the data vecwhere the matrix X ? ? j = R?1/2 x ?j = tor from each detector whitened twice: x ?1 R xj .

15 As this expression is similar to the white noise case, ? ? ? and ? ? ?1, y ? 2 ] = XU we can form two synthetic streams [y D use them to express the LLR statistic as ? x) = 2 (|eH y ? ? ? 1 |2 + |eH y ? 2 |2 ). Λ( N (71)
1. Chirplet chains: tight template bank for smooth chirps

In this expression, the only di?erence with the white noise LLR of (53) comes from the computation of the ? ? ? 1 and y ? 2 which are obtained after synthetic streams y double-whitening the data.

VI.

MAXIMIZATION OVER THE INTRINSIC PARAMETERS

In the previous section, we maximized the network LLR over the extrinsic parameters of the signal model, assuming that the remaining parameters (the source location angles φ and θ and the phase function ?(·)) were known. By de?nition, the intrinsic parameters modify the network LLR non-linearly. For this reason, the maximiza? over these parameters is more di?cult. It cantion of Λ not be done analytically and must be performed numerically, for instance with an exhaustive search of the max? over the entire range imum by repeatedly computing Λ of possibilities. While the exhaustive search can be employed for the source location angles, it is not applicable to the chirp phase function, which requires a speci?c method. For the single detector case, we had addressed this issue in [4] with an original maximization scheme which is the cornerstone of the best chirplet chain (BCC) algorithm. Here, we use and adapt the principles of BCC to the multiple detector case.

A.

Chirp phase function

Let us examine ?rst the case of the detection of inspiralling binary chirps. In this case, the chirp phase is a prescribed function of a small number of parameters i.e., the masses and spins of the binary stars. The maximization over those is performed by constructing a grid of reference or template waveforms which are used to search the data. This grid samples the range of the physical parameters. This sampling must be accurate (the template grid must be tight) to avoid missing any chirp. Tight grid of templates can be obtained in the nonparametric case (large number of parameters) i.e., when the chirp is not completely known. We have shown in [4] how to construct a template grid which covers entirely the set of smooth chirps i.e., chirps whose frequency evolution has some regularity as described in Sec. II B 2. In the next section, we brie?y describe this construction.

We refer to the template forming this grid as chirplet chain (CC). These CCs are constructed on a simple geometrical idea: a broken line is a good approximation of a smooth curve. Since the frequency of a smooth chirp follows a smooth frequency vs. time curve, we construct templates that are broken lines in the time-frequency (TF) plane. More precisely, CC are de?ned as follows. We start by sampling the TF plane with a regular grid consisting of Nt time bins and Nf frequency bins. We build the template waveforms like a puzzle by assembling small chirp pieces which we refer to as chirplets. A chirplet is a signal with a frequency joining linearly two neighboring vertices of the grid. The result of this assembly is a chirplet chain i.e., a piecewise linear chirp. Since we are concerned with continuous frequency evolution with bounded variations, we only form continuous chains. We control the variations of the CC frequency. The frequency of a single chirplet does not increase or decrease more than Nr frequency bins over a time bin. Similarly, the di?erence of the frequency variations of two successive chirplets in a chain does not increase or decrease more than Nr frequency bins. The CC grid is de?ned by four parameters namely Nt , Nf , Nr and Nr . Those are the available degrees of freedom we can tune to make the CC grid tight. A tem? s; ? ) ∝ plate grid is tight if the network ambiguity Λ( H H 2 2 |e y1 (s)| + |e y2 (s)| which measures the similarity between an arbitrary chirp (of phase ?) and its closest template (of phase ? ), is large enough and relatively closed to the maximum (when ? = ?). As stated in Eq. (55), in presence of a noise free GW chirp, the synthetic streams yl (s) are rescaled and phase shifted copies of the initial GW chirp s. Therefore, we treat the network ambiguity as a sum of ambiguities from ? s; ? ) is the two virtual detectors where each terms in Λ( ambiguity computed in the single detector case. An estimate of the ambiguity has been obtained in [4] for this ? s; ? ). case. It can thus be directly reused to compute Λ( The bottom line is that the ratio of the ambiguity to its maximum for the network case remains unaltered as compared to the single detector case and thus same for the tight grid conditions. In conclusion, the rules (which we won’t repeat here) established in [4] to set the search parameters can also be applied here.

2.

Search through CCs in the time-frequency plane: best network CC algorithm

We have now to search through the CC grid to ?nd the best matching template, i.e., which maximizes ? x; ? ). Counting the number of possible maxall CCs ? Λ( CCs to be searched over is a combinatorial problem. This count grows exponentially with the number of time bins Nt . In the situation of interest, it reaches prohibitively

16 large values. The family of CCs cannot be scanned exhaustively and the template based search is intractable. In [4], we propose an alternative scheme yielding a close approximation of the maximum for the single detector statistic. When applied to the network, the scheme demands to reformulate the network statistic in the TF plane. The TF plane o?ers a natural and geometrically simple representation of chirp signals which simpli?es the statistic. It turns out that the resulting statistic falls in a class of objective functions where e?cient combinatorial optimization algorithms can be used. We now explain this result in more detail. We use the TF representation given by the discrete Wigner-Ville (WV) distribution [27] de?ned for the time series x[n] with n = 0, . . . , N ? 1 as
+kn

Thus, substituting in Eq. (74), we obtain the following reformulation of the network statistic ? x) = 2 Λ( N
N ?1

wy (n, mn ).
n=0

(76)

wx (n, m) ≡
k=?kn

x[ n + k/2 ]x? [ n ? k/2 ] e?2πimk/(2N ) ,

(72) with kn ≡ min{2n, 2N ? 1 ? 2n}, where · gives the integer part. The arguments of wx are the time index n and the frequency index m which correspond, in physical units, to the time tn = ts n and the frequency νm = νs m/(2N ) for 0 ≤ m ≤ N and νm = νs (N ? m)/(2N ) for N + 1 ≤ m ≤ 2N ? 1. The above WV distribution is a unitary representation. This means that the scalar products of two signals can be re-expressed as scalar products of their WV. Let x1 [n] and x2 [n] be two time series. The unitarity property of wx is expressed by the Moyal’s formula as stated below
N ?1 2

? x) over the set of CC amounts The maximization of Λ( to ?nding the TF path that maximizes the integral Eq. (76), which is equivalent to a longest path problem in the TF plane. This problem is structurally identical to the single detector case (the only change is the way we obtain the TF map). We can therefore essentially re-use the scheme proposed earlier for this latter case. The latter belongs to a class of combinatorial optimization problems where e?cient (polynomial time) algorithms exist. We use one such algorithm, namely, the dynamic programming. In conclusion, the combination of the two ingredients namely the synthetic streams and the phase maximization scheme used in BCC allows us to coherently search the unmodeled GW chirps in the data of GW detector network. We refer to this procedure as the best network CC (BNCC) algorithm.
B. Source sky position

x1 [n] x? 2 [n]
n=0

=

1 2N

N ?1 2N ?1

wx1 (n, m) wx2 (n, m).
n=0 m=0

(73) Applying this property to the network statistic in Eq. (53), we get ? x) = 1 Λ( N2
N ?1 2N ?1

As we are performing maximization successively, till now we assume that we know the sky position of the source. Knowing the sky position, we construct the synthetic streams with appropriate direction dependent weight factors, time-delay shifts and carry out the BNCC algorithm for chirp phase detection. In reality, the sky position is unknown. One needs to search through the entire sky by sampling the celestial sphere with a grid and repeating the above procedure for each point on this grid.
C. Time of arrival

wy (n, m)we (n, m).
n=0 m=0

(74) Since we process the data streams sequentially and block-wise, the maximization over t0 amounts to selecting that block where the statistic arrives at a local maximum (i.e., the maximum of the “detection peak”). The epoch of this block yields an estimate of t0 . The resolution of the estimate may be improved by increasing the overlap between two consecutive blocks.
D. Estimation of computational cost

where wy = wy1 + wy2 combines the individual WVs of the two synthetic streams. ? x), we need to have a model for In order to compute Λ( we . We know that the WV distribution of a linear chirp (whose frequency is a linear function of time) is essentially concentrated in the neighborhood of its instantaneous frequency [27]. We assume that it also holds true for an arbitrary (non-linear) chirp. Applying this approximation to the WV we of the template CC in Eq. (74), we get we (n, m) ≈ 2N δ (m ? mn ), (75)

where mn denotes the nearest integer of 2T ν (tn ) and ν is the instantaneous frequency of the CC.

We estimate the computational cost of the BNCC search by counting the ?oating-point operations (?ops) required by its various subparts. The algorithm consists essentially in repeating the one-detector search for all sky location angles. Let N? be the number of bins of the sky grid. The total cost is therefore N? times

17 the cost of the one-detector search, which we give in [4] and summarize now. The computation of the WV of the two synthetic streams requires 10N Nf log2 Nf ?ops and the BCC search applied to the combined WV requires [N + (2Nr + 1)Nt ]Nc ?ops, where Nc ≈ (2Nr + 1)Nf is the total number of chirplets. Since this last part of the algorithm dominates, the over-all cost thus scales with C ∝ N? [N + (2Nr + 1)Nt ](2Nr + 1)Nf . (77)

These operations are applied to each blocks (of duration T ) the data streams. The computational power needed to process the data in real time is thus given by C/(?T ) where ? is the overlap between two successive blocks.
VII. RESULTS WITH SIMULATED DATA AND DISCUSSION Proof of principle of a full blind search

A.

We present here a proof of principle for the proposed detection method. For this case study, we consider a network of three detectors placed and oriented like the existing Virgo and the two four-kilometer LIGO detectors. The coordinates and orientation of these detectors can be found in Table I. We assume a simpli?ed model for detector noise which we generate independently for each detector, using a white Gaussian noise. Fig. 5 illustrates the possibility of a “full blind” search in this situation. This means that we perform the detection jointly with the estimation of the GW chirp frequency and the source sky location.
1. Description of the test signal

FIG. 5: Color online — Coherent detection/estimation of a “random” chirp with network of three GW antennas. In the data of three GW antennas (the two LIGO and Virgo), we inject (a) a “random” GW chirp emitted from a source at the position marked with a “+” at φ = 2.8 rad and θ = 0.4 rad. We perform a full sky search using the best network chirplet chain algorithm. It produces a likelihood landscape (b) where we select the maximum. This is the detection point and it is indicated with “×”. In (c) we show the combined WV distribution of the synthetic streams at the detection point. In (d), we compare the exact frequency of the chirp (solid/blue) with the estimation (dashed/red) obtained at the detection point.

2.

Search parameters

Because of computational limitation, we restrict this study to rather short chirps of N = 256 samples, i.e., a chirp duration T = 250 ms assuming a sampling rate of νs = 1024 Hz. The chirp frequency follows a random time evolution which however satis?es chirping rate constraints. We make sure that the ?rst and second derivatives of the chirp frequency are not larger than F = 9.2 kHz/s and F = 1.57 MHz/s2 respectively. The chosen test signal has about 50 cycles. This is a larger number than what is considered typically for burst GWs ( ? 10). As a comparison with a well-known physical case, an inspiralling (equal mass) binary with total mass M = 11M reaches the same maximum frequency variations at the last stable circular orbit. (Binary chirps with larger total mass also satisfy these chirping rate limits). We set the SNR to ρ = 20. The chirp is injected at the sky position φ = 2.8 rad and θ = 0.4 rad where the contributions of the individual detectors are comparable, namely the individual SNR are 10.4, 10.15 and 13.77 for Virgo, LIGO Hanford and LIGO Livingstone respectively.

We search through the set of CCs de?ned over a TF grid with Nt = 128 time intervals and N = Nf = 256 frequency bins (using fs = 2048 Hz). We set the regularity parameters to Nr = 9 and Nr = 3, consistent to the above chirping rate limits. We select an ad-hoc sky grid by dividing regularly the full range of the source localization angles θ and φ into 128 bins. The resulting grid has therefore a total of N? = 16384 bins. This is probably much ?ner than is required to perform the detection without missing candidate. However, this oversampling leads to precise likelihood sky maps which helps to diagnose the method. With this parameter choice, the estimated computational power required to analyzed the data in real time is of 2.8 TFlops, assuming an overlap of ? = 50% between successive data blocks. Because of the crude choice for the sky grid, this requirement is probably over-estimated. The result of the search is displayed in Fig. 5 where we see that the injection is recovered both in sky position and frequency evolution. The source position is ? = 2.8 rad and θ ? = 0.39 rad. estimated at φ

18
B. Regularized variants

As shown in Sec. V B 1, the SNR carried by the synthetic stream is proportional to the corresponding SV. When the GW polarization plane is degenerate (i.e., when σ2 is small), the second synthetic stream contains almost only noise. We thus don’t lose information if we suppress its contribution from the statistic. This is the basic idea of Klimenko et al. in [9]. We have seen that the estimation of the extrinsic parameters is an ill-posed least-square problem in those cases. Suppressing the contribution of the second synthetic stream amounts to regularizing this problem [9]. In practice, this regularization can be done in various ways, corresponding to well-identi?ed schemes. A ?rst possibility is to suppress the contribution of the second synthetic stream when the conditioning number of Π is too large (i.e., exceeds a given threshold). This scheme is referred to as truncated SVD [23]. A second possibility is to balance (divide) the contribution of the second synthetic stream by the conditioning number. This is referred to as the Tykhonov approach [23] and it was proposed for regularizing burst searches in [11]. In Fig. 6, we compare the likelihood landscape and frequency estimate obtained with the standard statistic and its regularized version using the Tykhonov approach. Visually, the regularization improves the contrast and concentration of the likelihood landscape around the injection point. This can be assessed more quantitatively with the contrast de?ned as the ratio of the likelihood landscape extremes. This contrast is improved by about 10% for the regularized statistic as compared to the standard version. It is also interesting to compare the “width” of the detection peak obtained with the two statistic. To do this, we measure the solid angle of the the sky region where the statistic is larger than 90% of the maximum. This angle is reduced by a factor of ? 6 when computed with the regularized statistic. There is however no major improvement of the frequency estimate. More generally, it is unclear whether the regularized statistic performs better than the standard one.

FIG. 6: Color online — Coherent detection/estimation of a “random” chirp with network of three GW antennas. Standard and regularized statistic. We compare the likelihood landscape (left) and frequency estimation (right) obtained using the standard (top) and Tykhonov-regularized (bottom) versions of the network statistic. The test signal is a “random” GW chirp injected at the sky location marked with a “+”. This location has been chosen because of the associated large value of the conditioning number, namely cond (Π) ≈ 192.

VIII.

CONCLUDING REMARKS

The coherent detection of unmodeled chirps with a network of GW have features and issues in common with the burst one. In particular, the same geometrical objects play a key role. While the noise spans the whole d dimensional data space, GW signals (chirps or burst) only belong to a two-dimensional (one dimension per GW polarizations) subspace, the GW polarization plane. Detecting GWs amounts to checking whether the data has signi?cant components in this plane or not. To do so, we compute the projections of the data onto a basis of the GW polarization plane. In practice, this de?nes two instantaneous linear mixtures of the individual detector data which we refer to as synthetic streams. Those may

be considered as the output data of “virtual” detectors. This combination is such that the GW contributions from each real detector add constructively. The GW signature thus has a larger amplitude in the synthetic streams while the noise variance is kept at the same level. The coherent detection amounts to looking for an excess in the signal energy in one or both synthetic streams (depending on the GW polarization model). This provides a generic and simple procedure to produce a coherent detection pipeline from a one detector pipeline. In the one detector case, the BCC search performs a path search in a time-frequency distribution of the data. In the multiple detector case, the BNCC search now use the joint time-frequency map obtained by summing the time-frequency energy distributions of the two synthetic streams. The approach does not restrict to chirp detection and it can be applied to burst searches [14]. We demonstrated in a simpli?ed situation that the fullsky blind detection of an unmodeled chirp is feasible. This means that the detection is performed jointly to estimate the source location and the frequency evolution. The application of this method to the real data however requires several improvements. First, the method has to be adapted to the case where the detectors have di?erent sensitivities. In this respect, we already obtained ?rst results [28]. We also have to re?ne the choice of the grid which samples the celestial sphere. In the present work, we select an ad-hoc grid. Clearly, the sky resolution and the bin shape depends on the geometry of the sphere and the

19 location and orientation of the detectors in the considered network. A better grid choice (not too coarse to avoid SNR loses, or and not too ?ne to avoid using useless computing resources) should incorporate this information keeping the search performance (detection probability and sky resolution) constant. In this respect, we may consider to other parameterizations of the sky location which makes the de?nition of the sky grid easier, for instance by choosing the time-delays as investigated in [7]. We may also explore hierarchical schemes for the reduction of the computational cost. The GW polarization plane depends on the detector antenna patterns functions. With the presently available networks, there are signi?cantly large sky regions where the antenna patterns are almost aligned. In this case, the network observes essentially one polarization and is almost insensitive to the other: the GW polarization plane reduces to a one-dimensional space. The information carried by the missing polarization lacks and this makes the estimation of certain parameters ill-posed and hence very sensitive to noise. We can evaluate that the variance of the estimate scales with the condition number of the antenna pattern matrix. When this number (which quanti?es in some sense the mutual alignment of the detectors) is large, the estimation is ill-posed and we expect poor results. This is an important issue for burst detection since it a?ects signi?cantly the shape of the estimated waveform (and, particularly the regularity of its time evolution). This has motivated the development of regularization schemes which penalize the estimation of non-physical (i.e., irregular) waveforms. We have shown that this is however less of a problem for chirps because of their more constrained model. Ill-conditioning only a?ects global scaling factors in the chirp model. Unlike bursts, no additional prior is available for regularizing the estimation of these scaling factors. The data space can be decomposed as the direct sum of the GW polarization plane and its complementary. While GWs have zero components in the latter null space, it is unlikely that instrumental noise (including its nonGaussian and non-stationary part) will. This motivates the use of null streams (i.e., the projection of the data along a basis of the complementary space) to verify that a trigger is indeed a GW candidate and not an instrumental artifact. Since null streams are inexpensive to compute, we consider to use them to make preemptive cuts in order to avoid the analysis of bad data.
APPENDIX A: KRONECKER PRODUCT: DEFINITION AND PROPERTIES

The Kronecker product ? transforms two matrices A ∈ Cm×n and B ∈ Cp×q into the following matrix of Cmp×nq [21] ? a11 B . . . a1n B ? ? . . .. . A?B≡? . . . . ?. am1 B . . . amn B ?

(A1)

The Kronecker product is a linear transform and can be considered as a special case of the tensor product. We de?ne the operator vec() to be the stack operator which transforms the matrix into a vector by stacking its columns, i.e. x ≡ vec(X). In the text, we use the following property: (A ? B)vec(X) = vec(BXAT ). The proof of this property is straightforward. (A2)

APPENDIX B: INTERFEROMETRIC DETECTOR RESPONSE IN TERMS OF GEL’FAND FUNCTIONS

The GW response of a detector to an incoming GW can be obtained by computing the interaction of the wave tensor W with the detector tensor D as follows 12 :
3

s=
i,j =1

W ij Dij .

(B1)

The wave tensor is related to the incoming GW tensor in the TT gauge by hij = 2Wij . Both detector and wave tensors are rank 2 STF tensors. Any STF tensor can be expanded in the basis of spin-weighted spherical harmonics of rank 2 and the rank-2 Gel’fand functions provide the corresponding coe?cients. Further, they are representation of rotation group SO(3) and provide compact representation for the detector response of any arbitrarily oriented and located detector on Earth which we present in this appendix [29]. a. Wave tensor — The incoming GW tensor in TT gauge is given by
T hT ij = (exi exj ? eyi eyj )h+ + 2(exi eyj )h× ,

(B2)

Acknowledgments

AP is supported by the Alexander von Humboldt Foundation’s Sofja Kovalevskaja Programme (funded by the German Ministry of Education and Research). OR is supported by the Virgo-EGO Scienti?c Forum. The authors would like to thank J.-F. Cardoso for interesting exchange of ideas.

where ex and ey are unit vectors along the xw and yw axes in the wave frame; h+ and h× √ are the two GW polarizations. Let m ? = (ex + iey )/ 2 be a complex

12

Unless otherwise mentioned, the notations and symbols used in all appendices are con?ned to those appendices only.

20 vector in the wave frame. Then, the wave tensor can be written down in terms of m as W ij = [(mi mj )? h] , (B3) O(φe , θe , ψe ) = O(φe , θe , ψe )O?1 (α, β, γ ) . (B11) two: detector to Earth’s frame and Earth’s frame to wave frame by the following rotation transformations as given in Eqs. (5) and (6)

where we used the complex quantity h = h+ + ih× which combines both GW polarizations. The term mi mj is a STF tensor of rank 2. We choose to work in the detector frame for convenience. Expanding mi mj in terms of spin-weighted spherical harmonics of ij rank 2, namely Y2 n and the rank-2 Gel’fand functions Tmn (φe , θe , ψe ), we get mm =
i j

The above successive rotation transformation can be translated into the addition theorem of Gel’fand functions [30] as given below
2 ? Tml (φe , θe , ψe )Tnl (α, β, γ ) . l=?2

Tmn (φe , θe , ψe ) =

8π 15

2 ij Y2 n T2n (φe , θe , ψe ) , n=?2

(B4)

The angles (φe , θe , ψe ) are the Euler angles of the rotation operator which transforms the detector coordinates into the wave coordinates. Substituting Eq. (B4) into Eq. (B3), we express the wave tensor in terms of the Gel’fand functions as W ij = b. 8π 15
2 ij [hY2 n T?2n ] . n=?2

(B12) We used the fact that the inverse rotation operator is associated to a complex conjugation. Substituting in Eq. (B9), we rewrite the antenna pattern functions in terms of the Gel’fand functions as
2

f=
s=?2

iT2s (φe , θe , ψe )[T2s (α, β, γ ) ? T?2s (α, β, γ )]? .

(B5)

Detector tensor — The detector tensor is Dij = n1i n1j ? n2i n2j , (B6)

(B13) Substituting in the extended beam pattern function given in Eq. (B10) and combining the dependencies upon ψ = ψe and , we get ? = T22 (ψ, , 0)d + T2?2 (ψ, , 0)d? , f where
2

(B14)

where n1 and n2 are the unit vectors along the ?rst and second arms of the interferometer. Recall that we choose the xd -axis of the detector frame along the bisector of the two arms. The yd -axis is chosen such that (xd , yd , zd ) is a right handed coordinate system with zd pointing towards the local zenith. With this choice, we have D11 = D22 = 0 , D12 = D21 = ?1 . (B7)

d=?
n=?2

iT2n (φe , θe , 0)[T2n (α, β, γ ) ? T?2n (α, β, γ )]? .

From Eqs. (B6) and (B7), the detector response is s= [f ? h], (B8)

(B15) There are various ways of expressing the antenna pattern functions. The main advantages of this one is that it is particularly compact and that the angles ψ and get factorized from the rest of the parameters. This helps in the maximization of the network LLR over the extrinsic parameters.

where the complex antenna pattern function is given by f = i[T2?2 (φe , θe , ψe ) ? T22 (φe , θe , ψe )] . (B9)
APPENDIX C: SVD OF A TWO-COLUMN COMPLEX MATRIX

From the expansion of above Eq. (B8) in terms of GW polarizations, it is consistent to de?ne f = f+ + if× , which yields Eq. (13). c. Extended complex antenna pattern for sources orbiting in a ?xed plane — As discussed in Sec. III D 1, the extended antenna pattern functions incorporate the inclination angle and is given in Eq. (17) as
2 ? = 1 + cos f+ + i cos f× . f 2

In this appendix, we obtain the SVD of a complex matrix of the type A ≡ [a, a? ] where a ∈ CN ×1 . The SVD H decomposes A into the product A = UA ΣA VA where UA and VA are two orthogonal matrices and ΣA is a positive de?nite diagonal matrix. To obtain it analytically, we ?rst get the eigen-decomposition of AH A = aH a aH a? aT a aT a? ≡ a b? b a . (C1)

(B10)

where f+,× depend on the relative orientation of wave frame with respect to the detector frame. The detector to wave frame coordinate transformation can be split into

We distinguish two cases depending on the value of b.

21
1. For |b| > 0
1 We then form the matrix UA = AVA Σ? A ≡ [u+ , u? ] containing the right-handed singular vectors, with

The eigenvalues σ± and the eigenvectors v± of AH A are given below;
2 σ± = a ± |b|,

(C2) , (C3)

u± =

exp(?i )a ± a? √ . 2σ±

(C6)

1 v± = √ 2

exp(?i ) ±1

where = arg b = arg[aT a]. The number of non-zero eigenvalues of AH A gives the rank of A. The eigenvalues arranged in the descending order form the diagonal values of Σ2 A as shown below. The eigenvectors v± are the right-handed singular vectors of A and form VA as given below: ΣA = VA = σ+ 0 0 σ? v+ v? . (C4) (C5)

The above expressions are valid only when the two SV are non zero. It is possible that the smallest SV σ? vanishes. In this case, the SVD collapses to UA = u+ , ΣA = σ+ , and VA = v+ .

2.

For |b| = 0

In this case, √ the matrix AH A = aI2 is diagonal. We √ thus have Σ = aI2 , VA = I2 and UA = A/ a.

[1] GEO600 www.geo600.uni-hannover.de, LIGO http:// www.ligo.org, Virgo http://www.virgo.infn.it. [2] W. Anderson and R. Balasubramanian, Phys. Rev. D60, 102001 (1999), gr-qc/9905023. [3] E. Cand` es, P. Charlton, and H. Helgason, Appl. Comput. Harmon. Anal. (2007), in press. [4] E. Chassande-Mottin and A. Pai, Phys. Rev. D73, 042003 (2006), gr-qc/0512137. [5] N. Arnaud et al., Phys. Rev. D68, 102001 (2003), grqc/0307100. [6] H. Mukhopadhyay, N. Sago, H. Tagoshi, H. Takahashi, and N. Kanda, Phys. Rev. D74, 083005 (2006), grqc/0608103. [7] A. Pai, S. Dhurandhar, and S. Bose, Phys. Rev. D64, 042004 (2001), gr-qc/0009078. [8] L. S. Finn, Phys. Rev. D63, 102001 (2001), grqc/0010033. [9] S. Klimenko, S. Mohanty, M. Rakhmanov, and G. Mitselmakher, Phys. Rev. D72 (2005). [10] S. Mohanty, M. Rakhmanov, S. Klimenko, and G. Mitselmakher, Class. Quantum Grav. 23 (2006). [11] M. Rakhmanov, Class. Quantum Grav. 23 (2006). [12] Y. Guersel and M. Tinto (1990), in *Capri 1990, Proceedings, General relativity and gravitational physics* 620-623. [13] L. Wen and B. F. Schutz, Class. Quant. Grav. 22, S1321 (2005), gr-qc/0508042. [14] S. Chatterji et al., Phys. Rev. D74, 082005 (2006), grqc/0605002. [15] E. E. Flanagan and S. A. Hughes, New Journal of Physics 7 (2005). [16] K. S. Thorne, Rev. Mod. Phys. 52, 299 (1980). [17] E. Berti et al. (0300), gr-qc/0703053. [18] E. E. Flanagan and S. A. Hughes, Phys. Rev. D57, 4535 (1998), gr-qc/9701039. [19] H. Goldstein, Classical mechanics (Addison-Wesley, Red-

wood City CA, 1980), 2nd ed. [20] G. H. Golub and C. F. Van Loan, Matrix computations (Johns Hopkins University Press, Baltimore, US, 1996), 3rd ed. [21] R. A. Horn and C. R. Johnson, Topics in Matrix Analysis (Cambridge University Press, Cambridge, UK, 1991). [22] S. Kay, Fundamentals of Statistical Signal Processing: Detection theory (Prentice Hall, 1998). [23] A. Neumaier, SIAM Rev. 40, 636 (1998). [24] J. Sylvestre, Phys. Rev. D68, 102005 (2003), grqc/0308062. [25] H. L. Van Trees, Optimum array processing (Wiley, New York, US, 2002). [26] K. R. Nayak, S. V. Dhurandhar, A. Pai, and J. Y. Vinet, Phys. Rev. D68, 122001 (2003), gr-qc/0306050. [27] E. Chassande-Mottin and A. Pai, IEEE Signal Proc. Lett. 12, 508 (2005). [28] O. Rabaste, E. Chassande-Mottin, and A. Pai, in Actes du 21` eme Colloque GRETSI (Troyes (France), 2007). [29] S. V. Dhurandhar and M. Tinto, MNRAS 234, 663 (1998). [30] M. Gel’fand, R. A. Minlos, and Z. Ye. Shapiro, Representations of the Rotation and Lorentz Groups and their Applications (Pergamon Press, New York, 1963).


赞助商链接

更多相关文章:
更多相关标签:

All rights reserved Powered by 甜梦文库 9512.net

copyright ©right 2010-2021。
甜梦文库内容来自网络,如有侵犯请联系客服。zhit325@126.com|网站地图