View Course Path Digital Signal Processing Quiz | MCQs | Interview Questions Published March 20, 2020 | Updated April 23, 2020 1. The Chebyshev filters haveFlat passbandEquiripple passbandFlat stopbandTapering stopband 2. How many numbers of butterflies are required per output point in the FFT algorithm?N-1N+1N2N 3. Which of the following elements are used in the realization of a system?DelayAddersMultipliersAll of the above 4. When computations are truncated to fit in the limited precision constraints, they give rise to finite word length effects.TrueFalse 5. When computations are truncated to fit in the limited precision constraints, they give rise to finite word length effects.TrueFalse 6. When the parameters of a system are represented with finite precision, it gives rise to finite word length effects.TrueFalse 7. If X(k) is the N-point DFT of a sequence x(n), then what is the DFT of x*(n)?X*(N-k)X*(k)X(N-k)None of the above Loading...
1. The Chebyshev filters haveFlat passbandEquiripple passbandFlat stopbandTapering stopband 2. How many numbers of butterflies are required per output point in the FFT algorithm?N-1N+1N2N 3. Which of the following elements are used in the realization of a system?DelayAddersMultipliersAll of the above 4. When computations are truncated to fit in the limited precision constraints, they give rise to finite word length effects.TrueFalse 5. When computations are truncated to fit in the limited precision constraints, they give rise to finite word length effects.TrueFalse 6. When the parameters of a system are represented with finite precision, it gives rise to finite word length effects.TrueFalse 7. If X(k) is the N-point DFT of a sequence x(n), then what is the DFT of x*(n)?X*(N-k)X*(k)X(N-k)None of the above Loading...
