Radix 4 FFT Algorithm DIT

Which algorithm for computing the Fast Fourier Transform (FFT) uses a factorization into powers of 4?

• Radix-2 FFT

• Radix-4 FFT

• Both of the above

• None of the above

How many points are involved in a butterfly operation in Radix-4 FFT?

• 2

• 3

• 4

• 5

Which FFT algorithm is generally faster for non power-of-2 sized inputs?

• Radix-2 FFT

• Radix-4 FFT

• Both of the above

• None of the above

Which factorization is used by Radix-2 FFT?

• powers of 2

• powers of 4

• powers of 8

• powers of 16

What is the main disadvantage of Radix-4 FFT over Radix-2 FFT?

• More complex algorithm

• Slower for non power of 2 sized inputs

• Requires more memory

• Slower for large inputs