Scribd
Upload
52 views7 pages

DFT Introduction: Discrete Fourier Series (DFS) and Discrete Fourier

The document introduces the discrete Fourier transform (DFT). The DFT is a numerically computable transform that can represent a discrete, finite sequence in the frequency domain and reconstruct the original time domain signal. It operates on sampled signals and evaluates the frequency response at a finite number of unique frequencies, unlike the continuous Fourier transform. The DFT decomposes a periodic sampled sequence into complex exponential components of a harmonic series at normalized frequencies that are multiples of 2π/N, where N is the sequence length. It is a reversible transform commonly used for applications like audio and video compression.

Uploaded by

Yonas D. Ebren
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
52 views7 pages

DFT Introduction: Discrete Fourier Series (DFS) and Discrete Fourier

The document introduces the discrete Fourier transform (DFT). The DFT is a numerically computable transform that can represent a discrete, finite sequence in the frequency domain and reconstruct the original time domain signal. It operates on sampled signals and evaluates the frequency response at a finite number of unique frequencies, unlike the continuous Fourier transform. The DFT decomposes a periodic sampled sequence into complex exponential components of a harmonic series at normalized frequencies that are multiples of 2π/N, where N is the sequence length. It is a reversible transform commonly used for applications like audio and video compression.

Uploaded by

Yonas D. Ebren
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

DFT introduction

• For purposes of discrete signal processing, what is needed is


a numerically computable representation (transform) of the
input sequence; that is to say, a representation which is itself
a finite but complete representation that can be used to
reenter the time domain, i.e., reconstruct the original signal.
• For transforms that are not computable in this sense, samples
of the transform can be computed. Of all the transforms
discussed in the following section of the chapter, only the
Discrete Fourier Series (DFS) and Discrete Fourier
Transform (DFT) are computable transforms
DFT introduction
• The Fourier transform operates on continuous time,
aperiodic signals and evaluates the frequency
response in the continuous frequency domain.
• Many signals of interest are periodic, that is, they
are composed of a harmonic series of cosines and
sines.
• For a periodic, continuous time signal of infinite
extent in time, a set of coefficients can be obtained
based on a single period of the signal x(t)
DFT introduction

DFT
•A periodic sequence may be decomposed into component sequences that
comprise a harmonic series of complex exponentials. Since a sampled
sequence is bandlimited, it follows that the frequency of the highest
harmonic is limited to the Nyquist rate. The normalized frequencies of the
harmonics are 2piK/N.
•The DFT (a computable transform) operates on discrete, or sampled signals,
and evaluates frequency response at a number (equal to about half the
sequence length) of unique frequencies.
DFT introduction
• It is a reversible frequency transform that evaluates
the spectrum of a finite sequence at a finite number
of frequencies.
• for such applications as audio and video
compression algorithms, etc., relies on computable
transforms.
• There are other numerically computable frequency
transforms, such as (DCT), (MDCT), (DST), (DHT), but
the DFT is the most often used frequency transform.
DFT introduction
• Mathematical representation can be

• When we use in mathlab we reformulate the


dft as bellow, b/c vectors cannot use index
values that are equal to or less than zero.
DFT properties
1. Linearity: The DFT is a linear operator.
2. Circular folding: if DFT X(n)=X(k) then DFT X(-
n) =X(-k)
3. Parseval’s Relation: energy of the sequence is
the same as energy of the DFT coefficients.

• 4. Conjugate Symmetry: The DFT of a real


input sequence is Conjugate-Symmetric
DFT properties
• The DFT is periodic in both n and k
• We can use direct DFT calculation or DFT
calculation using fft algorithm

You might also like