NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
A Discussion of the Discrete Fourier Transform Execution on a Typical Desktop PCThis paper will discuss and compare the execution times of three examples of the Discrete Fourier Transform (DFT). The first two examples will demonstrate the direct implementation of the algorithm. In the first example, the Fourier coefficients are generated at the execution of the DFT. In the second example, the coefficients are generated prior to execution and the DFT coefficients are indexed at execution. The last example will demonstrate the Cooley- Tukey algorithm, better known as the Fast Fourier Transform. All examples were written in C executed on a PC using a Pentium 4 running at 1.7 Ghz. As a function of N, the total complex data size, the direct implementation DFT executes, as expected at order of N2 and the FFT executes at order of N log2 N. At N=16K, there is an increase in processing time beyond what is expected. This is not caused by implementation but is a consequence of the effect that machine architecture and memory hierarchy has on implementation. This paper will include a brief overview of digital signal processing, along with a discussion of contemporary work with discrete Fourier processing.
Document ID
20070016611
Acquisition Source
Goddard Space Flight Center
Document Type
Conference Paper
Authors
White, Michael J.
(NASA Goddard Space Flight Center Greenbelt, MD, United States)
Date Acquired
August 23, 2013
Publication Date
July 29, 2006
Subject Category
Electronics And Electrical Engineering
Meeting Information
Meeting: National Technical Association 2006 Annual Conference
Location: Chicago, IL
Country: United States
Start Date: July 26, 2006
End Date: July 29, 2006
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.

Available Downloads

There are no available downloads for this record.
No Preview Available