Which of the following is true regarding the number of computations required to compute DFT at any one value of ‘k’? - Study24x7
Social learning Network
17 May 2019 03:13 PM study24x7 study24x7

Which of the following is true regarding the number of computations required to compute DFT at any one value of ‘k’?

A

4N-2 real multiplications and 4N real additions

B

4N real multiplications and 4N-4 real additions

C

4N-2 real multiplications and 4N+2 real additions

D

4N real multiplications and 4N-2 real additions

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles