DFT Efficient Computation on Digital Signal Processing related Questions and Answers


Question :   How many number of butterflies are required per output point in FFT algorithm?
1. N
2. N+1
3. 2N
4. N-1
Answer :   4 - N-1  

* 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