Jump to content

Fast folding algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 69.226.255.204 (talk) at 23:05, 9 July 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

Retrieved from "https://en.wikipedia.org/w/index.php?title=Fast_folding_algorithm&oldid=62952521"