Pulsar search is one of the main tasks for the Square Kilometre Array (SKA) central signal processor (CSP) sub-element. Because most of the pulsar details are unknown, many pulsar search approaches are employed. The main compute-intensive application of the pulsar search modules is the matched filter group, which convolves the input signals with a group of filters. High-performance designs on FPGAs have been proposed that can process multiple large filters efficiently. But given that in many applications, including the here targeted pulsar search, filters have different sizes, there is a high potential for optimisation. This paper investigates the optimisation of general matched filtering design for the SKA pulsar search engine. The influence of changing the number of filters and the difference in sizes is analysed. The general implementations in time-domain (TD) and frequency-domain (FD) are optimised, employing the longest processing time (LPT) first rule to distribute filter templates across filter processing pipelines. The proposed design is employed to implement the matched filter groups in two SKA pulsar modules. The results show that the optimisation can provide up to 2.1x speedup in TD and 1.2x speedup in FD.
[1]
Andrew Siemion,et al.
Digital Instrumentation for the Radio Astronomy Community
,
2009
.
[2]
David Svoboda,et al.
Algorithms for Efficient Computation of Convolution
,
2013
.
[3]
S. Eikenberry,et al.
Fourier Techniques for Very Long Astrophysical Time-Series Analysis
,
2002,
astro-ph/0204349.
[4]
Ronald L. Graham,et al.
Bounds on Multiprocessing Timing Anomalies
,
1969,
SIAM Journal of Applied Mathematics.
[5]
Greg Brown,et al.
A performance and energy comparison of convolution on GPUs, FPGAs, and multicore processors
,
2013,
TACO.
[6]
Ming Zhang,et al.
FPGA-based acceleration of FDAS module using OpenCL
,
2016,
2016 International Conference on Field-Programmable Technology (FPT).