* There are two time domain characteristics that determine

the type of signal spectrum we obtain.

ie., whether the signal is Continuous or Discrete and
whether the signal is Periodic or Aperiodic.
* As we have different type of signals, there are different

DFT
transforms.
* Continuous time signals have aperiodic spectrum.
* Discrete time signals have periodic spectrum.
* Periodic signals have discrete spectrum.
* Aperiodic finite energy signals have continuous spectra.
Discrete Periodic
ie, Periodic Discrete
Aperiodic Continuous
Continuous Aperiodic

Discrete time Fourier Series „ The F.S. representation of an ‘N’ periodic Discrete time signal xp(n)
is expressed as,
ƒ Fourier series representation of a continuous time periodic signal can
consist of an infinite number of frequency components, where the j 2 π kn
N −1 N
∑
frequency spacing between two successive harmonically related
frequencies is 1/Tp , where Tp is the fundamental period. xp(n ) = ck e (1)
k =0
But the frequency range for discrete time signals is unique over the „ Where ck – the coefficients in the series representation. This can be
interval (-п, п) or (0, 2п). defined in terms of xp(n); as…

* A discrete time signal of fundamental period N can consists of frequency − j 2πkn

N −1
1 N
∑x
components separated by 2п/N radians or f=1/N cycles.
ck = p ( n) e
* Consequently, the Fourier series representation of the discrete time
N n=0
(2)

periodic signal will contain atmost ‘N’ frequency components.

ck , k = 0,1,……N-1 provides description of x p (n) in frequency
* This is the basic difference between F.S. representations for Continuous domain.
and Discrete time signals.

„ The Fourier series coefficients ck form a periodic „ Determine the spectra of the signals,
sequence when extended outside of the range a) x p (n) is periodic with period N=4 and -- x p (n) = {1,1,0,0}
π
k = 0,1,….N-1. b) x p (n) = cos n. ↑
3
Soln.
− j 2πkn
„ Hence ck+N = ck 3
a) ck = 1 ∑ x p (n) e 4 ; k= 0,1,2,3.
ie, {ck} is periodic sequence with fundamental period ‘N’. 4 n =0
− jπk
1
ck =(1 + e 2 )
4 ; k= 0,1,2,3.
ƒ Thus the spectrum of a signal x p (n) , which is periodic with
1 1 1
period N, is a periodic sequence with period ‘N’. ∴ c0 = , c1 = (1 − j ), c2 = 0, c3 = (1 + j )
2 4 4

ƒ Any ‘N’ consecutive samples of the signal or its spectrum b) In this case, f0 =1/6 and hence xp(n) is periodic with
provide a complete description of the signal in the time or fundamental period n=6. So we have,
− j 2πkn
frequency domain. 1 5
ck = ∑ x p ( n ) e 6 ; k=0,1,…….5.
6 n =0

1
„ However, x p (n) can be expressed as, Discret Time Fourier Transform
j 2πn − j 2πn
2πn 1 1 „ For Discrete time Finite duration sequences.
x p (n) = cos = e 6
+ e 6 ∞
6 2 2 X (e jω ) = ∑ x ( n) e
n = −∞
− jωn

(1)
„ Which is already in the form of the exponential Fourier jω
This is termed as DTFT of x(n). The spectrum X (e )is periodic with
series in eqn.----------(1) and it is apparent that c1=1/2. period 2п.

„ The second term in x p (n) corresponds to the term k=-1 in ƒ We can obtain the coefficients x(n) from X (e ) using the inverse
jω
eqn.-----(1). But k = -1 is same as k = 5 because of transform…
periodicity.
∴ c−1 = c5 x(n) =
1
∫ X (e
jω
) e jωn dω (2)
2π 2π
„ Therefore we conclude that,
c0= c2 = c3= c4 = 0 ƒ Important point to note:
∞
X (e jω ) exists only if x(n) is absolutely
c1= ½; c5 =½.
summable, that is
∑
x (n) ≺ ∞
n = −∞

Find the DTFT of x(n) = an u(n); |a|<1.

