|
Question
32
:
If we split the N point data sequence into two N/2 point data sequences f 1(n) and f 2(n) corresponding to the even numbered and odd numbered samples of x(n), then such an FFT algorithm is known as decimation-in-time algorithm.
1. True 2. False 3. 4.
View Answer
Discuss with Members
|
|
|
Question
35
:
Every fourfold increase in the size N of the DFT requires an additional bit in computational precision to offset the additional quantization errors.
1. True 2. False 3. 4.
View Answer
Discuss with Members
|
Question
36
:
What is the sequence y(n) that results from the use of four point DFTs if the impulse response is h(n)={1,2,3} and the input sequence x(n)={1,2,2,1}?
1. {9,9,7,11} 2. {1,4,9,11,8,3} 3. {7,9,7,11} 4. {9,7,9,11}
View Answer
Discuss with Members
|
|
|
|