quick review radix 4 FFT

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

Decimation in time(Radix 4) divides the input sequence into smaller subsequences and recursively computes their DFTs using a butterfly structure.

• True

• False

How many stages if N=64?

• 1

• 7

• 3

• 5

What value of N that not suitable to be used in Radix 4

• 8

• 16

• 4

• 64

Radix-4 FFT DIT algorithm is a powerful tool in digital signal processing, and is widely used in a variety of applications, such as

i)audio and image processing

ii)telecommunications

iii)scientific computing

iv)power transmission

• i and ii

• i, ii, and iii

• i only

• All above

To implement the radix-4 DIT FFT algorithm, the input sequence first must in ________order , and then decomposed into smaller subsequences.

• Ascending

• Decreasing

• Reverse

• Forward