Fast Folding Algorithm
From Wikipedia, the free encyclopedia
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.
[edit] See also
[edit] 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).