„
Discrete Fourier Transform
„ Soln.: „ Discrete Fourier Transform of a discrete time signal x(n)
is obtained by sampling one period of the Fourier
Since |a|<1, the sequence x(n) is absolutely
Transform X(ω) of the signal x(n) at a finite number of
summable, as can be verified by applying the
frequency points.
geometry series
∞
summation
∞
formula.
1 The sampling is performed at N equally spaced points in
∑ ∑
„
x ( n ) = a n
= <∞ the period 0 to 2п at ωk=2пk/N
n = −∞ n =0 1− a
„ The FT of a discrete time signal is a continuous function
Hence the F.T. of x(n) exists and is obtained by, of ω and so cannot be processed by any digital system.
∞ ∞
X (e jω ) = ∑ a n e − jωn = ∑ ( a e − jω ) n „ The DFT converts the continuous function of ω in to a
n =0 n =0 discrete function of ω
Use of geometric series summation formula gives, „ Thus DFT allows us to perform frequency analysis on
1 digital systems.
X ( e jω ) =
1 − a e − jω

Discrete Fourier Transform Example 1

„ The N point DFT of a finite duration sequence x(n) „ Compute the 4 point DFT of the sequence
of length L where N≥L is defined as ⎧1 / 3 0≤n≤2
j 2 πkn
x (n ) = ⎨
N −1 − ⎩0 elsewhere
DFT {x ( n )} = X ( k ) = ∑ x ( n ) e N
; for k = 0,1, 2,..., N − 1
n=0 N −1 j 2 π kn
−
„ The inverse DFT of a sequence X(k) of length N is X (k ) = ∑ x ( n )e
n=0
N
; for k = 0,1,2 ,..., N − 1
defined as 3 j 2 π kn
−
1 N −1
IDFT {X ( k )} = x ( n ) =
j 2πkn = ∑ x ( n )e 4
; for k = 0,1,2 ,3
∑ X (k )e N ; for n = 0,1,2,..., N − 1
N k =0
n =0
3 jπ kn
−
„ We say that x(n) and X(k) form a DFT pair = ∑ x ( n )e
n =0
2
; for k = 0,1,2 ,3
jπ k j 3π k
x ( n ) ←⎯⎯→ X ( k )
DFT
= x ( 0 ) e 0 + x (1) e
−
2
+ x ( 2 ) e − j π k + x ( 3) e
−
2

2
 Example 1(Contd…) Example 1(Contd…)
jπk 1⎡ π π ⎤
X (k ) =
1 1
+ e
− 1
+ e − jπk when k = 1, X (1) = 1 + cos − j sin + cos π ⎥
3 ⎢⎣
2
3 3 3 2 2 ⎦
X (1) = [1 + 0 − j − 1] = − j = ∠ − π / 2
1 1 1
1⎡ πk πk ⎤
= ⎢1 + cos − j sin + cos π k − j sin π k ⎥ 3 3 3
3⎣ 2 2 ⎦
when k = 2 , X ( 2 ) = [1 + cos π − j sin π + cos 2π ]
1
1⎡ πk πk ⎤ 3
X ( k ) = ⎢1 + cos − j sin + cos π k ⎥
X ( 2 ) = [1 − 1 − j 0 + 1] = = ∠0
3⎣ 1 1 1
2 2 ⎦
3 3 3
1⎡ 3π 3π ⎤
when k = 0, X ( 0 ) = [1 + cos 0 − j sin 0 + cos 0 ]
1 when k = 3, X ( 3) = ⎢1 + cos − j sin + cos 3π ⎥
3 3⎣ 2 2 ⎦
X ( 0 ) = [1 + 1 + 1] = 1 = 1∠ 0
1
X (3) = [1 + 0 + j − 1] = j = ∠π / 2
1 1 1
3
3 3 3

Example 1(Contd…) Magnitude and Phase spectrum

„ 4 point of the sequence x(n) is given by 1 .5

⎧ 1 π 1 1 π⎫ 1
X (k ) = ⎨1∠0, ∠ − , ∠0, ∠ ⎬
⎩ 3 2 3 3 2⎭ 0 .5

⎧ 1 1 1⎫
Magnitude function X (k ) = ⎨1, , , ⎬ 0
-1 0 1 2 3 4
⎩ 3 3 3⎭
⎧ π π⎫ π
Phase function ∠X (k ) = ⎨0,− ,0, ⎬
⎩ 2 2⎭ 2

π
−
2
-1 0 1 2 3 4

Periodicity of DFT spectrum Example 2

1 .5 „ Compute the DFT of the sequence x(n)={0,1,2,3}
N −1 j 2 π kn
−
∑ x ( n )e
1
X (k ) = N
; for k = 0,1,2 ,..., N − 1
0 .5 n =0

