Pulsar Searches with the SKA

L. Levin, Wesley Armour, C. Baffa, E D Barr, S. J. Cooper, Ralph P. Eatough, Andrew Ensor, E. Giani, A. Karastergiou, R. Karuppusamy, M. J. Keith, M. Krämer, R. J. P. Lyon, M. Mackintosh, M. B. Mickaliger, Rob V. van Nieuwpoort, M. J. Pearson, T. Prabu, Jayanta Roy, Oliver Sinnen, L. G. Spitler, Hanno Spreeuw, B. W. Stappers, W. van Straten, Christopher Williams, H. Wang, K. Wiesner, the Ska Tdt teamProceedings of the International Astronomical Union 2017 · DOI

TL;DR

The Square Kilometre Array (SKA) promises to revolutionize pulsar astronomy by discovering thousands of new pulsars. This paper outlines the design of the SKA's real-time pulsar search engine, detailing the computational challenges and proposed solutions for processing massive data rates to achieve this goal.

What Problem Does This Paper Address?

The SKA, a next-generation radio telescope, will generate an unprecedented volume of data – up to 60 PB per day during pulsar surveys. Detecting pulsars, especially faint or unusual ones like those in binary systems, requires sophisticated signal processing pipelines that can handle this data deluge in real-time. The challenge lies in designing a computational system capable of performing complex algorithms, such as dispersion measure and acceleration searches, at speeds exceeding 10 Peta-operations per second (POps) while adhering to strict power constraints. This paper addresses the need for a robust and efficient pulsar search engine for the SKA that can meet these demands.

Methods

The paper details the proposed design for the SKA's pulsar search engine, which will be integrated into the telescope's Central Signal Processor (CSP). The core of the design involves a dedicated compute cluster utilizing a hybrid approach of GPUs and FPGAs. GPUs are leveraged for their parallel processing capabilities, ideal for tasks like dedispersion and single-pulse detection. FPGAs, on the other hand, are chosen for their power efficiency and suitability for specific tasks such as Fourier domain acceleration processing.

The pulsar search pipeline itself involves several key stages:

  • Dispersion Measure (DM) Search: Accounting for delays caused by free electrons in the interstellar medium across a wide range of DM trials.
  • Fast Fourier Transform (FFT): Analyzing the DM-corrected time series to detect periodic signals.
  • Acceleration Search: Crucial for finding pulsars in relativistic binary systems, this search accounts for changes in pulse period due to orbital motion. Both Fourier and time-domain acceleration search techniques are being explored.
  • Candidate Sifting and Classification: Identifying genuine pulsar candidates from the vast number of potential signals, filtering out interference, and ranking candidates using machine learning techniques.
  • Folding: For promising candidates, the data is folded at the derived pulse period, DM, and acceleration to confirm the signal.

The paper also highlights the use of a prototype system called ProtoNIP, a 3% replica of the full CSP pulsar machine, located at the MeerKAT site. This prototype allows for testing algorithms and hardware in a realistic environment, crucial for validating the design and predicting performance. A test vector machine is also used to run tests on individual modules and the combined pipeline using simulated pulsar data.

Datasets

The paper discusses the use of simulated pulsar data for testing and validation. Specifically, test vectors are created for a wide range of simulated pulsars with different properties. These simulations are used to test individual modules of the search pipeline and the combined search pipeline, as well as to develop heuristic features and classification models for candidate selection. The paper does not mention any specific publicly available datasets used for training or evaluation beyond these simulations.

Key Insights and Ideas

  • Hybrid GPU/FPGA Architecture: The innovative use of a combined GPU and FPGA architecture for the pulsar search engine is a key insight. This approach aims to balance computational power with energy efficiency, a critical factor for a facility as large as the SKA.
  • Real-time Processing Necessity: The sheer volume of data (60 PB/day) necessitates a real-time processing solution, pushing the boundaries of current astronomical data processing capabilities.
  • Machine Learning for Candidate Classification: The integration of machine learning techniques for sifting and ranking pulsar candidates is a significant step towards automating and improving the efficiency of pulsar discovery.
  • ProtoNIP as a Crucial Testbed: The development and deployment of ProtoNIP demonstrate a pragmatic approach to de-risking the complex SKA hardware and software development by testing in a relevant environment.

Key Results

Simulations based on SKA1 parameters suggest that the telescope will discover approximately 9000 ordinary pulsars and 1200 millisecond pulsars (MSPs) from a combined all-sky survey. This represents a significant increase, potentially quadrupling the currently known pulsar population. The proposed pulsar search engine is designed to perform over 10 POps, with specific computational requirements for different stages of the pipeline, such as ~2 TOps for DM trials, ~1 TOp for FFTs, and ~10 POps for Fourier domain acceleration search. The ProtoNIP prototype is being used to test these algorithms and validate system performance, aiming to ensure the success of pulsar searching with the SKA.

Limitations and Future Work

The paper acknowledges the intricate nature of building a real-time processing system for the SKA, particularly concerning the computational demands and power budget. Future work will involve further development and refinement of the pulsar search pipeline, including testing time-domain acceleration search techniques alongside the Fourier-domain approach. The ongoing work with ProtoNIP and the test vector machine is crucial for ensuring the highest possible return of newly discovered pulsars and for the successful development of the full processing clusters. The paper also implicitly points to the need for continued advancements in hardware and algorithms to meet the ever-increasing data rates and scientific demands of future radio astronomy facilities.

Summary updated

Abstract

Abstract The Square Kilometre Array will be an amazing instrument for pulsar astronomy. While the full SKA will be sensitive enough to detect all pulsars in the Galaxy visible from Earth, already with SKA1, pulsar searches will discover enough pulsars to increase the currently known population by a factor of four, no doubt including a range of amazing unknown sources. Real time processing is needed to deal with the 60 PB of pulsar search data collected per day, using a signal processing pipeline required to perform more than 10 POps. Here we present the suggested design of the pulsar search engine for the SKA and discuss challenges and solutions to the pulsar search venture.
BibTeX
@inproceedings{levin2017pulsar,
  author = {L. Levin and Wesley Armour and C. Baffa and E D Barr and S. J. Cooper and Ralph P. Eatough and Andrew Ensor and E. Giani and A. Karastergiou and R. Karuppusamy and M. J. Keith and M. Krämer and R. J. P. Lyon and M. Mackintosh and M. B. Mickaliger and Rob V. van Nieuwpoort and M. J. PEARSON and T. Prabu and Jayanta Roy and Oliver Sinnen and L. G. Spitler and Hanno Spreeuw and B. W. Stappers and W. van Straten and Christopher Williams and H. Wang and K. Wiesner and the SKA TDT team},
  title = {{Pulsar Searches with the SKA}},
  booktitle = {Proceedings of the International Astronomical Union},
  year = {2017},
  doi = {10.1017/s1743921317009528},
}
Figure