Q:
Which of the following is true regarding the number of computations requires to compute an N-point DFT?
Answer & Explanation
Answer: A) N² complex multiplications and N(N-1) complex additions
Explanation: Not available for this question
View Answer
Discuss