Question 1 : The total number of complex multiplications required to compute N point DFT by radix-2 FFT is:
1. (N/2)log₂N
2. Nlog₂N
3. (N/2)logN
4. None of the mentioned
View Answer   Discuss with Members

Question 2 : Which of the following is true in case of Overlap add method?
1. M zeros are appended at last of each data block
2. M zeros are appended at first of each data block
3. M-1 zeros are appended at last of each data block
4. M-1 zeros are appended at first of each data block
View Answer   Discuss with Members

Question 3 : What is the value of the variance of quantization error in FFT algorithm, compared to that of direct computation?
1. Greater
2. Less
3. Equal
4. Cannot be compared
View Answer   Discuss with Members

Question 4 : The total number of complex additions required to compute N point DFT by radix-2 FFT is:
1. (N/2)log₂N
2. Nlog₂N
3. (N/2)logN
4. None of the mentioned
View Answer   Discuss with Members

Question 5 : The first M-1 values of the output sequence in every step of Overlap save method of filtering of long sequence are discarded.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 6 : What is the value of x(n)*h(n), 0≤n≤11 for the sequences x(n)={1,2,0,-3,4,2,-1,1,-2,3,2,1,-3} and h(n)={1,1,1} if we perform using overlap add fast convolution technique?
1. {1,3,3,1,1,3,5,2,2,2,3,6}
2. {1,2,0,-3,4,2,-1,1,-2,3,2,1,-3}
3. {1,2,0,3,4,2,1,1,2,3,2,1,3}
4. {1,3,3,-1,1,3,5,2,-2,2,3,6}
View Answer   Discuss with Members

Question 7 : The computation of XR(k) for a complex valued x(n) of N points requires:
1. 2N² evaluations of trigonometric functions
2. 4N² real multiplications
3. 4N(N-1) real additions
4. All of the mentioned
View Answer   Discuss with Members

Question 8 : FFT algorithm is designed to perform complex operations.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 9 : What is the value of x(n)*h(n), 0≤n≤11 for the sequences x(n)={1,2,0,-3,4,2,-1,1,-2,3,2,1,-3} and h(n)={1,1,1} if we perform using overlap save fast convolution technique?
1. {1,3,3,-1,1,3,5,2,-2,2,3,6}
2. {1,2,0,-3,4,2,-1,1,-2,3,2,1,-3}
3. {1,2,0,3,4,2,1,1,2,3,2,1,3}
4. {1,3,3,1,1,3,5,2,2,2,3,6}
View Answer   Discuss with Members

Question 10 : What is the total number of quantization errors in the computation of single point DFT of a sequence of length N?
1. 2N
2. 4N
3. 8N
4. 12N
View Answer   Discuss with Members