Fast folding algorithm

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by BattyBot (talk | contribs) at 21:36, 22 December 2013 (General fixes, removed orphan tag using AWB (9803)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

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).

External links


Stub icon

This algorithms or data structures-related 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=587284417"