Scribd
Upload
58 views1 page

cq23 PDF

The FFT is much faster than direct computation of the DFT because direct computation requires N^2 computations while the FFT only requires (N/2)log2N computations.

Uploaded by

ali99956
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
58 views1 page

cq23 PDF

The FFT is much faster than direct computation of the DFT because direct computation requires N^2 computations while the FFT only requires (N/2)log2N computations.

Uploaded by

ali99956
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Concept Question 7-23: Why is the FFT so much faster than direct computation of the DFT?

Because direct computation of the N-point DFT of a signal of duration N requires about N2
computations, while the same computation using the FFT requires only about (N/2) log2 N
computations.

You might also like