Elsevier Science Home
Computer Physics Communications Program Library
Full text online from Science Direct
Programs in Physics & Physical Chemistry
CPC Home

[Licence| Download | New Version Template] acuh_v1_0.gz(4 Kbytes)
Manuscript Title: FASTF: fast Fourier transform with arbitrary factors.
Authors: E. Garcia-Torano
Program title: FASTF
Catalogue identifier: ACUH_v1_0
Distribution format: gz
Journal reference: Comput. Phys. Commun. 30(1983)397
Programming language: Fortran.
Computer: UNIVAC 1100/81.
Operating system: EXEC 8.
RAM: 8K words
Word size: 36
Keywords: General purpose, Fourier, Fast fourier transform, Time series analysis.
Classification: 4.6.

Nature of problem:
FASTF performs a discrete Fourier transform (direct/inverse) of a complex vector of length N. N should be factorisable as N = r1.r2...rp (ri integers).

Solution method:
The fast Fourier transform algorithm as described before.

Restrictions:
The lowest ri should be less than 181 for storage limitations. This condition may be modified by increasing the size of the IPRIM array which contains a list of the 40 first prime numbers.

Running time:
The execution time depends on N. A set of 1024 points is transformed in 0.544 s.