Discrete Fourier

Transform
Lecture 3.
Elementary digital signals
 Impulse signal:

 Unit step signal

u ,
X(n) = + 2 + 3 = n[u(n) – u(n-4)]
 Exponential signal

Bounded if |α|<1 and not bounded if |α|≥1

 Sinusoidal signal
x(n) = A sin(ω0n + Φ )
Periodic if x(n+N) = x(n)
Fourier Series
 Fourier series simply states that, periodic signals can
be represented into sum of sines and cosines when
multiplied with a certain weight. It further states that
periodic signals can be broken down into further signals
with the following properties.
 The signals are sines and cosines
 The signals are harmonics of each other
Fourier transform

 The Fourier transform simply states that that the non

periodic signals whose area under the curve is finite can
also be represented into integrals of the sines and cosines
after being multiplied by a certain weight.
 The Fourier transform has many wide applications that
include, image compression (e.g JPEG compression),
filtering and image analysis.
Discrete Fourier Series (DFS): (periodic
signal) (n)

Analysis Equation
= = , for n,k=0,1,2, . . . N-1

Synthesis Equation

== , for n,k=0,1,2, . . . N-1

Where are periodic with N

Where, =
Discrete Time Fourier Transform (DTFT):
Analysis Equation
+∞
𝐗 ( 𝛚) = ∑ 𝐱 ( 𝐧 ) 𝐞− 𝐣𝐰𝐧
𝐧=− ∞

Synthesis Equation

Where,
x(n) is discrete and Aperiodic signal
X(ω) is continuous and periodic with period 2π
DTFT DFT

DTFT is an infinite continuous sequence where the DFT is a finite non-continuous discrete sequence. DFT,
time signal (x(n)) is a discrete signal. too, is calculated using a discrete-time signal.

DTFT is periodic DFT has no periodicity.

The DTFT is calculated over an infinite summation; The DFT is calculated over a finite sequence of values.
this indicates that it is a continuous signal. This indicates that the result is non-continuous.

The continuous variable found in the DTFT (ω) is

replaced with a finite number of frequencies located
at 2πk/NTs. Here Ts is the sampling rate. In other
The ω in the exponential function is a continuous
words, if we take the DTFT signal and sample it in the
frequency variable.
frequency domain at omega=2π/N, then we get the
DFT of x(n). In summary, you can say that DFT is just a
sampled version of DTFT.

DTFT gives a higher number of frequency components. DFT gives a lower number of frequency components.

DTFT is defined from minus infinity to plus infinity, so

DFT is defined from 0 to N-1; it can have only positive
naturally, it contains both positive and negative values
frequencies.
of frequencies.

To improve the accuracy of DFT, the number of

samples must be very high. However, this will, in turn,
More accurate
cause a significant increase in the required
computational power. So it’s a trade-off.

DTFT and DFT will coincide at intervals of

DTFT will contain some of the values of DFT too.
omega=2ωk/N where k = 0,1,2…N-1.
Discrete Fourier Transform (DFT) of
length N: 𝒙 ( 𝒏 ) 𝑫 𝑭𝑻 ( 𝑵) 𝑿 (𝒌)
↔

Analysis Equation
𝐍−𝟏
𝐗 ( 𝐤 )= ∑ 𝐱 ( 𝐧 ) 𝑾
𝐍−𝟏 𝟐𝝅 𝒏𝒌
−𝐣 𝐧𝐤
𝐗 ( 𝐤 )= ∑ 𝐱 ( 𝐧 ) 𝐞 𝑵
𝐧=𝟎
𝑵

𝐧=𝟎

For n,k  0, 1, 2, . . . . . N-1

Synthesis Equation

x x

Where,
x(n) is discrete and Aperiodic signal,
X(k) is discrete and periodic with period N-1,
Example1.
Example2.
Properties of DFT
1. Linearity
If

If

Then,
2. Circular shift of a sequence

If

Then
3. Duality property

If

𝒕𝒉𝒆𝒏 , 𝑿 [ 𝒏 ] 𝑫𝑭𝑻 ( 𝑵 ) 𝑵𝒙 [ ( ( − 𝒌 ) ) 𝑵 ] ,𝟎 ≤ 𝒌 ≤ 𝑵 − 𝟏
↔
4.Symmetry Properties
5. Circular Convolution property
If

If

Then, x1(n) x2(n) X1(k) X2(k)

𝑵 −𝟏
where ,  x1( n ) 𝑵   x2( n) =  ∑ 𝒙 𝟐 [ 𝒎 ] 𝒙 𝟏[((𝒏 −𝒎 ) )𝑵 ]
𝒎=𝟎
Summary of
Properties
of DFT