DFT Frequency Domain Sampling Questions

and Answers - Sanfoundry

by Manish

This set of Digital Signal Processing Multiple Choice Questions & Answers (MCQs) focuses on
“Frequency Domain Sampling DFT”.

1. If x(n) is a finite duration sequence of length L, then the discrete Fourier transform X(k) of
x(n) is given as:

View Answer

Answer: a

Explanation: If x(n) is a finite duration sequence of length L, then the Fourier transform of x(n)
is given as

If we sample X(ω) at equally spaced frequencies ω=2πk/N, k=0,1,2…N-1 where N>L, the
resultant samples are

2. If X(k) discrete Fourier transform of x(n), then the inverse discrete Fourier transform of X(k)
is:

View Answer
Answer: d

Explanation: If X(k) discrete Fourier transform of x(n), then the inverse discrete Fourier
transform of X(k) is given as

3. A finite duration sequence of length L is given as x(n) =1 for 0≤n≤L-1=0 otherwise , then
what is the N point DFT of this sequence for N=L?
a) X(k) =L for k=0, 1,2….L-1
b) X(k) =L for k=0
=0 for k=1,2….L-1
c) X(k) =L for k=0
=1 for k=1,2….L-1
d) None of the mentioned
View Answer

Answer: b

Explanation: The Fourier transform of this sequence is

If N=L, then X(k)= L for k=0

=0 for k=1,2….L-1

4. The Nth rot of unity WN is given as:

a) ej2πN
b) e -j2πN
c) e-j2π/N
d) ej2π/N
View Answer

Answer: c

Explanation: We know that the Discrete Fourier transform of a signal x(n) is given as

Thus we get Nth rot of unity WN= e

-j2π/N

5. Which of the following is true regarding the number of computations requires to compute an
N-point DFT?
a) N2 complex multiplications and N(N-1) complex additions
b) N2 complex additions and N(N-1) complex multiplications
c) N2 complex multiplications and N(N+1) complex additions
d) N2 complex additions and N(N+1) complex multiplications
View Answer

Answer: a

Explanation: The formula for calculating N point DFT is given as

From the formula given at every step of computing we are performing N complex multiplications
and N-1 complex additions. So, in a total to perform N-point DFT we perform N
2

complex multiplications and N(N-1) complex additions.

6. Which of the following is true?

d) None of the mentioned

View Answer

Answer: b

Explanation: If XN represents the N point DFT of the sequence xN in the matrix form, then we
know that
7. What is the DFT of the four point sequence x(n)={0,1,2,3}?
a) {6,-2+2j-2,-2-2j}
b) {6,-2-2j,2,-2+2j}
c) {6,-2+2j,-2,-2-2j}
d) {6,-2-2j,-2,-2+2j}
View Answer

Answer: c

Explanation: The first step is to determine the matrix W4. By exploiting the periodicity property
of W4 and the symmetry property

W
k+N/2
N

= -W
k
N

The matrix W

may be expressed as

8. If X(k) is the N point DFT of a sequence whose Fourier series coefficients is given by ck, then
which of the following is true?
a) X(k)=Nck
b) X(k)=ck/N
c) X(k)=N/ck
d) None of the mentioned
View Answer

Answer: a
Explanation: The Fourier series coefficients are given by the expression

9. What is the DFT of the four point sequence x(n)={0,1,2,3}?

a) {6,-2+2j-2,-2-2j}
b) {6,-2-2j,2,-2+2j}
c) {6,-2-2j,-2,-2+2j}
d) {6,-2+2j,-2,-2-2j}
View Answer

Answer: d

Answer: Given x(n)={0,1,2,3}

We know that the 4-point DFT of the above given sequence is given by the expression

In this case N=4

=>X(0)=6,X(1)=-2+2j,X(2)=-2,X(3)=-2-2j.

10. If W4100=Wx200, then what is the value of x?

a) 2
b) 4
c) 8
d) 16
View Answer

Answer: c
Explanation: We know that according to the periodicity and symmetry property,
100/4=200/x=>x=8.

DFT Properties Questions and Answers -

Sanfoundry
by Manish

This set of Digital Signal Processing Multiple Choice Questions & Answers (MCQs) focuses on
“Properties of DFT”.
1. If x(n) and X(k) are an N-point DFT pair, then x(n+N)=x(n).
a) True
b) False
View Answer

Answer: a

Explanation: We know that the expression for an DFT is given as

Therefore, we got x(n)=x(n+N)