Here L = 4. So N should be at least equal to L, i.e., 4

0
-1 0 -5 0 5 10
Hence we have to take 4 point DFT
3 j 2 π kn
−
X (k ) = ∑ x (n )e
n =0
4
; for k = 0,1,2 ,3

3 jπ kn
−
= ∑ x (n )e
n =0
2
; for k = 0,1,2 ,3

-1 0 -5 0 5 10

3
 Example 2(Contd…) Example 2(Contd…)
jπk j 3πk
− −
X (k ) = x (0)e0 + x (1)e 2
+ x ( 2)e − jπk + x (3)e 2

jπ k j 3π k X (2) = [cosπ − j sinπ + 2(cos2π − j sin2π ) + 3(cos3π − j sinπ )]

− −
− jπ k
=e 2
+ 2e + 3e 2
= −2 = 2 ∠180 = 2 ∠ π
⎡ πk πk ⎛ 3πk 3πk ⎞⎤
= ⎢cos − j sin + 2(cosπ − j sinπ ) + 3⎜ cos − j sin ⎟ ⎡ 3π 3π ⎛ 9π 9π ⎞⎤
⎣ 2 2 ⎝ 2 2 ⎠⎥⎦ X (3) = ⎢cos − j sin + 2(cos3π − j sin3π ) + 3⎜ cos − j sin ⎟⎥
⎝ 2 ⎠⎦
X (0) = [cos0 − j sin 0 + 2(cos0 − j sin 0) + 3(cos0 − j sin 0)] ⎣ 2 2 2
= -2 − 2 j = 2.8∠ − 135 = 2.8∠ − 0.75π
= 6 = 6∠0
⎡ π π ⎛ 3π 3π ⎞⎤ Magnitude function X (k ) = {6,2.8,2,2.8}
X (1) = ⎢cos − j sin + 2(cosπk − j sinπk ) + 3⎜ cos − j sin ⎟⎥
⎣ 2 2 ⎝ 2 2 ⎠⎦
= -2 + 2 j = 2.8∠135 = 2.8∠0.75π Phase function ∠X (k ) = {0,0.75π ,π ,−0.75π }

Example 2(Contd…) HW Problems with answers

8 „ Compute the 5-point DFT of the sequence x(n)={2,0,0,2,0}
6 Magnitude function X (k ) = {4,1.24, 3.24, 3.2,1.24}
4 Phase function ∠X (k ) = {0, 1.24, - 0.63, 0.62,- 1.26}
2
„ Compute the 5-point DFT of the sequence x(n)={1,1,0,0}
Magnitude function X (k ) = {2,1.414, 0,1.414}
0
-1 0 -5 0 5 10

π Phase function ∠X (k ) = {0, − 0.785, 0, 0.785}

−π
-1 0 -5 0 5 10

Example 3 Example 3(Contd….)

Find the IDFT of the sequence X(k)={1,0,1,0}
[ ]
1 + e jπn = [1 + cos πn + j sin πn ]
„ 1 1
j 2πkn
x(n ) =
N −1 4 4
IDFT {X ( k )} = x ( n ) =
1
∑ X ( k )e N
; for n = 0,1,2,..., N − 1
x (0) = [1 + cos 0 + j sin 0] = 0.5
N 1
k =0
4
Here L = 4. So N should be at least equal to L, i.e., 4
x (1) = [1 + cos π + j sin π ] = 0
1
j 2πkn
1 3 4
x(n) = ∑
4 k =0
X ( k )e 4 ; for n = 0,1,2,3
x( 2) = [1 + cos 2π + j sin 2π ] = 0.5
1
jπkn
4
1 3
= ∑ X ( k )e 2 ; for n = 0,1,2,3 x (3) = [1 + cos 3π + j sin 3π ] = 0
1
4 k =0 4
1⎡ jπ n j 3π n
⎤ x ( n ) = {0 .5,0 ,0 .5,0}
jπ n
x(n ) = ⎢ X ( 0) e + X (1) e + X ( 2 ) e + X ( 3) e
0 2 2
⎥
4⎣ ⎦

4
 Example 4 Example 3(Contd….)
