The effect of round off errors due to the multiplications performed in the DFT with fixed point arithmetic is known as Quantization error.
Explanation: Since DFT plays a very important role in many applications of DSP, it is very important for us to know the effect of quantization errors in its computation. In particular, we shall consider the effect of round off errors due to the multiplications performed in the DFT with fixed point arithmetic.
What is the model that has been adopt for characterizing round of errors in multiplication?
Explanation: Additive white noise model is the model that we use in the statistical analysis of round off errors in IIR and FIR filters.
How many quantization errors are present in one complex valued multiplication?
Explanation: We assume that the real and imaginary components of {x(n)} and {WNkn} are represented by ‘b’ bits. Consequently, the computation of product x(n). WNkn requires four real multiplications. Each real multiplication is rounded from 2b bits to b bits and hence there are four quantization errors for each complex valued multiplication.
What is the total number of quantization errors in the computation of single point DFT of a sequence of length N?
Explanation: Since the computation of single point DFT of a sequence of length N involves N number of complex multiplications, it contains 4N number of quantization errors.
What is the range in which the quantization errors due to rounding off are uniformly distributed as random variables if Δ=2^{b}?
Explanation: The Quantization errors due to rounding off are uniformly distributed random variables in the range (Δ/2,Δ/2) if Δ=2^{b}. This is one of the assumption that is made about the statistical properties of the quantization error.
The 4N quantization errors are mutually uncorrelated.
Explanation: The 4N quantization errors are mutually uncorrelated. This is one of the assumption that is made about the statistical properties of the quantization error.
. The 4N quantization errors are correlated with the sequence {x(n)}.
Explanation: According to one of the assumption that is made about the statistical properties of the quantization error, the 4N quantization errors are uncorrelated with the sequence {x(n)}.
How is the variance of the quantization error related to the size of the DFT?
Explanation: We know that each of the quantization has a variance of Δ^{2}/12=2^{2b}/12.
The variance of the quantization errors from the 4N multiplications is 4N. 2^{2b}/12=2^{2b}(N/3).
Thus the variance of the quantization error is directly proportional to the size of the DFT.
. Every fourfold increase in the size N of the DFT requires an additional bit in computational precision to offset the additional quantization errors.
Explanation: We know that, the variance of the quantization errors is directly proportional to the size N of the DFT. So, every fourfold increase in the size N of the DFT requires an additional bit in computational precision to offset the additional quantization errors.
What is the variance of the output DFT coefficients X(k)?
Explanation: We know that the variance of the signal sequence is (2/N)^{2}/12=1/(3N^{2})
Now the variance of the output DFT coefficients X(k)=N. 1/(3N^2 ^{2}) = 1/3N.
What is the signaltonoise ratio?
Explanation: The signaltonoise ratio of a signal, SNR is given by the ratio of the variance of the output DFT coefficients to the variance of the quantization errors.
How many number of bits are required to compute the DFT of a 1024 point sequence with a SNR of 30db?
Explanation: The size of the sequence is N=210. Hence the SNR is
10log_{10}(σX2^{2}/ σq^{2})=10 log_{10}2^{2b20}
For an SNR of 30db, we have
3(2b20)=30=>b=15 bits.
Note that 15 bits is the precision for both addition and multiplication.
How many number of butterflies are required per output point in FFT algorithm?
Explanation: We find that, in general, there are N/2 in the first stage of FFT, N/4 in the second stage, N?8 in the third state, and so on, until the last stage where there is only one. Consequently, the number of butterflies per output point is N1.
What is the value of the variance of quantization error in FFT algorithm, compared to that of direct computation?
Explanation: If we assume that the quantization errors in each butterfly are uncorrelated with the errors in the other butterflies, then there are 4(N1) errors that affect the output of each point of the FFT. Consequently, the variance of the quantization error due to FFT algorithm is given by
4(N1)( Δ^{2}/12)=N(Δ^{2}/3)(approximately)
Thus, the variance of quantization error due to FFT algorithm is equal to the variance of the quantization error due to direct computation.
How many number of bits are required to compute the FFT of a 1024 point sequence with a SNR of 30db?
Explanation: The size of the FFT is N=2^{10}. Hence the SNR is 10 log_{10}2^{2bv1}=30
=>3(2b11)=30
=>b=21/2=11 bits.
Use Code STAYHOME200 and get INR 200 additional OFF

Use Coupon Code 








