Question 6
Marks : +2 | -2
Pass Ratio : 100%
For a decimation-in-time FFT algorithm, which of the following is true?
Explanation: In decimation-in-frequency FFT algorithm, the input is taken in order and the output is obtained in the bit reversal order.
Question 7
Marks : +2 | -2
Pass Ratio : 100%
What is the real part of the N point DFT XR(k) of a complex valued sequence x(n)?
Explanation: For a complex valued sequence x(n) of N points, the DFT may be expressed as
Question 8
Marks : +2 | -2
Pass Ratio : 100%
Which of the following is true regarding the number of computations required to compute DFT at any one value of ‘k’?
Explanation: The formula for calculating N point DFT is given as
Question 10
Marks : +2 | -2
Pass Ratio : 100%
For a decimation-in-time FFT algorithm, which of the following is true?
Explanation: In decimation-in-time FFT algorithm, the input is taken in bit reversal order and the output is obtained in the order.