Question 21 : The 4N quantization errors are mutually uncorrelated.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 22 : How many complex multiplications are required to compute X(k)?
1. N(N+1)
2. N(N-1)/2
3. N2/2
4. N(N+1)/2
View Answer   Discuss with Members

Question 23 : How is the variance of the quantization error related to the size of the DFT?
1. Equal
2. Inversely proportional
3. Square proportional
4. Proportional
View Answer   Discuss with Members

Question 24 : The 4N quantization errors are correlated with the sequence {x(n)}.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 25 : For a decimation-in-time FFT algorithm, which of the following is true?
1. Both input and output are in order
2. Both input and output are shuffled
3. Input is shuffled and output is in order
4. Input is in order and output is shuffled
View Answer   Discuss with Members

Question 26 : The effect of round off errors due to the multiplications performed in the DFT with fixed point arithmetic is known as Quantization error.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 27 : Which of the following is true regarding the number of computations required to compute an N-point DFT?
1. N² complex multiplications and N(N-1) complex additions
2. N² complex additions and N(N-1) complex multiplications
3. N² complex multiplications and N(N+1) complex additions
4. N² complex additions and N(N+1) complex multiplications
View Answer   Discuss with Members

Question 28 : If x1(n) and x2(n) are two real valued sequences of length N, and let x(n) be a complex valued sequence defined as x(n)=x1(n)+jx2(n), 0≤ n≤ N-1, then what is the value of x2(n)?
1. (x(n)-x*(n))/2
2. (x(n)+x*(n))/2
3. (x(n)+x*(n))/2j
4. (x(n)-x*(n))/2j
View Answer   Discuss with Members

Question 29 : For a decimation-in-time FFT algorithm, which of the following is true?
1. Both input and output are in order
2. Both input and output are shuffled
3. Input is shuffled and output is in order
4. Input is in order and output is shuffled
View Answer   Discuss with Members

Question 30 : Which of the following is true regarding the number of computations required to compute DFT at any one value of 'k'?
1. 4N-2 real multiplications and 4N real additions
2. 4N real multiplications and 4N-4 real additions
3. 4N-2 real multiplications and 4N+2 real additions
4. 4N real multiplications and 4N-2 real additions
View Answer   Discuss with Members