Skip to main content
Track Fast Fourier Transform
15 / 16
Library

2012issue C1061

A two-stage case study in market cycle analysis

A usable market fast Fourier transform depended on a separate preprocessing stage, then the transform, then a comparison with another explicit Fourier baseline. A historical coding case shows how that workflow was split and later adapted as a user-written study.

  • A usable market fast Fourier transform needed a dedicated preprocessing stage before the transform itself.
  • One collaborator coded the transform and the other coded the preparatory treatment that had to run first.
  • The finished routine was adapted as a user-written study so its cycle estimate could be compared with a Fourier study already bundled in the same software.
  • Editorial reading: spectral analysis is this two-stage workflow, not the transform alone.
Entries in this reading3 entries

The case in brief

A practitioner who had already coded a fast Fourier transform in Fortran for a college engineering project later recoded that study in BASIC for personal-computer use.

A usable market version still required a dedicated preprocessing stage in addition to the transform calculation. The two parts were not interchangeable.

Preparation had to run first

Implementation was split. One collaborator, who held a mathematics doctorate, coded the transform. The other coded the data preprocessing that had to run first.

That preparatory treatment of the ordered series was treated as a separate stage. The fast Fourier transform was applied only after it was complete.

A user-written study and a bundled comparison

The finished routine was adapted to run as a user-written study in early personal-computer technical analysis software that accepted BASIC programs.

The authors judged their fast Fourier transform routine more accurate than a Fourier study already bundled with that software. They were invited to present the work at a user seminar.

Material developed for the Fourier implementation was reused in the first issue of a technical analysis periodical timed for distribution at that seminar.

Reading the comparison

Editorial note: the archive records a judgment against an explicit bundled Fourier baseline, not a present-day test. The useful method lesson is the order of work. Prepare the ordered price, volume, or breadth series, estimate frequency content over a stated sampling interval and lookback, then compare that cycle reading with another stated Fourier baseline.

Educational research material, not investment advice. Historical source context does not establish present-day performance.
15 of 16 in the Fast Fourier Transform track
201522-22 pp.Next on Fast Fourier TransformWhitening pink noise to build a near-zero-lag cycle oscillatorA step-like price change has a Fourier-domain response that falls as the reciprocal of frequency, matching the spectrum of pink noise.
All readings on this track · 16 readings
  1. 1982Building FFT spectra to size cycle filters
  2. 1988Fourier cycle models break in major swings
  3. 1988Constructing moving average filters from price Fast Fourier Transforms
  4. 1989Staging Fast Fourier construction under memory limits
  5. 1993Constructing forecast inputs with moving averages, Fourier transforms and intermarket spreads
  6. 1994Preprocessing prices so Fourier peaks set moving-average lengths
  7. 1994Constructing a spreadsheet FFT power spectrum from daily prices
  8. 1994Building dominant-cycle spectra with FFT preprocessing
  9. 1994Constructing labeled cycle lengths from FFT spectra
  10. 1999Fast Fourier Transform reconstruction is not a walk-forward decision tool
  11. 1999Walk-forward endpoint Fourier construction as a same-day mechanical procedure
  12. 2002From the power spectrum to indicator windows
  13. 2003Endpoint Fast Fourier Transform evaluation with walk-forward mechanical rules
  14. 2004Constructing signal and noise from market waveforms
  15. 2012A two-stage case study in market cycle analysis
  16. 2015Whitening pink noise to build a near-zero-lag cycle oscillator
All 17 readings tagged Fast Fourier Transform
Also on Fast Fourier Transform5 readings