Subject Name: Digital signal Processing

Subject Code: EC-6002

Semester: 6th
Downloaded from be.rgpvnotes.in

UNIT III
FREQUENCY ANALYSIS OF DISCRETE TIME SIGNALS

Discrete fourier series (DFS), properties of the DFS, discrete Fourier transform (DFT), properties of DFT,
two dimensional DFT, circular convolution.

DISCRETE FOURIER TRANSFORM

DFT is denoted by X (k) and given b ω= ∏ k/N

N-1
X k = ∑ n e –j2 π kn / N
n=0

IDFT is given as
N-1
x(n) = 1/N ∑ X (k) e j2 ∏ kn / N
k=0

CALCULATION OF DFT & IDFT k=0

For calculation of DFT & IDFT two different methods can be used. First method is using mathematical equation
& second method is 4 or 8 point DFT. If x (n) is the sequence of N samples then consider W N= e –j2 ∏ / N (twiddle
factor)
Four POINT DFT (4-DFT)

Sr No WN=W4=e –j ∏/ Angle Real Imaginary Total

1 W4 0 0 1 0 1
2 W4 1 - ∏/ 0 -j -j
3 W4 2 -∏ -1 0 -1
4 W4 3 - ∏/ 0 J J

n=0 n=1 n=2 n=3

k=0 W4 0 W4 0 W4 0 W4 0
[WN] = k=1 W4 0 W4 1 W4 2 W4 3
k=2 W4 0 W4 2 W4 4 W4 6
k=3 W4 0 W4 3 W4 6 W4 9

Thus 4 point DFT is given as XN = [WN ] XN

1 1 1 1
[WN] = 1 –j -1 j
1 -1 1 -1
1 j -1 -j

Page no: 1 Follow us on facebook to get real-time updates from RGPV

Downloaded from be.rgpvnotes.in

EIGHT POINT DFT (8-DFT)

Sr No WN = W8= e –j ∏/ Angle Magnitude Imaginary Total

1 W8 0 0 1 ---- 1
2 W8 1 - ∏/ /√ -j /√ /√ -j /√
3 W8 2 - ∏/ 0 -j -j
4 W8 3 - ∏/ - /√ -j /√ - /√ -j /√
5 W8 4 -∏ -1 ---- -1
6 W8 5 - ∏/ - /√ +j /√ - /√ + j /√
7 W8 6 - 7∏ / 0 J J
8 W8 7 - ∏ /√ +j /√ /√ + j /√

W8 0 = W8 8 = W8 16 = W8 24 = W8 32 = W8 40 (Periodic Property)
Magnitude and phase of x(k) can be obtained as,
|x (k)| = √ (Xr (k) 2 + XI (k) 2)

Angle x (k) = tan -1 (XI (k) / XR (k))

PROPERTIES OF DFT:
DFT
x (n) X(k)
N
1. PERIODICITY
Let x (n) and X (k) be the DFT pair then if
X (n + N) = x (n) for all n then
X (k + N) = X (k) for all k
2. LINEARITY
If X1(k) and X2(k) are the N point DFTs of x1(n) and x1(n) resp. and a and b are arbitrary constants either real
or complex valued, then
DFT
a1 x1(n) + a2 x2(n) a1 X1(k) + a2 X2(k)
N
3. TIME REVERSAL OF A SEQUENCE
The Time reversal property states that if
DFT
x (n) X(k)
N
Then
DFT
x ((-n))N = x(N-n) x((-k))N = x(N-k)
N

Page no: 2 Follow us on facebook to get real-time updates from RGPV

Downloaded from be.rgpvnotes.in

Hence, when the N-point sequence in time is reversed, it is equivalent to reversing the DFT values.
4. CIRCULAR TIME SHIFT
The Circular Time shift states that if
DFT
x (n) X(k)
N
Then
DFT
x((n-l))N x(k) e –j2 ∏ k l / N
N
N –j2 ∏ k l / N
Shifting the sequence by l units in the time domain is equivalent to multiplication of e in frequency
domain.

5. CIRCULAR FREQUENCY SHIFT

The Circular frequency shift states that if
DFT
x (n) X(k)
N
Then
DFT
j2 ∏ l n / N
x (n) e x((n-l))N
N
j2 ∏ l n / N
Hence when the sequence x (n) is multiplied by the complex exponential sequence e , it is equivalent
to circular shift of the DFT by l units in the frequency domain.

6. COMPLEX CONJUGATE PROPERTY

The Complex conjugate property states that if

DFT
x (n) X(k)
N

DFT
*
x (n) x*((-k))N = x*(N-k)
N
And
DFT
x*((-n))N = x*(N-k) x*(k)
N
7. CIRCULAR CONVOLUTION
The Circular Convolution property states that if

DFT
x1 (n) X1(k)
Page no: 3 N
Follow us on facebook to get real-time updates from RGPV
Downloaded from be.rgpvnotes.in

And
DFT
x2 (n) X2(k)
N
Then

DFT
x1(n) N x2(n) X1(k) X2(k)
N
Where x1(n) N x2(n) denotes the circular convolution of the sequences x1 (n) and x2 (n) defined as

N-1
Y (m) = ∑ x1 (m) x2 (n-m, (mod N))
n=0

8. CIRCULAR CORRELATION
For complex valued sequences x (n) and y (n)
DFT DFT
x (n) X(k) And y (n) Y(k)
N N
Then DFT
rxy(l) Rxy(k)= x(k) Y*(k)
N
Where rxy(l) is the ( unnormalised ) circular cross correlation sequence given as,
N-1
rxy(l) = ∑ n y*((n – l ))N
n=0
9. MULTIPLICATION OF TWO SEQUENCES

DFT DFT
x1 (n) X1(k) and x2 (n) X2(k)
N N

Then
DFT
x1(n) x2(n) 1 X1(k) N X2(k)
N N
10. PARSEVAL’S THEOREM
For complex valued sequences x (n) and y (n)

DFT DFT
and y (n) Y(k)
x (n) X(k)
N N

Then,

Page no: 4 Follow us on facebook to get real-time updates from RGPV

Downloaded from be.rgpvnotes.in

N-1 N-1
∑ X (n) y (n) = 1/N ∑ x (k) y*(k)
*

n=0 n=0

EXAMPLE:
Find the N-point DFT for x (n) = an for 0 < a < 1
SOLUTION:

N-1
X(k) = ∑ x (n) � −2� �/�
, k = 0, 1, ......, N-1
n=0

N-1
X(k) = ∑ an � −2� �/�

n=0

N-1
X(k) = ∑ ( a � −2� �/� n
)
n=0

1 – (a � −2� �/� N
)
X(k) = , k = 0, 1, ......, N-1
1 – a � −2� �/�

Page no: 5 Follow us on facebook to get real-time updates from RGPV

 We hope you find these notes useful.
You can get previous year question papers at
https://qp.rgpvnotes.in .

If you have any queries or you want to submit your

study notes please write us at
rgpvnotes.in@gmail.com