Research method
Fast Fourier Transform
Fast Fourier Transform is a canonical archive-taxonomy method; this registry entry defines its inputs, output and use boundary.
- Output
- Conditional forecast or research filter
- Input
- Ordered price, volume or breadth observations
- Horizon
- A defined sampling interval and lookback
- Best use
- Compare an explicit quantitative baseline with an out-of-sample result.
- Input: Ordered price, volume or breadth observations.
- Output: forecast.
- Use boundary: Compare an explicit quantitative baseline with an out-of-sample result.
The graph3
How the method is built, and where it has been read
Depends on
Often reviewed together
Dominant cycle detection4 readings
Often reviewed together
Spectral analysis6 readings
Often reviewed together
Fourier analysis9 readings
Read in the archive17 readings
1982Building FFT spectra to size cycle filters1988Fourier cycle models break in major swings1988Constructing moving average filters from price Fast Fourier Transforms1989Staging Fast Fourier construction under memory limits1993Constructing forecast inputs with moving averages, Fourier transforms and intermarket spreads1994Building dominant-cycle spectra with FFT preprocessing1994Constructing a spreadsheet FFT power spectrum from daily prices1994Preprocessing prices so Fourier peaks set moving-average lengths1994Constructing labeled cycle lengths from FFT spectra1999Fast Fourier Transform reconstruction is not a walk-forward decision tool1999Walk-forward endpoint Fourier construction as a same-day mechanical procedure2002Timing market cycles with finite impulse response filters and FFT2002From the power spectrum to indicator windows2003Endpoint Fast Fourier Transform evaluation with walk-forward mechanical rules2004Constructing signal and noise from market waveforms2012A two-stage case study in market cycle analysis2015Whitening pink noise to build a near-zero-lag cycle oscillator
This registry entry describes a research method. It is not investment advice and does not make a performance claim.