2009

Discrete Fourier Transform Analysis in a Complex Vector Space

Alternative computational strategies for the Discrete Fourier Transform (DFT) have been developed using analysis of geometric manifolds. This approach provides a general framework for performing DFT calculations, and suggests a more efficient implementation of the DFT for applications using iterative transform methods, particularly phase retrieval. The DFT can thus be implemented using fewer operations when compared to the usual DFT counterpart. The software decreases the run time of the DFT in certain applications such as phase retrieval that iteratively call the DFT function. The algorithm exploits a special computational approach based on analysis of the DFT as a transformation in a complex vector space. As such, this approach has the potential to realize a DFT computation that approaches N operations versus Nlog(N) operations for the equivalent Fast Fourier Transform (FFT) calculation.

This work was done by Bruce H. Dean of Goddard Space Flight Center. For further information, contact the Goddard Innovative Partnerships Office at (301) 286-5810.

This invention is owned by NASA, and a patent application has been filed. Inquiries concerning nonexclusive or exclusive license for its commercial development should be addressed to the Patent Counsel, Goddard Space Flight Center, (301) 286-7351. Refer to GSC-15684-1.

White Papers

Future Advances in Body Electronics
Sponsored by Freescale
Comparison of Interface Pressure Measurement Options
Sponsored by Tekscan
When Does A Solar Energy System Make Sense for Remote Site Power?
Sponsored by SunWize
Bridging the Armament Test Gap
Sponsored by Marvin Test Solutions
White Paper: Computer System Design for Critical Applications
Sponsored by Sealevel
FPGA Computing for Speed and Flexibility
Sponsored by Acromag

White Papers Sponsored By: