Other Questions

 Child Development and Pedagogy  Environmental Studies  C  C++  C#  Java  Chemistry  Physics  Electrical Engineering  Banking Awareness  Networking  Structured Query Language (SQL)  Computer Fundamentals  Logical Reasoning  Verbal Reasoning  Non Verbal Reasoning  General English  General Knowledge  Arithmetic Aptitude

Practice Paper sets

 SSC CGL  IBPS Bank PO  IBPS Bank Clerk  more

DFT Efficient Computation on Digital Signal Processing related Questions and Answers


Question :   The total number of complex multiplications required to compute N point DFT by radix-2 FFT is:
1. (N/2)log2N
2. Nlog2N
3. (N/2)logN
4. None of the mentioned
Answer :   1 - (N/2)log2N  

* Be the First to Post a Comment.

Submit comment :

Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter