FFTS-C: Fast Fourier Transform Subroutine for Complex Data
| 8-144
|
James E. Rothman, Digital Equipment Corporation, Maynard,
Massachusetts
FFTS-C enables computation of the Discrete Fourier Trans-
formation in a minimum amount of time. By using the Cooley-
Tukey algorithm, up to 1024 points may be transformed in
only 4.5 seconds, introducing a reduction of 99 percent in
computation time.
| Minimum Hardware: | PDP-8 or PDP-8/I
|
| Source Language: | PAL III
|
| Storage Requirement: | 3-7, 20-55, 400-5777
|
| Catalog:
| November 1969
|