Islamic university of Gaza Faculty of engineering Electrical engineering dept. Submitted to: Dr.Hatem Alaidy Submitted by: Ola Hajjaj2003-3005 Tahleel.

Slides:



Advertisements
Similar presentations
[1] AN ANALYSIS OF DIGITAL WATERMARKING IN FREQUENCY DOMAIN.
Advertisements

DCSP-11 Jianfeng Feng
Signals and Fourier Theory
Lecture 7: Basis Functions & Fourier Series
Thursday, October 12, Fourier Transform (and Inverse Fourier Transform) Last Class How to do Fourier Analysis (IDL, MATLAB) What is FFT?? What about.
Applications in Signal and Image Processing
DFT/FFT and Wavelets ● Additive Synthesis demonstration (wave addition) ● Standard Definitions ● Computing the DFT and FFT ● Sine and cosine wave multiplication.
SIMS-201 Characteristics of Audio Signals Sampling of Audio Signals Introduction to Audio Information.
Properties of continuous Fourier Transforms
Lecture 17 spectral analysis and power spectra. Part 1 What does a filter do to the spectrum of a time series?
EECS 20 Chapter 10 Part 11 Fourier Transform In the last several chapters we Viewed periodic functions in terms of frequency components (Fourier series)
Time-Frequency and Time-Scale Analysis of Doppler Ultrasound Signals
Short Time Fourier Transform (STFT)
PROPERTIES OF FOURIER REPRESENTATIONS
Introduction to Wavelets
Continuous Time Signals All signals in nature are in continuous time.
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
Discrete Time Periodic Signals A discrete time signal x[n] is periodic with period N if and only if for all n. Definition: Meaning: a periodic signal keeps.
Goals For This Class Quickly review of the main results from last class Convolution and Cross-correlation Discrete Fourier Analysis: Important Considerations.
Copyright © Shi Ping CUC Chapter 3 Discrete Fourier Transform Review Features in common We need a numerically computable transform, that is Discrete.
Integral Transform Dongsup Kim Department of Biosystems, KAIST Fall, 2004.
Lecture 1 Signals in the Time and Frequency Domains
WAVELET TUTORIALS.
Fourier Series Summary (From Salivahanan et al, 2002)
The Story of Wavelets.
Chapter 2. Fourier Representation of Signals and Systems
Outline  Fourier transforms (FT)  Forward and inverse  Discrete (DFT)  Fourier series  Properties of FT:  Symmetry and reciprocity  Scaling in time.
8.1 representation of periodic sequences:the discrete fourier series 8.2 the fourier transform of periodic signals 8.3 properties of the discrete fourier.
The Wavelet Tutorial Dr. Charturong Tantibundhit.
Module 2 SPECTRAL ANALYSIS OF COMMUNICATION SIGNAL.
DIGITAL WATERMARKING SRINIVAS KHARSADA PATNAIK [1] AN ANALYSIS OF DIGITAL WATERMARKING IN FREQUENCY DOMAIN Presented by SRINIVAS KHARSADA PATNAIK ROLL.
README Lecture notes will be animated by clicks. Each click will indicate pause for audience to observe slide. On further click, the lecturer will explain.
Wavelet transform Wavelet transform is a relatively new concept (about 10 more years old) First of all, why do we need a transform, or what is a transform.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Digital Image Processing Chapter 4 Image Enhancement in the Frequency Domain Part I.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Background Any function that periodically repeats itself.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
ECE472/572 - Lecture 13 Wavelets and Multiresolution Processing 11/15/11 Reference: Wavelet Tutorial
Chapter 2 Signals and Spectra (All sections, except Section 8, are covered.)
Chapter 6 Spectrum Estimation § 6.1 Time and Frequency Domain Analysis § 6.2 Fourier Transform in Discrete Form § 6.3 Spectrum Estimator § 6.4 Practical.
1 Using Wavelets for Recognition of Cognitive Pattern Primitives Dasu Aravind Feature Group PRISM/ASU 3DK – 3DK – September 21, 2000.
Fourier Analysis of Discrete Time Signals
7- 1 Chapter 7: Fourier Analysis Fourier analysis = Series + Transform ◎ Fourier Series -- A periodic (T) function f(x) can be written as the sum of sines.
INTRODUCTION TO SIGNALS
The Story of Wavelets Theory and Engineering Applications
1 Roadmap SignalSystem Input Signal Output Signal characteristics Given input and system information, solve for the response Solving differential equation.
The Fourier Transform.
Short Time Fourier Transform (STFT) CS474/674 – Prof. Bebis.
Convergence of Fourier series It is known that a periodic signal x(t) has a Fourier series representation if it satisfies the following Dirichlet conditions:
DSP First, 2/e Lecture 18 DFS: Discrete Fourier Series, and Windowing.
Lecture 19 Spectrogram: Spectral Analysis via DFT & DTFT
Wavelet Transform Advanced Digital Signal Processing Lecture 12
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
MECH 373 Instrumentation and Measurements
Image Enhancement in the
Multi-resolution analysis
UNIT II Analysis of Continuous Time signal
Interpolation and Pulse Compression
2D Fourier transform is separable
Chapter 8 The Discrete Fourier Transform
Advanced Digital Signal Processing
Wavelet transform Wavelet transform is a relatively new concept (about 10 more years old) First of all, why do we need a transform, or what is a transform.
Lecture 18 DFS: Discrete Fourier Series, and Windowing
LECTURE 18: FAST FOURIER TRANSFORM
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Lec.6:Discrete Fourier Transform and Signal Spectrum
CE Digital Signal Processing Fall Discrete Fourier Transform (DFT)
LECTURE 18: FAST FOURIER TRANSFORM
Presentation transcript:

