A Quick Fourier Transform Algorithm.

reportActive / Technical Report | Accession Number: AD0874435 | Need Help?

Abstract:

A new highly efficient algorithm for calculation of Fourier coefficients on a digital computer is presented. For sample sizes up to 1024 points, this algorithm is competitive with the Fast Fourier Transform. For example, on a 5-microsec cycle time machine, a complete transform involving 1024 real data points is performed in 6.3 sec. Author

Author(s):
Kohne, John F.
Author Organization(s):
NAVAL ELECTRONICS LAB CENTER SAN DIEGO CA
Descriptive Note:
Research rept. for Feb-May 68,
Pagination:
0060

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
NELC-TR-1723
Project Number(s):
NELC-Z308, ZF14-212-001
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
(*INTEGRAL TRANSFORMS, COMPUTER PROGRAMMING), FOURIER ANALYSIS, ALGORITHMS, EFFICIENCY, DIGITAL COMPUTERS, COMPUTER PROGRAMS, SAMPLING, COST EFFECTIVENESS
Field(s)/Group(s):
Theoretical Mathematics, Computer Programming and Software, Computer Hardware
Keyword(s):
FAST FOURIER TRANSFORM, FOURIER TRANSFORMATION, *QUICK FOURIER TRANSFORM
Report Date:
1970 Jul 02