Fast folding algorithm
In signal processing, the fast folding algorithm (Staelin, 1969) is an efficient algorithm for the detection of approximately-periodic events within time series data. It computes superpositions of the signal modulo various window sizes simultaneously.
The FFA is best known for its use in the detection of pulsars, as popularised by SETI@home and Astropulse. It was also used by the Breakthrough Listen Initiative during their 2023 Investigation for Periodic Spectral Signals campaign.[1]
See also
References
- Staelin, D. H. (1969). "Fast folding algorithm for detection of periodic pulse trains". Proc. IEEE. 57 (4): 724–725. doi:10.1109/PROC.1969.7051. ISSN 0018-9219. S2CID 109705201.
- Lovelace, R. V. E.; Sutton, J. M.; Salpeter, E. E. (1969). "Digital Search Methods for Pulsars". Nature. 222 (5190): 231–233. doi:10.1038/222231a0. ISSN 0028-0836. S2CID 4294389.
External links
 | This signal processing-related article is a stub. You can help Wikipedia by expanding it. |