Assignment-3

1. Explain in detail Divide-and-Conquer Approach to Computation of the DFT.

2. Explain in detail Divide-and-Conquer Approach to Computation of the DFT through a

example.

3. Compute the eight-point D FT of the sequence

1, 0 ≤ 𝑛 ≤ 7
x(n) = {
0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
by using the decimation-in-frequency FFT algorithm described in the text.

4. Explain Efficient Computation of the DFT of Two Real Sequences and Efficient
Computation of the DFT of a 2N-Point Real Sequence.