Skip to search formSkip to main contentSkip to account menu

Fast folding algorithm

Known as: FFA 
In signal processing, the fast folding algorithm (Staelin, 1969) is an efficient algorithm for the detection of approximately-periodic events within… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
AlgorithmFast Fourier transformList of algorithmsSETI@home

Broader (1)

Signal processing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Consolidated backpropagation neural network for malaysian construction costs indices data with outliers problem
Neurocomputing has been adjusted effectively in time series forecasting activities, yet the vicinity of exceptions that… 
Review
2017
Review
2017
The implementation of a Fast-Folding Algorithm in the PALFA survey
Abstract The PALFA survey, the most sensitive blind search for radio pulsars, has now discovered 180 pulsars in the Galactic… 
Highly Cited
2009
Highly Cited
2009
ERRATUM: “NEW LIMITS ON RADIO EMISSION FROM X-RAY DIM ISOLATED NEUTRON STARS” (2009, ApJ, 702, 692)
As a result of an error at the Publisher, the incorrect version of Figure 3 (panel (a)) was published. The corrected figure… 
2003
2003
Gamma-ray pulsar detection using reconfigurable computing hardware
This paper presents a method to detect gamma-ray pulsars using a fast folding algorithm (Staelin, 1969) mapped onto… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)