Question: Statement ( I ) : FFT is a much faster version of the DFT algorithm. Statement ( II ) : Time complexity of DFT is
Statement I: FFT is a much faster version of the DFT algorithm.
Statement II: Time complexity of DFT is and the time complexity od FFT is for point discrete signal.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
