fast folding algorithm
(FFA)
(algorithm to find the periods of periodic data)
The fast folding algorithm is an efficient algorithm to
find periodicity in time series data through data folding.
Its method is somewhat like that of the fast Fourier transform. Among its
uses is identification of pulsars from radio observations
collected over time.
(mathematics,method)
Further reading:
https://en.wikipedia.org/wiki/Fast_folding_algorithm
https://ui.adsabs.harvard.edu/abs/1969IEEEP..57..724S/abstract
https://books.google.com/books?id=dVQ2AQAAIAAJ&q=fast+folding#v=snippet&q=fast%20folding&f=false
Referenced by page:
data folding
Index