jnπ j 3πn
Find the IDFT of the sequence X ( k ) = {3, 2 + j, 1, 2 − j} 1⎡ jπ n ⎤
„ x(n ) = ⎢3 + ( 2 + j ) e + e + ( 2 − j ) e
2 2
⎥
N −1 j 2πkn 4⎣ ⎦
IDFT {X ( k )} = x ( n ) =
1
N
∑ X ( k )e
k =0
N
; for n = 0,1,2,..., N − 1 1⎡
4⎣
⎛ π
⎝ 2
π ⎞
2 ⎠
⎛ 3π
⎝ 2
3π ⎞⎤
x(n) = ⎢3 + (2 + j)⎜cos n + j sin n⎟ + (cosπn + j sinπn) + (2 − j)⎜cos n + j sin n⎟⎥
2 ⎠⎦
Here L = 4. So N should be at least equal to L, i.e., 4 1
[3 + (2 + j ) + 1 + (2 − j )] = 2
x ( 0) =
3 j 2πkn 4
1
x(n) = ∑ X (k )e ; for n = 0,1,2,3
4 k =0
4
x (1) = [3 + ( 2 + j ) j − 1 + ( 2 − j )( − j )] = 0
1
4
x ( 2) = [3 + ( 2 + j )( −1) + 1 + ( 2 − j )( −1)] = 0
jπkn 1
1 3
= ∑ X ( k )e 2 ; for n = 0,1,2,3 4
4 k =0
x (3) = [3 + ( 2 + j )( −1) + ( −1) + ( 2 − j )( j )] = 1
1
jπ n j 3π n
1⎡ jπ n ⎤ 4
x(n ) = ⎢ X ( 0) e + X (1) e + X ( 2 ) e + X ( 3) e
0 2 2
⎥
4⎣ x ( n ) = {2 ,0,0 ,1}
⎦

Circular shift of sequences Circular shift of sequences

„ Consider a finite duration sequence x(n) and its periodic
5
extension xp(n)=x(n+N) where N is the periodicity.Let N=4
Let x(n) = {1,2,3,4 }
4
x(n) 3
„ If x(n) is shifted to right or left by 4,8,12,…units we get the 2
same sequence.
1
„ Now we can represent the periodic extension of x(n) as 0
∞ -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7 8
x p (n) = ∑ x ( n − lN )
l = −∞
5

„ Let xp(n) is shifted to right by 2 units. The shifted sequence is 4

represented by x’p(n)=xp(n-2,mod 4) 3
xp(n) 2
„ Mod 4 indicates that the sequence repeats after 4 samples.
1
„ This can also be represented as xp((n-2))N.
0
-5 -4 -3 -2 -1 0 1 2 3 4 5 6 7 8

Circular shift of sequences Circular shift of sequences

5
4 „ The relation between original sequence and shifted sequence
3
is
x(n)
2 x' p (n) = x p (( n − 2 )) N
1
0
x' p (n) = x p (( n − 2 )) 4
-4 -3 -2 -1 0 1 2 3 4 5 6 7 8 9 10

5 x' p (0) = x p (( − 2 )) 4 = 3
4
3 x' p (1) = x p (( − 1)) 4 = 4
x’p(n)2
1
x' p (2) = x p (( 0 )) 4 = 1
0
-4 -3 -2 -1 0 1 2 3 4 5 6 7 8 9 10
x' p (3) = x p ((1)) 4 = 2

5
 Circular shift of sequences Circular shift of sequences
∞
„ The sequences xp(n) and x’p(n) can be conveniently x' p (n) = ∑x p ( n − lN )
represented as points on the circumference of a circle. l = −∞
∞

∑x
Now x’p(n) is simply xp(n) shifted circularly by 2 units of time.
x' p (n - k) = ( n − k − lN )
„
p
„ When the sequence is shifted 4 times it repeats itself. l = −∞
A time reversal is equivalent to plotting x(n) in a clockwise
xp(1)= 2 x'p (1)= 4
„
direction.
„ Anticlockwise direction is selected as positive direction.
5 7
xp(0)=1 x'p (2)=1 x'p (0)= 3

xp(2)= 3 3 x(n) 1 3 x(-n) 1

xp(3)= 4 x'p (3)= 2

7 5

Circular convolution Example 1

„ Multiplication of the DFT’s of two signals is equivalent to „ Find the circular convolution of x(n)={0,1,2,3} and h(n)={2,1,1,2}
N -1
circular convolution of the sequences in time domain. y(m) = ∑ x1 ( n ) x 2 (( m − n )) N m = 0,1,2,... N − 1
x 1 ( n ) ←⎯
⎯→ X 1 ( k )
DFT n =0
3
y(m) = ∑ x ( n )h (( m − n )) N m = 0,1,2,3
x 2 ( n ) ←⎯⎯→ X 2 ( k )
DFT
n =0
3
y(0) = ∑ x ( n ) h (( − n )) 4
x 1 ( n ) ⊗ x 2 ( n ) ←⎯⎯→ X 1 ( k ) X 2 ( k )
DFT
n =0

