- Recall that it is convenient and usual for the length of an input signal to a DFT process to be a power of 2, such as 26. If a signal input to the real DFT has 64 points, how many points are in the real part and imaginary part of the result of the DFT? Explain your answer.
- Can the FFT be faster than the real DFT despite the complex nature? Explain your answer.
- Write a FFT program guided by Table 12-4, using Java, C++, C# or Python.
- Write an inverse FFT program guided by Table 12-5, using Java, C++, C# or Python.
- Test your implementations by taking an interesting sequence, calculating its FFT, O1, and then calculating the IFFT of O1, and comparing the final output with the original input. Describe the relevant features of the results.
Sample Solution
