DSP LAB REPORT 6

DTFT DFT AND CIRCULAR

CONVOLUTION

K VENUKAREDDY B100892EC B BATCH

30 SEP 2013
Contents

1. OBJECTIVE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
2. THEORY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
2.1 Discrete Time Fourier Transform . . . . . . . . . . . . . . 2
2.2 Discrete Fourier Transform . . . . . . . . . . . . . . . . . . 2
2.3 Circular Convolution . . . . . . . . . . . . . . . . . . . . . 3
3.PROCEDURE . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
4.FIGURES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
5.RESULTS AND DISCUSSION . . . . . . . . . . . . . . . . . . . 11
6.BIBLIOGRAPHY . . . . . . . . . . . . . . . . . . . . . . . . . . 11

1
1.OBJECTIVE
1. To sample the given sinusoidal signal and to plot the frequency spec-
trum of it and also the magnitude spectrum for different values of N

2. To obtain the DFT of the sampled signal using the given formula for
three different values of N and compare it.

3. To obtain the respective 5 point DFT of the given two discrete signals
and multiply them to observe the property of circular convolution.

2.THEORY
2.1 DISCRETE TIME FOURIER TRANSFORM
[1] Discrete Time Fourier Transform (DTFT) is defined as the frequency
domain representation of the discrete time signal. It can be considered to be
obtanined by discretizing the continuous time Fourier transform in time. If
x(n) is the discrete time signal whose DTFT is X(ejω ), then DTFT can be
given as
X∞
X(ejω ) = x(n)e−jωn (1)
n=−∞

Since ejωn is periodic in ω with period 2π, X(ejω ) is also periodic in ω with
period 2π and it is continous in ω.
Given the DTFT of a signal X(ejω ), the signal x(n) can be obtained using
the inverse DTFT formula given as
Z 2π
1
x(n) = X(ejω )ejωn dω (2)
2π 0

2.2 DISCRETE FOURIER TRANSFORM

[2] Discrete Fourier Transform (DFT) of a signal is obtanied by sampling its
DTFT at a proper sampling rate. It is defined only for discrete time signals
of finite length. If there are N points in the discrete time signal x(n), then
we sample N points in one period 2π of the DTFT of the signal. This then
gives the N point DFT of the signal X(K) . So here we sample the frequency
axis
N −1
X −2πjkn
X(K) = x(n)e N (3)
n=0

2
DFT is a form of the signal suitable for computation. There exists vari-
ous computationally efficient algorithms like Fast Fourier Transform (FFT)
algorithms for computing the DFT of a signal. Given the DFT of a signal,
X(K), we can get back the signal x(n) by taking the Inverse Discrete Fourier
Transform (IDFT) of the signal. It is given as
N −1
1 X 2πjnk
x(n) = X(K)e N (4)
N K=0

2.3 CIRCULAR CONVOLUTION

[2] Supposing two sequences x1 (n) of length N1 and x2 (n) of length N2 and
also suppose N1 > N2 . Now linear convolution of the two sequences will yield
a new sequence having length N1 + N2 − 1. On the other hand to obtain the
N (where N > N1 , N2 ) point circular convolution of the two sequences, we
zero pad both x1 (n) and x2 (n) to a length of N and then take the product of
the corresponding N point DFTs of the padded sequences. IDFT of the this
will give the circular convolution of the two sequences. Circular convolution
yc (m) of two sequences x1 (n) and x2 (n) given above can be given as
N
X −1
yc (m) = x1 (n)x2 ((m − n))N (5)
n=0

where x((m−n))N represents the circular shift of the flipped sequence x(−n)
by an amount m in the anticlockwise direction. yc (n) can also be obtained
as
yc (n) = IDF T (X1 (k)X2 (K)) (6)
where X1 (K) and X2 (K) are the N point DFTs of x1 (n) and x2 (n)

3
3.PROCEDURE
1. The given sinusoidal signal x(t)=3sin(2πF t) is sampled at the given
sampling rate and its magnitude spectrum is plotted.

2. The magnitude spectrum is now again sampled for three different values
of N and its corresponding plot is observed

3. Using the given formula, the DFT of the given sampled signal is ob-
tained and compared to the previous obtained plots

4. Two discrete finite length sequences are given and their respective 5
point DFT are found by padding required number of zeros for corre-
sponding signals and the two DFTs of the signals are multiplied and
its plot is observed.

4
4.FIGURES

Figure 1: Magnitude spectrum of 3sin(2πF t)

5
Figure 2: DTFT of 3sin(2πF t) for N=5

Figure 3: DTFT of 3sin(2πF t) for N=50

6
Figure 4: DTFT of 3sin(2πF t) for N=100

Figure 5: DFT of 3sin(2πF t) for N=5

7
Figure 6: DFT of 3sin(2πF t) for N=50

Figure 7: DFT of 3sin(2πF t) for N=100

8
Figure 8: 5 point DFT of [1 2 3]

Figure 9: 5 point DFT of [2 3]

9
 Figure 10: Product of DFTs of x1 and x2

Figure 11: Cirular convolution of [1 2 3] and [2 3]

10
 Figure 12: 5 point DFT of cirular convolution of [1 2 3] and [2 3]

5.RESULTS AND DISCUSSION

• In question 1, fisrt the spectrum of xa = 3sin(2πF t) is obtained using
the DTFT of the signal. It is found that sampling the DTFT of the
signal is equivalent to obtianing the DFT of the signal for the same
number of points. In this case the sample of DTFT for N=5, 50 and
100 match with the DFT of the signal obtained for N=5, 50 and 100.

• In question 2 , circular convolution of the two signals x1=[1 2 3] and

x2=[2 3] is obtained. It is shown that N point DFT of the circular
convolution of the two signals x1 and x2 is same as the product of the
N point DFTs of x1 and x2.

6.BIBLIOGRAPHY
1 J. G. Proakis and D. G. Manolakis, Digital Signal Processing, Fourth
Edition, Pearson, 2007.

2 Signal Processing and Linear Systems,B.P.Lathi.

11