„ Circular convolution is expressed as = x ( 0) h ( 0) + x (1) h ( −1) + x ( 2 ) h ( −2 ) + x ( 3) h ( −3)

N -1
= 0 × 2 + 1× 2 + 2 ×1 + 3×1 = 7
y(m) = ∑ x 1 ( n ) x 2 (( m − n )) N m = 0,1,2,... N − 1 3
y(1) = ∑ x ( n ) h ((1 − n )) 4
n =0 n =0
= x ( 0) h (1) + x (1) h ( 0) + x ( 2 ) h ( −1) + x ( 3) h ( −2 )
= 0 ×1 + 1× 2 + 2 × 2 + 3 ×1 = 9

Example 1 (Contd…) Example 2

3 „ Perform circular convolution of the following sequences:
y(2) = ∑ x ( n ) h (( 2 − n )) 4 x(n)={2,1,2,1} h(n)={1,2,3,4}
n =0
1
= x ( 0) h ( 2 ) + x (1) h (1) + x ( 2 ) h ( 0) + x ( 3) h ( −1)
2
= 0 × 1 + 1 × 1 + 2 × 2 + 3 × 2 = 11 4
3 2 x(n)
y(3) = ∑ x ( n ) h (( 3 − n )) 4
2 3 h(n) 3 h(-n) 1
1
n =0

= x ( 0) h ( 3) + x (1) h ( 2 ) + x ( 2 ) h (1) + x ( 3) h ( 0) 4 2
1
= 0 × 2 + 1×1 + 2 ×1 + 3× 2 = 9
y(m) = {7,9,11,9}

6
Example 2 (Contd…) Example 2 (Contd…)

1 1

4 y(0)=1x2+4x1+3x2+2x1=14 1 y(1)=2x2+1x1+4x2+3x1=16
2 3 1 2 2 4 2 2
2 3

1 1

Example 2 (Contd…) Example 2 (Contd…)

1 1

2 y(2)=3x2+2x1+1x2+4x1=14 3 y(3)=4x2+3x1+2x2+1x1=16
2 1 3 2 2 2 4 2
4 1

Ans: y(m)={14,16,14,16}

1 1

Circular Convolution-Matrix method Example 3

„ Perform circular convolution of the following sequences:

2 14
x(n)={1,-1,-2, 3,-1} h(n)={1,2,3,}
1 4 3 2
1 16
2 1 4 3
3 2 1 4 X 2 = 14 -1
0
-2
4 3 2 1 1 16 0

x(n) 1 h(-n) 1
3
3
y(m)={14,16,14,16} -1
2

7
Example 3 Example 3

y(0)=1x1+0x-1+0x-2+3x3+2x-1=8 y(1)=2x1+1x-1+0x-2+0x3+3x-1=-2
-1 -1
-2 -2

0 1
0 0
1 1 2 1
3 0
2 3
3 3

-1 -1

Example 3 Example 3
y(2)=3x1+2x-1+1x-2+0x3+0x-1=-1 y(3)=0x1+3x-1+2x-2+1x3+0x-1=-4

-1 -1
-2 -2

2 3
1 2
3 1 0 1
0 1
0 0
3 3

-1 -1

Example 3 Circular Convolution-Matrix method

y(4)=0x1+0x-1+3x-2+2x3+1x-1=-1
1 8
-1 1 0 0 3 2
-2
2 1 0 0 3 -1 -2
3 2 1 0 0
X -2 = -1
0
3 0 3 2 1 0
3 -4
0 1 0 0 3 2 1
2 -1 -1
1
3
y(m)={8,-2,-1,-4,-1}
-1 Ans: y(m)={8,-2,-1,-4,-1}

8
 Linear and circular convolutions Linear and circular convolutions
