Implementation of barycentric resampling for continuous wave searches in gravitational wave data
P. Patel, X. Siemens, R. Dupuis, J. Betzwieser

TL;DR
This paper presents an efficient implementation of a barycentric resampling algorithm for continuous gravitational wave searches, addressing practical challenges and improving computational efficiency for data from LIGO detectors.
Contribution
The paper introduces a novel, more efficient implementation of barycentric resampling for continuous gravitational wave searches, overcoming key practical challenges.
Findings
Significantly reduces computational cost of searches.
Handles data gaps and interpolation losses effectively.
Improves upon previous methods' efficiency.
Abstract
We describe an efficient implementation of a coherent statistic for continuous gravitational wave searches from neutron stars. The algorithm works by transforming the data taken by a gravitational wave detector from a moving Earth bound frame to one that sits at the Solar System barycenter. Many practical difficulties arise in the implementation of this algorithm, some of which have not been discussed previously. These difficulties include constraints of small computer memory, discreteness of the data, losses due to interpolation and gaps in real data. This implementation is considerably more efficient than previous implementations of these kinds of searches on Laser Interferometer Gravitational Wave (LIGO) detector data.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
