Question: Suppose you have two programs for computing the DFT of a sequence x[n] that has N = 2 v nonzero samples. Program A computes the
Suppose you have two programs for computing the DFT of a sequence x[n] that has N = 2v nonzero samples. Program A computes the DFT by directly implementing the definition of the DFT sum from Eq. and takes N2 seconds to run. Program B implements the decimation-in-time FFT algorithm and takes 10N log2 N seconds to run. What is the shortest sequence N such that program B turns faster than program A?
![N-1 Analysis equation: X[k] = *[n]w". (8.67) %3D](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2022/11/636a507b9f394_803636a507b8f5f8.jpg)
N-1 Analysis equation: X[k] = *[n]w". (8.67) %3D
Step by Step Solution
3.47 Rating (157 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
30-E-T-E-D-S-P (407).docx
120 KBs Word File