2. If x(n) and X(k) are an N-point DFT pair, then X(k+N)=?

a) X(-k)
b) -X(k)
c) X(k)
d) None of the mentioned
View Answer

:c

Explanation: We know that

Therefore, we have X(k)=X(k+N)

3. If X1(k) and X2(k) are the N-point DFTs of x1(n) and x2(n) respectively, then what is the N-
point DFT of x(n)=ax1(n)+bx2(n)?
a) X1(ak)+X2(bk)
b) aX1(k)+bX2(k)
c) eakX1(k)+ebkX2(k)
d) None of the mentioned
View Answer

Answer: b

Explanation: We know that, the DFT of a signal x(n) is given by the expression
=>X(k)= aX1(k)+bX2(k).

4. If x(n) is a complex valued sequence given by x(n)=xR(n)+jxI(n), then what is the DFT of
xR(n)?

View Answer

Answer: d

Explanation: Given x(n)=xR(n)+jxI(n)=> xR(n)=1/2(x(n)+x*(n))

Substitute the above equation in the DFT expression

Thus we get,

5. If x(n) is a real sequence and X(k) is its N-point DFT, then which of the following is true?
a) X(N-k)=X(-k)
b) X(N-k)=X*(k)
c) X(-k)=X*(k)
d) All of the mentioned
View Answer

Answer: d

Explanation: We know that

Therefore,

X(N-k)=X*(k)=X(-k)
6. If x(n) is real and even, then what is the DFT of x(n)?

d) None of the mentioned

View Answer

Answer: b

Explanation: Given x(n) is real and even, that is x(n)=x(N-n)

We know that XI(k)=0. Hence the DFT reduces to

7. If x(n) is real and odd, then what is the IDFT of the given sequence?

d) None of the mentioned

View Answer

Answer: a

Explanation: If x(n) is real and odd, that is x(n)=-x(N-n), then XR(k)=0. Hence X(k) is purely
imaginary and odd. Since XR(k) reduces to zero, the IDFT reduces to

8. If x1(n),x2(n) and x3(m) are three sequences each of length N whose DFTs are given as
X1(k),X2(k) and X3(k) respectively and X3(k)=X1(k).X2(k), then what is the expression for
x3(m)?

View Answer

Answer: c
Explanation: If x1(n),x2(n) and x3(m) are three sequences each of length N whose DFTs are
given as X1(k),X2(k) and X3(k) respectively and X3(k)=X1(k).X2(k), then according to the
multiplication property of DFT we have x3(m) is the circular convolution of x1(n) and x2(n).
9. What is the circular convolution of the sequences x1(n)={2,1,2,1} and x2(n)={1,2,3,4}?
a) {14,14,16,16}
b) {16,16,14,14}
c) {2,3,6,4}
d) {14,16,14,16}
View Answer

Answer: d

Explanation: We know that the circular convolution of two sequences is given by the expression

For m=0,x2((-n))4={1,4,3,2}

For m=1,x2((1-n))4={2,1,4,3}

For m=2,x2((2-n))4={3,2,1,4}

For m=3,x2((3-n))4={4,3,2,1}

Now we get x(m)={14,16,14,16}.

10. What is the circular convolution of the sequences x1(n)={2,1,2,1} and x2(n)={1,2,3,4}, find
using the DFT and IDFT concepts?
a) {16,16,14,14}
b) {14,16,14,16}
c) {14,14,16,16}
d) None of the mentioned
View Answer

Answer: b
Explanation: Given x1(n)={2,1,2,1}=>X1(k)=[6,0,2,0] Given x2(n)={1,2,3,4}=>X2(k)=[10,-
2+j2,-2,-2-j2] when we multiply both DFTs we obtain the product
X(k)=X1(k).X2(k)=[60,0,-4,0] By applying the IDFT to the above sequence, we get
x(n)={14,16,14,16}.

11. If X(k) is the N-point DFT of a sequence x(n), then circular time shift property is that N-
point DFT of x((n-l))N is X(k)e-j2πkl/N.
a) True
b) False
View Answer
Answer: a
Explanation: According to the circular time shift property of a sequence, If X(k) is the N-point
DFT of a sequence x(n), then the N-pint DFT of x((n-l))N is X(k)e-j2πkl/N.

12. If X(k) is the N-point DFT of a sequence x(n), then what is the DFT of x*(n)?
a) X(N-k)
b) X*(k)
c) X*(N-k)
d) None of the mentioned
View Answer

