Discovering pulsars in compact binaries with a hidden Markov model
Abstract
Discovering radio pulsars in compact binaries, whose orbital periods satisfy , is computationally challenging, because the time-dependent pulse frequency is strongly Doppler modulated by the binary motion. Here we present a new, fast, semi-coherent detection scheme based on a hidden Markov model (HMM) combined with a maximum likelihood matched filter, the Schuster periodogram. The HMM scheme complements traditional acceleration searches by dividing into piecewise-constant blocks and tracking the block-to-block evolution efficiently using dynamic programming. Monte Carlo simulations show that the new method can detect compact binaries with flux densities and orbital periods under observing conditions (e.g.\ cadence) typical of radio pulsar surveys, with and without impulsive, narrowband radio frequency interference. The new method is fast; it employs the classic Viterbi algorithm to solve the HMM recursively. The central processing unit run time scales nominally as for subbands, coherent segments, and frequency bins.
Keywords
Cite
@article{arxiv.2601.00500,
title = {Discovering pulsars in compact binaries with a hidden Markov model},
author = {Joseph O'Leary and Liam Dunn and Andrew Melatos},
journal= {arXiv preprint arXiv:2601.00500},
year = {2026}
}
Comments
42 pages, 11 figures, accepted for publication in The Astrophysical Journal