Papers
Topics
Authors
Recent
Search
2000 character limit reached

Improving Pulsar Timing Precision with Single Pulse Fluence Clustering

Published 29 Jul 2024 in astro-ph.HE and astro-ph.IM | (2407.19615v1)

Abstract: Traditional pulsar timing techniques involve averaging large numbers of single pulses to obtain a high signal-to-noise (S/N) profile, which is matched to a template to measure a time of arrival (TOA). However, the morphology of individual single pulses varies greatly due to pulse jitter. Pulses of different fluence contribute differently to the S/N of the pulse average. Our study proposes a method that accounts for these variations by identifying a range of states and timing each separately. We selected two 1-hour observations of PSR J2145-0750, each in a different frequency band with the Green Bank Telescope. We normalized the pulse amplitudes to account for scintillation effects and probed different excision algorithms to reduce radio-frequency interference. We then measured four pulse parameters (amplitude, position, width, and energy) to classify the single pulses using automated clustering algorithms. For each cluster, we calculated an average pulse profile and template and used both to obtain a TOA and TOA error. Finally, we computed the weighted average TOA and TOA error, the latter as a metric of the total timing precision for the epoch. The TOA is shifted relative to the one obtained without clustering, and we can estimate the shift with this weighting using the same data. For the 820 MHz and 1400 MHz bands, we obtained TOA uncertainties of 0.057 microseconds and 0.46 microseconds, compared to 0.066 microseconds and 0.74 microseconds when no clustering is applied. We conclude that tailoring this method could help improve the timing precision for certain bright pulsars in NANOGrav's dataset.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.