Digital signal processing

Discrete Fourier Transform

-:
-:
A -:

-:

٢٠٢٠ – ٢٠٢١
 Introduction
In mathematics, the discrete-time Fourier transform
(DTFT) is a form of Fourier analysis that is applicable
to a sequence of values.
The DTFT is often used to analyze samples of a
continuous function. The term discrete-time refers
to the fact that the transform operates on discrete
data, often samples whose interval has units of time.
From uniformly spaced samples it produces a function
of frequency that is a periodic summation of the
continuous Fourier transform of the original continuous
function. Under certain theoretical conditions,
described by the sampling theorem, the original
continuous function can be recovered perfectly from
the DTFT and thus from the original discrete samples.
The DTFT itself is a continuous function of frequency,
but discrete samples of it can be readily calculated via
the discrete Fourier transform (DFT) (see § Sampling
WKH'7)7ZKLFKLVE\IDUWKHPRႋFRPPRQPHWKRG
of modern Fourier analysis.Both transforms are
invertible. The inverse DTFT is the original sampled
data sequence. The inverse DFT is a periodic
VXPPDWLRQRIWKHRULJLQDOVHTXHQFH7KHIDႋ)RXULHU
transform (FFT) is an algorithm for computing one
cycle of the DFT, and its inverse produces one cycle
of the inverse DFT.
 Applications of Discrete Fourier Transform

The applications of DFT are extensive. Algorithmic evolution of

FFT/IFFT(software/hardware) has accelerated these applications.
6RPHRIWKHVHDUHOLႋHGEHORZ

Array antenna analysis

Autocorrelation and cross correlation
Bandwidth compression
&KDQQHOVHSDUDWLRQDQGFRPELQDWLRQ
Convolution
Decomposition of convolved signals
)LOWHUEDQNV
Filter simulation
Forensic science
Fourier spectroscopy
Fractal image coding
FSK demodulation
*KRႋFDQFHOODWLRQ
Image quality measures
,PDJHUHJLႋUDWLRQ
Interpolation and decimation
/LQHDUHႋLPDWLRQ
/06DGDSWLYH¿OWHUV
Magnetic resonance imaging
0RWLRQHႋLPDWLRQ
Multichannel carrier modulation
 Properties of the DFT

1 - Periodicity
The extensions of the DFT and its inverse transform are periodi
with period N . In other words, for every k ,

v(k +N) =v(k),

and for every n
u(n +N) =u(N)

2 - Conjugate symmetry
The DFT of a real sequence is conjugate symmetric about N / 2 ,
where we assume N is an even number. By applying the periodicity
of the complex exponential, such as
 Basis images of the two-dimensional DFT

In order to analyze spatial frequency characteristics of a N ×N

two-dimensional signal, we consider 2 N basis images of the
same size N ×N . If each basis image contains unique two-
dimensional spatial frequency components exclusively, we can
compute the desired frequency component in the given image by
finding the inner product of the given image and the corresponding
basis image. If we form 2 N basis images by taking the outer
SURGXFWRIWZRYHFWRUVWKDWDUHSHUPXWDWLRQVIURP^N 1í`
defined in equation ( B.0), each inner product of the given
image and the corresponding basis image is equal to the two-
dimensional DFT.

DTFT Frequencies

%HFDXVH;ȦLVHVVHQWLDOO\WKHLQQHUSURGXFWRIDVLJQDO[>Q@
ZLWKWKHVLJQDOHMȦQZHFDQVD\WKDW;ȦWHOOVXVKRZVWURQJO\
WKHVLJQDOHMȦQDSSHDUVLQ[>Q@;ȦWKHQLVDPHDVXUHRIWKH
IUHTXHQF\FRQWHQWRIWKHVLJQDO[>Q@&RQVLGHUWKHSORWEHORZ
of the DTFT of some signal .
 The DTFT and Time Shifts

If a signal is shifted in time, what effect might this have on its

'7)7"6XSSRVLQJ[>Q@DQG;ȦDUHD'7)7SDLUZHKDYHWKDW

6RVKLIWLQJDVLJQDOLQWLPHFRUUHVSRQGVWRDPRGXODWLRQ
PXOWLSOLFDWLRQE\DFRPSOH[VLQXVRLGLQIUHTXHQF\
:HFDQXVHWKH'7)7IRUPXODWRSURYHWKLVUHODWLRQVKLS
E\ZD\RIDFKDQJHRIYDULDEOHVU QíP
 REFERENCES

Book : The Discrete Fourier Transform: Theory, Algorithms and Applications

https://b-ok.asia/book/1008134/e638b6

"The Scientist and Engineer's Guide to Digital Signal Processing,"

http://www.dspguide.com/CH10.PDF

Discrete-Time Signals and Systems

By:Richard Baraniuk & Matthew Moravec

https://cnx.org/exports/8e3c8b79-7dcc-4ec0-ba6e-0d3443a34180@5.9.pdf/discrete-time-signals-and-systems-5.9.pdf