Fast Folding Algorithm

Fast Folding Algorithm

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.

ee also

* Pulsar

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

* [http://www.mpifr-bonn.mpg.de/staff/peter/ffades.en.html The search for unknown pulsars]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • FFA — For former on Wikipedia, see . FFA is a three letter acronym that may stand for:Games and sports*Fantasy Fanatics Alliance, a internet fantasy sports organization * Football Federation of Armenia, the governing body of football in Armenia. *… …   Wikipedia

  • Nucleic acid structure prediction — This article is about the computational prediction of nucleic acid structure. For experimental methods, see Nucleic acid structure determination. Nucleic acid structure prediction is a computational method to determine nucleic acid secondary and… …   Wikipedia

  • Molecular dynamics — (MD) is a computer simulation of physical movements of atoms and molecules. The atoms and molecules are allowed to interact for a period of time, giving a view of the motion of the atoms. In the most common version, the trajectories of molecules… …   Wikipedia

  • Parallel computing — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing …   Wikipedia

  • Gaussian network model — The Gaussian network model (GNM), one of many things named after Carl Gauss, is a representation of a biological macromolecule as an elastic mass and spring network to study, understand, and characterize mechanical aspects of its long scale… …   Wikipedia

  • RNA structure — The functional form of single stranded RNA molecules frequently requires a specific tertiary structure. The scaffold for this structure is provided by secondary structural elements which are hydrogen bonds within the molecule. This leads to… …   Wikipedia

  • Rosetta@home — infobox software name = Rosetta@home caption = Rosetta@home screensaver for CASP 8 target [http://predictioncenter.gc.ucdavis.edu/casp8/target.cgi?id=119 view=all T0482] developer = Baker laboratory, University of Washington; Rosetta Commons… …   Wikipedia

  • P versus NP problem — Unsolved problems in computer science Is P = NP ? …   Wikipedia

  • P = NP problem — The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field – the Clay Mathematics Institute has offered a $1 million US prize… …   Wikipedia

  • Compiler optimization — is the process of tuning the output of a compiler to minimize or maximize some attributes of an executable computer program. The most common requirement is to minimize the time taken to execute a program; a less common one is to minimize the… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”