0% found this document useful (0 votes)
79 views53 pages

Wavelet Transform First File

The document discusses sampling theory and its applications in time and frequency domains. It also covers digital signal processing techniques like convolution and filtering. Discrete wavelet transforms and short-time Fourier analysis are introduced as tools for time-frequency analysis of signals.
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
0% found this document useful (0 votes)
79 views53 pages

Wavelet Transform First File

The document discusses sampling theory and its applications in time and frequency domains. It also covers digital signal processing techniques like convolution and filtering. Discrete wavelet transforms and short-time Fourier analysis are introduced as tools for time-frequency analysis of signals.
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/ 53

Sampling Theorem

Sampling Theorem (Time domain)


Sampling Theorem (Time domain)
Sampling Theorem (Frequency
domain)
Sampling Theorem (Periodic Signal)
Sampling Theorem (Periodic Signal)

Sampling the periodic signal without condition gives a non-periodic signal


Sampling effect on the system
Prove
Digital signal process
Impulse response h(n)

x(n) DSP y(n)=???


[1 2 3 2 1]
n=0 n=1 n=2 n=3 n=4
[ 1 -1]

What is the Mathematical operation to get the Output y(n)

Convolution
h(n) x(n)

n n

h(-n) x(n)

n n
x(n)

n
If n=-1

h(-n)

y(n)

n
x(n)

n
If n=0

h(-n)

y(n)

n
x(n)

n
If n=1

h(-n)

y(n)

n
x(n)

n
If n=2

h(-n)

y(n)

n
x(n)

n
If n=3

h(-n)

y(n)

n
x(n)

n
If n=4

h(-n)

y(n)

n
x(n)

n
If n=5

h(-n)

y(n)

n
x(n)

n
If n=6

h(-n)

y(n)

n
Convolution equation

= ()
=
y(n) y(n)
h(n) h(n)
= 1 1
= 1 = 1 cos jsin()
| | = 1 cos 2 + sin 2

1
sin
= tan ( )
1 cos
Where wc=2*pi*fc*Ts
x(n) y(n)
Up sampler

n 2 n

5 samples 10 samples
x(n) y(n)
Down sampler

n 2 n

5 samples 3 samples
Interpolation

h=[1 1]


=
2
If time of 5 samples =10 samples
DTFT
( ) ( 2 )


2

Relationship Between the HPF & LPF

( ) = 1 ( ) = ( )
Fourier Series
Complex form of Fourier series


=
=

1

= . Fourier Transform
2

= .
1
= .
2
=

1
= ()
=

() =

1
= . = .

Short-Time Fourier Analysis
In an effort to correct this deficiency, Dennis Gabor (1946) adapted the Fourier
transform to analyze only a small section of the signal at a time -- a technique called
windowing the signal. Gabor's adaptation, called the Short-Time Fourier Transform
(STFT), maps a signal into a two-dimensional function of time and frequency.
WAVELET
In numerical analysis and functional analysis, a discrete wavelet transform (DWT) is any
wavelet transform for which the wavelets are discretely sampled. As with other wavelet
transforms, a key advantage it has over Fourier transforms is temporal resolution: it captures
both frequency and location information (location in time).
Basis Function for Wavelet
Wavelet Family Short Name Wavelet Family Name
'haar' Haar wavelet
'db' Daubechies wavelets
'sym' Symlets
'coif' Coiflets
'bior' Biorthogonal wavelets
'rbio' Reverse biorthogonal wavelets
'meyr' Meyer wavelet
'dmey' Discrete approximation of Meyer wavelet
'gaus' Gaussian wavelets
'mexh' Mexican hat wavelet (also known as the Ricker
wavelet)
'morl' Morlet wavelet
'cgau' Complex Gaussian wavelets
'shan' Shannon wavelets
'fbsp' Frequency B-Spline wavelets
'cmor' Complex Morlet wavelets
'fk' Fejer-Korovkin wavelets
Tool Box- Matlab
ECG Denoising Signal 1
Load wecg
Select 1-D wavelet
File import from workspace
Import signal-Select wecg

2
3
Select the wavelet you wont and number of level, then
click on analysis
Thank you

You might also like