Islamic university of Gaza Faculty of engineering Electrical engineering dept. Submitted to: Dr.Hatem Alaidy Submitted by: Ola Hajjaj Tahleel Abu seedo Short T ime F ourierT ransform

Contents History The Fourier Transform Why STFT Formula of STFT Windows definition STFT windows Resolution concept Comparisons Inverse of STFT Application for STFT Conclusion

History of 19th century, J. Fourier, reach to the formula of periodic function as an infinite sum of periodic complex exponential functions. Many years after, non-periodic functions were generalized. Then periodic & non-periodic discrete time signals were known. In 1965, (FFT) was known.

The Fourier Transform DFT: used When fs>=2fm, and the transformed signal is symmetrical. FT: decomposes a signal to complex exponential functions of different frequencies FFT: to reduce the no. of multiplications in DFT. STFT X(f)= - x(t).e -2jft dt……..(1) x(t)= - X(f). e -2jft df…...(2)

Why It gives a suitable description for the local change in frequency content because the frequency component which defined by FT have infinite time support. STFT provides a means of joint time-frequency analysis.

Continue. In STFT, the signal is divided into small enough segments. For this purpose, a window function "w" is chosen. The width of this window must be equal to the segment of the signal.

Formula of x(t) is the signal itself, w(t) is the window function, and * is the complex conjugate The STFT of the signal is the FT of the signal multiplied by a window function. STFT x (w) (,f)= t [x(t).w*(t- ).e -2jft dt……………(3) Note That: The STFT of a signal x (n) is a function of two variables: time and frequency.

Windows -real and symmetric. -Function with zero-valued outside of some chosen interval. Definition

Windows Properties Trade-off of time versus frequency resolution. Detectability of sinusoidal components. Zero phase window.

Hanning window Gaussian windows W(t) Windows of

Transforming steps in This window function is located at the beginning of the signal At (t=0). The window function will overlap with the first T/2 seconds of the original signal The window function and the signal are then multiplied. Taking the FT of the product.

The window would be shifted by t1 to a new location multiplying with the signal. Repeat from step 3 Until the end of the signal.

Window & Resolution STFT has a fixed resolution. The width of the windowing function relates to the how the signal is represented. It determines whether there is good frequency resolution or good time resolution

Narrow window Narrowband and Wideband Transforms. good time resolution, poor frequency resolution. Wide window good frequency resolution, poor time resolution.

Spectrogram

Resolution Explanation The Gaussian window function in the form: w(t)=exp(-a*(t^2)/2);

Range of freq. Separated peaks in time Case 1:

Case 2: Much better resolution Not separated peaks

Case 3: High frequency resolution Low time resolution

Inverse of

Time-Frequency Trade-off

Comparisons The signal multiplied by a window function. Transform is a function of both time and frequency There is resolution problem in the frequency domain Window is of finite length Its window is exp{jwt} function, from minus infinity to plus infinity no resolution problems in freq. domain One domain only One window

Application for

The problem of No exact time-frequency representation of a signal Resolution problem, time intervals in which certain band of frequencies exist. Wavelet transform (or multi resolution analysis) high-frequency gives good time resolution for events, and good frequency resolution for low- frequency events, which is the type of analysis best suited for many real signals. The Solution:

Conclusion STFT is a Fourier related transform & it is a Function of two variable (time & frequency). Used to determined the freq. and phase content of local section of a signal over time. It deals with two windows (hanning & Gaussian). There is a relation between window and resolution.

Thank you for listening.