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.

See also

• Pulsar

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

• The search for unknown pulsars