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
Which of the following is true regarding the number of computations requires to compute an N-point DFT?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Which of the following is true regarding the number of computations requires to compute an N-point DFT?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!