Scribd
Upload
53 views

Lecture Basics of FT

Here are the Fourier transforms of those signals: 1) Impulse: 1 2) Step: 1/jω 3) Sin: π(δ(ω-1) - δ(ω+1)) 4) Cos: π(δ(ω-1) + δ(ω+1)) 5) Rect(x): sin(ωx/2)/(ωx/2) 6) Sinc(x): π if ω = 0, 0 otherwise

Uploaded by

mna
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
53 views

Lecture Basics of FT

Here are the Fourier transforms of those signals: 1) Impulse: 1 2) Step: 1/jω 3) Sin: π(δ(ω-1) - δ(ω+1)) 4) Cos: π(δ(ω-1) + δ(ω+1)) 5) Rect(x): sin(ωx/2)/(ωx/2) 6) Sinc(x): π if ω = 0, 0 otherwise

Uploaded by

mna
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/ 35

Biosignal Processing

BME-311
Fourier Transform

Instructor: Engr. Farhan Yousaf


Types of Impulse Responses
 Finite Impulse Response (FIR)
 When there are finite number of samples, The system output is said to be FIR

 Infinite Impulse Response (IIR)


 When there are infinite number of samples, the system output is said to be IIR
Transforms

 A mathematical transform refers to a systematic way of associating a


mathematical expression or function with another expression or function through
a specific rule or formula.

 The purpose of a transform is often to simplify the analysis of a problem,


represent data in a more useful form, or solve a problem more effectively.

 Transforms are used in various branches of mathematics and its applications, such
as physics, engineering, and data analysis
Examples of
Transforms
 Laplace Transform:

 Fourier Transform

 Z Transform

 Cosine Transform

 Wavelet Transform
Fourier Transform

 The Fourier transform, named after Joseph Fourier, is a


mathematical transform that decomposes a function of time (or
space) into its constituent frequencies.
 It's a fundamental tool in the fields of signal processing, image
processing, and various branches of engineering and physics.
 It is a special version of Laplace transform where sigma is zero.
Fourier Transform

 The transform reveals the frequency components present in a continuous or


discrete time-domain signal.
 It is a tool that breaks a waveform (a function or signal) into an alternate
representation which are characterized by sine and cosines
 It shows that any waveform can be re-written as the weighted sum of sinusoidal
functions.
Types of FT (Fourier Transform

 Continuous-Time Fourier Transform (CTFT): Deals with continuous-time,


continuous-amplitude signals.
 Discrete-Time Fourier Transform (DTFT): Deals with discrete-time, continuous-
amplitude signals.
 Discrete Fourier Transform (DFT): A discrete version of the Fourier transform
used for discrete sequences.
 Fast Fourier Transform (FFT): An efficient algorithm to compute the DFT of a
sequence.
 Short-Time Fourier Transform (STFT): An extension of the Fourier transform
used for non-stationary signals.
Fourier Transform and inverse transform

 Given a signal x[n] and it’s Fourier Transform X[k]


Fourier Transform and inverse Transform

 Fourier Transform

 Inverse Transform
Fourier Transform

 Fourier Transform of , single variable, continuous signal

 Fourier transform of two variables function (x,y), continuous.


Properties of Fourier Transform
 Linearity

 Scaling
Properties of Fourier Transform
 Time Differentiation

 Convolution Property
Properties of Fourier Transform
 Frequency Shift Property

 Time Shift Property


Fourier Transform in Image Processing

 Used to access the geometric characteristics of a spatial domain image


 Fourier Transform decomposes the image into its sinusoidal components
 In case of images,
 Fourier transform is shifted in such a way that F(0,0) represents the center of the
image.
 The further away from the center an image point is, the higher is it’s
corresponding frequency
Fourier Transform in images

 The fourier transform is used in a wide range in image processing


 Image Filteration
 Image Analysis
 Image reconstruction
 Image compression
 Etc.
Exponentials

 Continuous Time S-Domain (Laplace Transform)

 Discrete time z-domain (z transform)


Exponentials

 Convolution integral is defined as

 If

 Representation of functions as complex exponentials is defined by fourier


Graphical approach to Fourier Series

 y0 = 1
Graphical approach to Fourier Series
Graphical approach to Fourier Series

𝑦=𝑦0+𝑦1
Graphical approach to Fourier Series
Graphical approach to Fourier Series
Graphical approach to fourier series

2
𝑦 3= cos ⁡(6 𝜋 𝑡)
3
Graphical approach to Fourier Series
Fourier Series

 In general, a Fourier series would be defined as


 In Polar Form:

 In rectangular form as such:


Fourier Series

 Exponential form:
Fourier Series and Coefficients

 Represented as

 +
Fourier Series

 For Even Function


 Fourier Coefficient,

 For Odd Function


 Fourier Coefficient,
Fourier Series vs Transform
Square Wave
Square Wave

 )
 Where
Fourier Transform
Fourier Transform

 y
Fourier Transform

𝑦 ( 𝑡 )=𝑢(𝑡)
Home Task

 Calculate Continuous Time Fourier Transform of the following signals


 1) impulse
 2) Step
 3) Sin
 4) Cos
 5) Rect(x)
 6) Sinc(x) = sinx/x

You might also like