A Heuristic Description of Fast Fourier Transform

Details A Heuristic Description of Fast Fourier Transform A Heuristic Description of Fast Fourier Transform

2011-10-27

arxiv.org/abs/1110.5989v1

Computer Science

Numerical Analysis

Scientific paper

Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of FFT and propose a new presentation. Our heuristic description is helpful for students and programmers to grasp the algorithm entirely and deeply.

Affiliated with

Also associated with

No associations

Rating

A Heuristic Description of Fast Fourier Transform does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Heuristic Description of Fast Fourier Transform, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Heuristic Description of Fast Fourier Transform will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-375451