Numerical Fourier Transform
Abstract:
Numerical techniques for the analysis of digitized time-amplitude traces are presented, with special emphasis on Fast Fourier transforms. Accuracy of computation is improved by the use of linearly interpolated functions for equispaced input the subprogram FLAT uses the Cooley-Tukey algorithm, while NUFT may be employed for the nonequispaced case. Although FLAT and NUFT can be used to perform inverse Fourier transforms, the special subprograms FLIT and INUFT compute these functions more efficiently. An analysis of the errors introduced by digitization, interpolation, and the computation of Fourier transforms is included.
Security Markings
DOCUMENT & CONTEXTUAL SUMMARY
Distribution:
Approved For Public Release, Document Partially Illegible
Distribution Statement:
Availability: Document Partially Illegible.
RECORD
Collection: TR