6
where we have used the fact that : x′(n) = 0, n =N, N + 1, …, N +L−1.We have also chosen to
use the traditional definition of the DFT (without a scaling factor in front of the sum). Then:
N−1
X
n=0
If we plot |X(k)|and |X′(k)|in the same graph, with the x-axis being the normalized frequency
X′(mk) =
N−1
X
n=0
x(n)e−j2πnmk/mN =
N−1
X
n=0
x(n)e−j2πnk/N =X(k), k = 0,1, …N −1
This is illustrated in the following plot, for a random sequence x(n), of length N= 8, which is
padded with L= 24 zeros.
0 5 10 15 20 25 30
0
5
10
15
k
|X”(k)|
012345678
0
5
10
15
k
|X(k)|
Problem 11.5
The analog signal is :
x(t) = 1
√N
N−1
X
k=0
Xkej2πkt/T ,0≤t < T
The subcarrier frequencies are : Fk=k/T, k = 0,1, … ˜
N , and, hence, the maximum frequency
in the analog signal is : ˜
N/T. If we sample at the Nyquist rate : 2 ˜
N/T =N/T, we obtain the
discrete-time sequence :
N−1
X
N−1
X