Fast Fourier Transform (FFT)
| 8-250
|
Kenneth G. Pavel, Trinity College, Hartford, Connecticut
This program uses the Cooley-Tukey algorithm to perform a
Discrete Fourier Transform on up to 1024 data points. Input
is through a selected A-D channel. The sampling rate is
either 0.01 seconds or on every clock pulse, depending on the
switch register. The input waveform is displayed in a scaled
manner, and then transformed. The final spectrum is viewed
through a variable window which is under the control of A-D
channels 34-36, and the switch register.
| Minimum Hardware: | LAB-8 or PDP-8 with AX08 and
scope display
|
| Storage Requirement: | Approximately 3K of core
|
| Source Language: | PAL-D
|
| Catalog:
| July 1973
|