Saved Bookmarks
| 1. |
What Is Meant By Radix-2 Fft? |
|
Answer» The FFT algorithm is most EFFICIENT in CALCULATING N point DFT. If the number of output points N can be EXPRESSED as a POWER of 2 that is N=2M, where M is an integer, then this algorithm is known as radix-2 algorithm. The FFT algorithm is most efficient in calculating N point DFT. If the number of output points N can be expressed as a power of 2 that is N=2M, where M is an integer, then this algorithm is known as radix-2 algorithm. |
|