Which of the following is true regarding the number of computations requires to compute an N-point DFT?
A. N2 complex multiplications and N(N-1) complex additions
B. N2 complex additions and N(N-1) complex multiplications
C. N2 complex multiplications and N(N+1) complex additions
D. N2 complex additions and N(N+1) complex multiplications
Answer:A
Which of the following is true regarding the number of computations requires to compute an N-point DFT?
A. N2 complex multiplications and N(N-1) complex additions B. N2 complex additions and N(N-1) complex multiplications C. N2 complex multiplications and N(N+1) complex additions D. N2 complex additions and N(N+1) complex multiplications
Explanation: The formula for calculating N point DFT is given as