Imperial College London EE3-07 - Digital Signal Processing
(c) If only 512 data samples were taken but the block was zero padded to restore the size to 1024,
what would be the new answers to (a) and (b)?
This operation is equivalent to truncating the time domain signal by a rectangular window
which has the same as effect as performing a sinc interpolation in the frequency domain.
Thus the ∆F is the same (7.8 Hz), however, this frequency resolution is an illusion.
Whereas the time duration, ∆T , is halved (i.e. 64 ms)
4. A sequence y[n] is constructed from a finite duration sequence x[n] of length 8 samples in the
following manner:
y[n] =
(
x[n/2], for n even
0, for n odd
Determine Y[k] in terms of X[k] where Y[k] and X[k] are the DFTs of y[n] and x[n] respectively.
You have a sequence:
x[n] = {x[0], x[1], x[2], x[3], x[4], x[5], x[6], x[7]}
You are also told that sequence y[n] is the sequence x[n] upsampled by a factor of 2:
y[n] = {x[0], 0, x[1], 0, x[2], 0, x[3], 0, x[4], 0, x[5], 0, x[6], 0, x[7], 0}
By definition we know:
X[k] =
N−1
X
n=0
x[n]e
−j
2π
N
nk
, where N = 8
(Note: X [k] is evaluated at 8 uniformly spaced frequencies around the unit circle. so therefore X[0] = X [8],
X[1] = X[9] and so on)
Y [k] =
2N−1
X
n=0
y[n]e
−j
2π
2N
nk
, where N = 8
(Note: Y [k] is evaluated at 16 uniformly spaced frequencies around the unit circle. so therefore Y [0] = Y [16],
Y [1] = Y [17] and so on)
Therefore by substitution:
Y [k] =
2N−1
X
n=0 (n even)
x[
n
2
]e
−j
2π
2N
nk
+
2N−1
X
n=0 (n odd)
0 × e
−j
2π
2N
nk
Which is just:
Y [k] =
2N−1
X
n=0 (n even)
x[
n
2
]e
−j
2π
2N
nk
Then if substitute ‘n = 2m’ we get:
Y [k] =
N−1
X
m=0
x[m]e
−j
2π
2N
(2m)k
=
N−1
X
m=0
x[m]e
−j
2π
N
mk
= X[k]
However due to the periodicity of the DFT mentioned earlier:
(a) X[k + mN ] = X[k], where N = 8 and m is an integer. (i.e. it repeats every 8 samples)
So therefore X[0] = X[8], X[1] = X[9] and so on.
(b) Y [k + m(2N )] = Y [k] where N = 8 and m is an integer. (i.e. it repeats every 16 samples)
So we need only evaluate Y [k] where k = 0..2N − 1.
Aidan O. T. Hogg Page 9