Jump to content

Fast folding algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Tawkerbot4 (talk | contribs) at 23:07, 9 July 2006 (BOT - rv 69.226.255.204 (talk) to last version by AntiVandalBot). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Fast Folding Algorithm (Staelin, 1969) in signal processing 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.

See also

References

  • David H. Staelin. Fast Folding Algorithm for Detection of Periodic Pulse Trains. Proceedings of the IEEE, 57 (1969).
  • R. V. E. Lovelace, J. M. Sutton and E. E. Salpeter. Digital Search Methods for Pulsars. Nature 222, 231-233 (1969).
Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Fast_folding_algorithm&oldid=62952714"