Which of the following is true regarding the number of computations required to compute an N-point DFT? - Study24x7
Social learning Network

Warning: include(./views/auth.php): failed to open stream: Permission denied in /var/www/html/live/loginRightSlider.php on line 18

Warning: include(): Failed opening './views/auth.php' for inclusion (include_path='.:/usr/share/php') in /var/www/html/live/loginRightSlider.php on line 18
17 May 2019 03:12 PM study24x7 study24x7

 Which of the following is true regarding the number of computations required 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

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