The Fast Fourier Transform Algorithm
Quiz Summary
0 of 3 questions completed
Questions:
 1
 2
 3
Information
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading…
You must sign in or sign up to start the quiz.
You must first complete the following:
Results
Results
0 of 3 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 point(s), (0)
Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)
Categories
 Not categorized 0%
 1
 2
 3
 Answered
 Review

Question 1 of 3
1. Question
The term “fast Fourier transform” refers to
CorrectIncorrect 
Question 2 of 3
2. Question
The number of numerical operations (additions and multiplies) required by the FFT algorithm to compute all DFT coefficients for a length signal is proportional to
CorrectIncorrect 
Question 3 of 3
3. Question
Which of the following properties or techniques are used to obtain the decimationintime FFT algorithm? Select all that apply. Let .
CorrectIncorrect