Answer: According to the complex conjugate property of DFT, we have if X(k) is the N-point
DFT of a sequence x(n), then what is the DFT of x*(n) is X*(N-k).

DFT Frequency Signal Analysis Questions

and Answers - Sanfoundry
by Manish

This set of Digital Signal Processing Multiple Choice Questions & Answers (MCQs) focuses on
“Frequency Analysis of Signals Using DFT”.

1. If the signal to be analyzed is an analog signal, we would pass it through an anti-aliasing filter
with B as the bandwidth of the filtered signal and then the signal is sampled at a rate:
a) Fs ≤ 2B
b) Fs ≤ B
c) Fs ≥ 2B
d) Fs = 2B
View Answer

Answer: c
Explanation: The filtered signal is sampled at a rate of Fs≥ 2B, where B is the bandwidth of the
filtered signal to prevent aliasing.

2. What is the highest frequency that is contained in the sampled signal?

a) 2Fs
b) Fs/2
c) Fs
d) None of the mentioned
View Answer

Answer: b
Explanation: We know that, after passing the signal through anti-aliasing filter, the filtered signal
is sampled at a rate of Fs≥ 2B=>B≤ Fs/2.Thus the maximum frequency of the sampled signal is
Fs/2.

3. The finite observation interval for the signal places a limit on the frequency resolution.
a) True
b) False
View Answer

Answer: a
Explanation: After sampling the signal, we limit the duration of the signal to the time interval
T0=LT, where L is the number of samples and T is the sample interval. So, it limits our ability to
distinguish two frequency components that are separated by less than 1/T0=1/LT in frequency.
So, the finite observation interval for the signal places a limit on the frequency resolution.

4. If {x(n)} is the signal to be analyzed, limiting the duration of the sequence to L samples, in the
interval 0≤ n≤ L-1, is equivalent to multiplying {x(n)} by:
a) Kaiser window
b) Hamming window
c) Hanning window
d) Rectangular window
View Answer

Answer: d
Explanation: The equation of the rectangular window w(n) is given as
w(n)= 1, 0≤ n≤ L-1
=0, otherwise
Thus, we can limit the duration of the signal x(n) to L samples by multiplying it with a
rectangular window of length L.

5. What is the Fourier transform of rectangular window of length L?

d) None of the mentioned

View Answer

Answer: c

Explanation: We know that the equation for the rectangular window w(n) is given as

w(n)= 1, 0≤ n≤ L-1
=0, otherwise

We know that the Fourier transform of a signal x(n) is given as

6. If x(n)=cosω0n and W(ω) is the Fourier transform of the rectangular signal w(n), then what is
the Fourier transform of the signal x(n).w(n)?
a) 1/2[W(ω-ω0)- W(ω+ω0)].
b) 1/2[W(ω-ω0)+ W(ω+ω0)].
c) [W(ω-ω0)+ W(ω+ω0)].
d) [W(ω-ω0)- W(ω+ω0)].
View Answer

Answer: b
Explanation: According to the exponential properties of Fourier transform, we get
Fourier transform of x(n).w(n)= 1/2[W(ω-ω0)+ W(ω+ω0)]

7. The characteristic of windowing the signal called “Leakage” is the power that is leaked out
into the entire frequency range.
a) True
b) False
View Answer

Answer: a
Explanation: We note that the windowed spectrum X ̂(ω) is not localized to a single frequency,
but instead it is spread out over the whole frequency range. Thus the power of the original signal
sequence x(n) that was concentrated at a single frequency has been spread by the window into
the entire frequency range. We say that the power has been leaked out into the entire frequency
range and this phenomenon is called as “Leakage”.

8. Which of the following is the advantage of Hanning window over rectangular window?
a) More side lobes
b) Less side lobes
c) More width of main lobe
d) None of the mentioned
View Answer

Answer: b
Explanation: The Hanning window has less side lobes and the leakage is less in this windowing
technique.
9. Which of the following is the disadvantage of Hanning window over rectangular window?
a) More side lobes
b) Less side lobes
c) More width of main lobe
d) None of the mentioned
View Answer

Answer: c
Explanation: In the magnitude response of the signal windowed using Hanning window, the
width of the main lobe is more which is the disadvantage of this technique over rectangular
windowing technique.

10. The condition with less number of samples L should be avoided.

a) True
b) False
View Answer

Answer: a
Explanation: When the number of samples L is small, the window spectrum masks the signal
spectrum and, consequently , the DFT of the data reflects the spectral characteristics of the
window function. So, this situation should be avoided.