Scribd
Upload
33 views

Discrete Fourier Transform

The document discusses the discrete Fourier transform (DFT) and its relationship to other transforms. It makes two main conclusions: 1. When a function is discrete and periodic, its Fourier series coefficients can be described by a finite set of complex numbers known as the discrete Fourier transform (DFT). 2. The Fourier series coefficients of a periodic, bandlimited signal are given by the DFT of one period of the signal's samples, divided by N, where N is the length of the DFT and the number of samples in each period of the signal.

Uploaded by

Thi Vũ
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
33 views

Discrete Fourier Transform

The document discusses the discrete Fourier transform (DFT) and its relationship to other transforms. It makes two main conclusions: 1. When a function is discrete and periodic, its Fourier series coefficients can be described by a finite set of complex numbers known as the discrete Fourier transform (DFT). 2. The Fourier series coefficients of a periodic, bandlimited signal are given by the DFT of one period of the signal's samples, divided by N, where N is the length of the DFT and the number of samples in each period of the signal.

Uploaded by

Thi Vũ
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/ 10

Discrete Fourier Transform

Relation to other Transforms

Group members: Trương Sĩ Thi Vũ, Nguyễn Đức Dân, Praise


Oketola, Đoàn Liên Hương, Nguyễn Duy Minh
Signal types

 A signal can be either continuous or discrete, and it can be periodic or aperiodic


There are four types of signals.
Continuous and periodic
Continuous and aperiodic
Discrete and periodic
Discrete and aperiodic
Discrete Fourier Transform and Discrete-Time Fourier Series

DFT: Transform a sequence of N complex numbers DTFS: For discrete


x0, x1, x2,.. x(n-1) into another sequence of complex periodic signals
numbers X0, X1, X2,… X(n-1) which is defined by:
Discrete Fourier Transform and Discrete-Time Fourier Series

Fourier series is a periodic function.


When the function being represented, whether finite-length or periodic, is discrete, the Fourier
series coefficients are periodic, and can therefore be described by a finite set of complex
numbers. That set is called a discrete Fourier transform (DFT). => Conclusion 1.
Discrete Fourier Transform and Continuous-Time Fourier Series

In continuous time, a periodic signal x(t) with period P seconds, may be expanded
into a Fourier Series with coefficients given by
Discrete Fourier Transform and Continuous-Time Fourier Series

We wish to find the Continuous-Time FS of the sampled periodic signal x(nT), so we


replace x(t) and apply the shifting property:
Discrete Fourier Transform and Continuous-Time Fourier Series

If the sampling interval T is chosen so that it divides the signal period P, then the
number of samples under the integral is an integer N = P/T, so
Discrete Fourier Transform and Continuous-Time Fourier Series

The Fourier Series coefficients of a periodic, bandlimited signal x are given by the, DFT
of one period of the samples of x divided by N, where N is the DFT length and also the
number of samples in each period of x => Conclusion 2.
THE END
THANK YOU FOR YOUR ATTENTION

You might also like