Beyond FINDCHIRP for gravitational-wave matched-filter searches with ratio-filter dechirping
超越FINDCHIRP:基于比率滤波去啁啾的引力波匹配滤波搜索
A primary bottleneck in modern fast Fourier transform (FFT)-based matched-filter searches for gravitational waves from compact binary coalescences is not raw processor throughput, but available memory bandwidth. Standard frequency-domain implementations, such as the FINDCHIRP algorithm, rely on streaming long template waveforms and data from main memory, which leads to significant processor stalling when template durations exceed cache capacities. In this work, we introduce ratio-filter dechirping as a solution, an algorithmic restructuring of the matched filter that transforms the operation from a memory-bound FFT into a cache-efficient, compute-bound finite impulse response (FIR) convolution. By utilizing a reference template to remove common orbital phase evolution, we produce slowly changing frequency-domain ratios that can be accurately implemented as short FIR filters. This method delivers a measured speedup of <inline-formula><mml:math><mml:mrow><mml:mn>8</mml:mn><mml:mo>×</mml:mo></mml:mrow></mml:math></inline-formula> for the core filtering loop used in offline searches and should enable <inline-formula><mml:math><mml:mo>></mml:mo><mml:mn>10</mml:mn><mml:mo>×</mml:mo></mml:math></inline-formula> for low-latency analysis. We find that this approach generalizes to a variety of searches that include physical features such as finite size effects, eccentricity, and precession. By dramatically reducing the computational cost of matched filtering, this approach enables the expansion of searches into dense or high-dimensional parameter spaces, such as those for eccentric or subsolar-mass signals, that are already limited by available computing budgets. Furthermore, this framework provides a natural path for hardware acceleration on graphics processing unit architectures.
展开 ▾首次通过比率滤波器去啁啾解决引力波匹配滤波中的内存带宽瓶颈,使长模板运算适应CPU缓存;方法可扩展至偏心、进动等复杂信号,显著降低计算成本。
传统匹配滤波搜索依赖FINDCHIRP算法Allen+ 2012,长模板带来的内存带宽瓶颈严重制约吞吐量。此前参数估计中已有异方差去啁啾Cornish 2010和相对分箱Zackay+ 2018加速计算,Murakami等人Murakami+ 2025也独立利用比率减少波形存储,但未突破硬件吞吐限制。本研究将比率滤波与去啁啾融合,通过稀疏参考模板库将匹配滤波重构为短FIR卷积,有效克服内存墙。该方法可自然推广至偏心、进动等致密参数空间,并适配GPU加速;面对爱因斯坦望远镜Punturo+ 2010和宇宙探索者Reitze+ 2019等第三代探测器带来的超长数据和海量模板,该框架将成为下一代实时搜索的核心引擎。
刊出 2026-04-22 · 收录 2026-10-12