„ Linear convolution is used to find the response of a system. „ For performing the circular convolution both the sequences
„ If h(n) is the impulse response and x(n) is the input, the output should be of the same length, say,N.
y(n) is given by the convolution of h(n) and x(n). „ If one of the sequences has length less than N, it should be
y (n ) = x (n ) ∗ h(n ) padded with zeroes so that both sequences has same length N.
„ This can be done either using the basic definition of „ The circular convolution then produces a sequence of length N.
convolution, i.e., ∞
But the linear convolution produces a sequence of length
y (n ) = ∑ h(n ) x(n − k )
„

k = −∞
or the convolution may be converted to multiplication if the
quantities are transformed to other domains.
ƒ But DFT supports only Circular convolution and it cannot be
used to find the response of a system as in the case of linear
convolution.
N=N1+N2-1.
„ It is possible to employ circular convolution to find the output
response of systems by appending zeroes to both the
sequences such that the length of sequences are both
N=N1+N2-1.
„ Append N-N1 and N-N2 zeroes to the sequences to make the
lengths equal to N1+N2-1 and then perform circular convolution.

Example 4 Circular Convolution-Matrix method

„ Determine the output response y(n) if h(n)={1,1,1} and x(n) ={1,2,3,1} N1=3,N2=4 and N=N1+N2-1=6. So we have to add
(i) By linear convolution (ii) By circular convolution 3 zeroes to h(n) and 2 zeroes to x(n) to make N=6
and then perform circular convolution.
h(n)={1,1,1,0,0,0} and x(n)={1,2,3,1,0,0}
1 1 1 1 1
1 0 0 0 1 1
1 1 1 1 2
y(n)={1,3,6,6,4,1} 1 1 0 0 0 1 3
2 2 2 2 1 1 1 0 0 0 3 6
x
3 3 3 3 0 1 1 1 0 0 1 = 6
1 1 1 0 0 1 1 1 0 0 4
1
0 0 0 1 1 1 0 1

HW Problems Properties of DFT

„ Find the circular convolution of the following sequences. „ Linearity:
X 2 ( k ) = DFT {x2 ( n )}
(i) x(n)={1,2,2,1} h(n)={1,2,3,1}
If X 1 (k ) = DFT {x1 (n)} and
(ii) x(n)={1,2,3,1} h(n)={4,3,2,2}
ƒ Find the response of the system with h(n)={1,2,4} to the input then, DFT {a1 x1 (n) + a2 x2 (n)} = a1 X 1 (k ) + a2 X 2 (k )
sequence x(n)={ 1,2} using circular convolution.
„ Periodicity:
If X(k) ←⎯⎯→ x ( n )
DFT

X(k + N) = X ( k ) for all k

x(n + N) = x(n) for all n

9
Properties of DFT Properties of DFT
„ Time reversal:
„ Circular time shift:
If X(k) ←⎯⎯→ x ( n )
DFT
If X(k) ←⎯⎯→ x (n )
DFT

x ((- n ))N ←⎯⎯→ X ( N − k )

DFT then, − j 2πkl
x((n − l )) N ↔ X (k ) e N

„ Circular frequency shift:

„ Conjugation:
If X(k) ←⎯⎯→ x ( n )
DFT

j2 πln x ∗ ( n ) ←⎯⎯→ X ∗ ( N − k ) = X ∗ ((− k ))N

DFT

x(n)e N
⎯→ X ((k − l ))N
←⎯DFT
x *( N − n) ↔ X *( K )

„ Symmetry: (Complex Conjugate) Properties of DFT

„ Multiplication:
„ The symmetry properties may summarized as x1 ( n ) ←⎯⎯→ X 1 ( k )
DFT

follows: x 2 ( n ) ←⎯ ⎯→ X 2 ( k )
DFT

x(n) = x (n) + x (n) + jx (n) + jx (n)

e
R
o
R
e
I
o
I x1 ( n ) x 2 ( n ) ←⎯⎯→ [X 1 ( k ) ⊗ X 2 ( k )]
DFT 1
N
„ Convolution:
x 1 ( n) ←⎯⎯→ X 1 ( k )
DFT

X ( K ) = X ( K ) + X ( K ) + jX ( K ) + jX ( K )
e
R
o
R
e
I
o
I x 2 ( n ) ←⎯⎯→ X 2 ( k )
DFT

x1 ( n ) ⊗ x 2 ( n ) ←⎯⎯→ X 1 ( k ) X 2 ( k )
DFT

ƒ Parseval’
Parseval’s Theorem:
The energy of a finite duration sequence x(n) is given by
N -1
1 N −1
∑ x(n ) = ∑ X (k )
2 2

n =0 N k =0

10