CE 513: STATISTICAL METHODS

Size: px
Start display at page:

Download "CE 513: STATISTICAL METHODS"

Transcription

1 /CE 68 CE 513: STATISTICAL METHODS IN CIVIL ENGINEERING Lecture: Introduction to Fourier transforms Dr. Budhaditya Hazra Room: N-37 Department of Civil Engineering 1

2 Fourier Analysis

3 Fourier Series

4 Fourier Series: Example

5 Fourier Series: Example a = ; a n = b n = 2 T T 2 T 2 x t sin 2nπt T dt = 2 nπ (1 nπ)

6 Fourier Series: Example

7 Amplitude & Phase Spectrum x t = c n e j2πnt T n= c n = 2 T T x t e j2πnt T dt

8 MATLAB: example clc; close all; clear all % Keep hitting enter button if you want to see the term by term approx. t=[:.1:1]; x=[ ]; x_tmp=zeros(size(t)); for n=1:2:39 x_tmp=x_tmp+4/pi*(1/n*sin(2*pi*n*t)); x=[x; x_tmp]; end figure, for i=1:2 drawnow plot(t, x(i,:)) %plot(t,x(i,:),t,x(7,:),t,x(2,:)); xlabel('\itt\rm (seconds)'); ylabel('\itx\rm(\itt\rm)') grid on pause end

9 FOURIER TRANSFORM Extension of Fourier analysis to non-periodic phenomena Discrete to continuous Skipping essential steps, in the limit T p Fourier transform Inverse Fourier transform

10 Examples 1) Dirac delta 2) Symmetric exponential

11 Examples 3) Sinusoid 4) Window function

12 Examples 5) Damped symmetrically oscillating function

13 6) Damped oscillating function

14 Windowing

15 Windowing

16 Windowing: Illustration The distortion due to the main lobe is sometimes called smearing, and the distortion caused by the side lobes is called leakage.

17 COMMON WINDOW FUNCTIONS Rectangular Window Smaller main lobe Hann Window Bigger main lobe

18 COMMON WINDOW FUNCTIONS Rectangular Window Bigger side lobe Hann Window Smaller side lobe

19 Discrete Fourier Transform Consider a sequence x(n ) at n =, 1, 2, 3, 4,.., N-1 points. The DFT is defined as : Note that this is still continuous in frequency

20 Discrete Fourier Transform Now let us evaluate this at frequencies:

21 FOURIER INTEGRAL VS DFT Fourier Integral Fourier transform of the sampled sequence

22 FOURIER INTEGRAL VS DFT

23 FOURIER INTEGRAL VS DFT

24 FOURIER INTEGRAL VS DFT

25 FFT ALGORITHM: GLIMPSES The DFT provides uniformly spaced samples of the Discrete-Time Fourier Transform (DTFT) DFT definition: X[ k] N 1 n x[ n] e 2nk j N x[ n] Requires N 2 complex multiplications & N(N-1) complex additions 1 N N 1 n X[ k] e 2nk j N

26 LET S TAKE AN EXAMPLE OF FFT: A SIMPLE MATLAB CODE Consider a signal: x = A sin 2πpt p = 1. Hz T p Set a sampling frequency fs = 1 T p. Hz A = 2, p =1 Hz What does Fourier integral give? X ( f ) = A 2 at p = 1 Hz

27 FFT MATLAB EXAMPLE-1 freq = 1; % Frequency of sinusoid. freq= 1/ Tp; Tp=1/freq; fs=1*freq; % Tp is the period % Define sample time and sample frequency. Take fs = 1/Tp ts=1/fs; T1= 1*Tp; % Time point where the data is truncated to t=:ts:t1-ts; x= 2*cos(2*pi*freq*t); L=length(x); FT = fft(x); % FFT command; gives Fourier amplitude f =fs* (:(L-1))/L; % Creating the X-axis or frequency axis fabs=abs(ft); % Single sided Fourier transform

28 Modulus of X(k) DATA TRUNCATED AT EXACTLY ONE PERIOD (1-POINT FFT) Since the exact number of period is taken for DFT, all the frequency components except p = 1. Hz are zero p = 1Hz N 2, fs 2 N 1, fs fs N Frequency (Hz)

29 Modulus of X(k) DATA TRUNCATED AT 5 PERIODS (5-POINT FFT) p = 1Hz N 2, fs 2 N 1, fs fs N Frequency (Hz)

30 LEAKAGE points 7 points Modulus of X(k) Frequency (Hz)

31 FFT MATLAB EXAMPLE-2 clc; clear all; close all A=2; p=1; Tp=1/p; fs=1/tp; No_of_periods = 2; %Keep changing this parameter T1=No_of_periods*Tp; t1=[:1/fs:t1-1/fs]; x1=a*cos(2*pi*p*t1); X1=fft(x1); N1=length(x1); f1=fs*(:n1-1)/n1; figure(1) subplot(1,2,1) plot(f1, abs(x1), 'b') xlabel('frequency (Hz)') ylabel('modulus of \itx\rm(\itk\rm)'); %axis([ 9.9 1]) subplot(1,2,2) stem(f1, abs(x1), 'b') xlabel('frequency (Hz)') ylabel('modulus of \itx\rm(\itk\rm)'); %axis([ 9.9 1]

32 8/28/217 EXTRA 32

33 UNIT IMPULSE FUNCTION Suppose a function d (t) has the form d 1 2, ( t), Then, I() = 1. t otherwise We are interested d (t) acting over shorter and shorter time intervals (i.e., ). See graph on right. Note that d (t) gets taller and narrower as. Thus for t, we have lim d ( t), and lim I( ) 1

34 DIRAC DELTA FUNCTION Thus for t, we have lim d ( t) and lim I( ) 1 The unit impulse function is defined to have the properties The unit impulse function is an example of a generalized function and is usually called the Dirac delta function., ( t) for t, and ( t) dt 1 In general, for a unit impulse at an arbitrary point t, ( t t) for t t, and ( t t ) dt 1

35 LAPLACE TRANSFORM OF The Laplace Transform of is defined by and thus, ) ( lim ) ( t t t d L t t L ) cosh( lim ) sinh( lim 2 lim 2 1 lim 2 lim 2 1 lim ) ( lim ) ( st st st s s st t s t s t t st t t st st e s s s e s s e e e s e e e s s e dt e dt t t d e t t L

36 LAPLACE TRANSFORM OF Thus the Laplace Transform of is L st t t ) e, t ( For Laplace Transform of at t =, take limit as follows: st L ( t) lim L d ( t t ) lim e 1 t For example, when t = 1, we have L{(t -1)} = e -1s.

Summary of lecture 1. E x = E x =T. X T (e i!t ) which motivates us to define the energy spectrum Φ xx (!) = jx (i!)j 2 Z 1 Z =T. 2 d!

Summary of lecture 1. E x = E x =T. X T (e i!t ) which motivates us to define the energy spectrum Φ xx (!) = jx (i!)j 2 Z 1 Z =T. 2 d! Summary of lecture I Continuous time: FS X FS [n] for periodic signals, FT X (i!) for non-periodic signals. II Discrete time: DTFT X T (e i!t ) III Poisson s summation formula: describes the relationship

More information

LABORATORY 1 DISCRETE-TIME SIGNALS

LABORATORY 1 DISCRETE-TIME SIGNALS LABORATORY DISCRETE-TIME SIGNALS.. Introduction A discrete-time signal is represented as a sequence of numbers, called samples. A sample value of a typical discrete-time signal or sequence is denoted as:

More information

Digital Signal Processing: Signal Transforms

Digital Signal Processing: Signal Transforms Digital Signal Processing: Signal Transforms Aishy Amer, Mohammed Ghazal January 19, 1 Instructions: 1. This tutorial introduces frequency analysis in Matlab using the Fourier and z transforms.. More Matlab

More information

6.003: Signal Processing

6.003: Signal Processing 6.003: Signal Processing Discrete Fourier Transform Discrete Fourier Transform (DFT) Relations to Discrete-Time Fourier Transform (DTFT) Relations to Discrete-Time Fourier Series (DTFS) October 16, 2018

More information

EE482: Digital Signal Processing Applications

EE482: Digital Signal Processing Applications Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:305:45 CBC C222 Lecture 8 Frequency Analysis 14/02/18 http://www.ee.unlv.edu/~b1morris/ee482/

More information

Digital Signal Processing, Lecture 2 Frequency description continued, DFT

Digital Signal Processing, Lecture 2 Frequency description continued, DFT Outline cture 2 2 Digital Signal Processing, cture 2 Frequency description continued, DFT Thomas Schön Division of Automatic Control Department of Electrical Engineering Linköping i University it E-mail:

More information

EE482: Digital Signal Processing Applications

EE482: Digital Signal Processing Applications Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:30-15:45 CBC C222 Lecture 02 DSP Fundamentals 14/01/21 http://www.ee.unlv.edu/~b1morris/ee482/

More information

Evaluating Fourier Transforms with MATLAB

Evaluating Fourier Transforms with MATLAB ECE 460 Introduction to Communication Systems MATLAB Tutorial #2 Evaluating Fourier Transforms with MATLAB In class we study the analytic approach for determining the Fourier transform of a continuous

More information

EEO 401 Digital Signal Processing Prof. Mark Fowler

EEO 401 Digital Signal Processing Prof. Mark Fowler EEO 4 Digital Signal Processing Pro. Mark Fowler ote Set # Using the DFT or Spectral Analysis o Signals Reading Assignment: Sect. 7.4 o Proakis & Manolakis Ch. 6 o Porat s Book /9 Goal o Practical Spectral

More information

FFT Octave Codes (1B) Young Won Lim 7/6/17

FFT Octave Codes (1B) Young Won Lim 7/6/17 FFT Octave Codes (1B) Copyright (c) 2009-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any

More information

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis SEISMIC WAVE PROPAGATION Lecture 2: Fourier Analysis Fourier Series & Fourier Transforms Fourier Series Review of trigonometric identities Analysing the square wave Fourier Transform Transforms of some

More information

LAB # 5 HANDOUT. »»» The N-point DFT is converted into two DFTs each of N/2 points. N = -W N Then, the following formulas must be used. = k=0,...

LAB # 5 HANDOUT. »»» The N-point DFT is converted into two DFTs each of N/2 points. N = -W N Then, the following formulas must be used. = k=0,... EEE4 Lab Handout. FAST FOURIER TRANSFORM LAB # 5 HANDOUT Data Sequence A = x, x, x, x3, x4, x5, x6, x7»»» The N-point DFT is converted into two DFTs each of N/ points. x, x, x4, x6 x, x3, x5, x7»»» N =e

More information

DFT Octave Codes (0B) Young Won Lim 4/15/17

DFT Octave Codes (0B) Young Won Lim 4/15/17 Copyright (c) 2009-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published

More information

Laplace Transforms and use in Automatic Control

Laplace Transforms and use in Automatic Control Laplace Transforms and use in Automatic Control P.S. Gandhi Mechanical Engineering IIT Bombay Acknowledgements: P.Santosh Krishna, SYSCON Recap Fourier series Fourier transform: aperiodic Convolution integral

More information

EP375 Computational Physics

EP375 Computational Physics EP375 Computational Physics opic 11 FOURIER RANSFORM Department of Engineering Physics University of Gaziantep Apr 2014 Sayfa 1 Content 1. Introduction 2. Continues Fourier rans. 3. DF in MALAB and C++

More information

University of Connecticut Lecture Notes for ME5507 Fall 2014 Engineering Analysis I Part III: Fourier Analysis

University of Connecticut Lecture Notes for ME5507 Fall 2014 Engineering Analysis I Part III: Fourier Analysis University of Connecticut Lecture Notes for ME557 Fall 24 Engineering Analysis I Part III: Fourier Analysis Xu Chen Assistant Professor United Technologies Engineering Build, Rm. 382 Department of Mechanical

More information

Fourier Analysis of Signals Using the DFT

Fourier Analysis of Signals Using the DFT Fourier Analysis of Signals Using the DFT ECE 535 Lecture April 29, 23 Overview: Motivation Many applications require analyzing the frequency content of signals Speech processing study resonances of vocal

More information

Experimental Fourier Transforms

Experimental Fourier Transforms Chapter 5 Experimental Fourier Transforms 5.1 Sampling and Aliasing Given x(t), we observe only sampled data x s (t) = x(t)s(t; T s ) (Fig. 5.1), where s is called sampling or comb function and can be

More information

FFT, total energy, and energy spectral density computations in MATLAB Aaron Scher

FFT, total energy, and energy spectral density computations in MATLAB Aaron Scher FFT, total energy, and energy spectral density computations in MATLAB Aaron Scher Everything presented here is specifically focused on non-periodic signals with finite energy (also called energy signals

More information

Continuous Time Signal Analysis: the Fourier Transform. Lathi Chapter 4

Continuous Time Signal Analysis: the Fourier Transform. Lathi Chapter 4 Continuous Time Signal Analysis: the Fourier Transform Lathi Chapter 4 Topics Aperiodic signal representation by the Fourier integral (CTFT) Continuous-time Fourier transform Transforms of some useful

More information

Multimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2

Multimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2 Multimedia Signals and Systems - Audio and Video Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2 Kunio Takaya Electrical and Computer Engineering University of Saskatchewan December

More information

The Discrete Fourier Transform. Signal Processing PSYCH 711/712 Lecture 3

The Discrete Fourier Transform. Signal Processing PSYCH 711/712 Lecture 3 The Discrete Fourier Transform Signal Processing PSYCH 711/712 Lecture 3 DFT Properties symmetry linearity shifting scaling Symmetry x(n) -1.0-0.5 0.0 0.5 1.0 X(m) -10-5 0 5 10 0 5 10 15 0 5 10 15 n m

More information

Correlation, discrete Fourier transforms and the power spectral density

Correlation, discrete Fourier transforms and the power spectral density Correlation, discrete Fourier transforms and the power spectral density visuals to accompany lectures, notes and m-files by Tak Igusa tigusa@jhu.edu Department of Civil Engineering Johns Hopkins University

More information

In this Lecture. Frequency domain analysis

In this Lecture. Frequency domain analysis In this Lecture Frequency domain analysis Introduction In most cases we want to know the frequency content of our signal Why? Most popular analysis in frequency domain is based on work of Joseph Fourier

More information

Digital Signal Processing Module 6 Discrete Fourier Transform (DFT)

Digital Signal Processing Module 6 Discrete Fourier Transform (DFT) Objective: Digital Signal Processing Module 6 Discrete Fourier Transform (DFT) 1. To analyze finite duration sequences using Discrete Fourier Transform. 2. To understand the characteristics and importance

More information

The (Fast) Fourier Transform

The (Fast) Fourier Transform The (Fast) Fourier Transform The Fourier transform (FT) is the analog, for non-periodic functions, of the Fourier series for periodic functions can be considered as a Fourier series in the limit that the

More information

April 24, 2012 (Tue) Lecture 19: Impulse Function and its Laplace Transform ( 6.5)

April 24, 2012 (Tue) Lecture 19: Impulse Function and its Laplace Transform ( 6.5) Lecture 19: Impulse Function and its Laplace Transform ( 6.5) April 24, 2012 (Tue) Impulse Phenomena of an impulsive nature, such as the action of very large forces (or voltages) over very short intervals

More information

Signal Processing Signal and System Classifications. Chapter 13

Signal Processing Signal and System Classifications. Chapter 13 Chapter 3 Signal Processing 3.. Signal and System Classifications In general, electrical signals can represent either current or voltage, and may be classified into two main categories: energy signals

More information

L6: Short-time Fourier analysis and synthesis

L6: Short-time Fourier analysis and synthesis L6: Short-time Fourier analysis and synthesis Overview Analysis: Fourier-transform view Analysis: filtering view Synthesis: filter bank summation (FBS) method Synthesis: overlap-add (OLA) method STFT magnitude

More information

Discrete Time Fourier Transform (DTFT) Digital Signal Processing, 2011 Robi Polikar, Rowan University

Discrete Time Fourier Transform (DTFT) Digital Signal Processing, 2011 Robi Polikar, Rowan University Discrete Time Fourier Transform (DTFT) Digital Signal Processing, 2 Robi Polikar, Rowan University Sinusoids & Exponentials Signals Phasors Frequency Impulse, step, rectangular Characterization Power /

More information

0 for all other times. Suppose further that we sample the signal with a sampling frequency f ;. We can write x # n =

0 for all other times. Suppose further that we sample the signal with a sampling frequency f ;. We can write x # n = PSD, Autocorrelation, and Noise in MATLAB Aaron Scher Energy and power of a signal Consider a continuous time deterministic signal x t. We are specifically interested in analyzing the characteristics of

More information

EA2.3 - Electronics 2 1

EA2.3 - Electronics 2 1 In the previous lecture, I talked about the idea of complex frequency s, where s = σ + jω. Using such concept of complex frequency allows us to analyse signals and systems with better generality. In this

More information

EE 311 February 22, 2019 Lecture 13

EE 311 February 22, 2019 Lecture 13 EE 311 February, 019 Lecture 13 Minimum Phase FIR filters Geometric Interpretation of P/Z locations Minimum Phase System - A system is said to be a minimum phase system if the deviation from zero in the

More information

Signals, Instruments, and Systems W5. Introduction to Signal Processing Sampling, Reconstruction, and Filters

Signals, Instruments, and Systems W5. Introduction to Signal Processing Sampling, Reconstruction, and Filters Signals, Instruments, and Systems W5 Introduction to Signal Processing Sampling, Reconstruction, and Filters Acknowledgments Recapitulation of Key Concepts from the Last Lecture Dirac delta function (

More information

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fourier Series & Transform Summary x[n] = X[k] = 1 N k= n= X[k]e jkω

More information

Laplace Transforms Chapter 3

Laplace Transforms Chapter 3 Laplace Transforms Important analytical method for solving linear ordinary differential equations. - Application to nonlinear ODEs? Must linearize first. Laplace transforms play a key role in important

More information

Radar Systems Engineering Lecture 3 Review of Signals, Systems and Digital Signal Processing

Radar Systems Engineering Lecture 3 Review of Signals, Systems and Digital Signal Processing Radar Systems Engineering Lecture Review of Signals, Systems and Digital Signal Processing Dr. Robert M. O Donnell Guest Lecturer Radar Systems Course Review Signals, Systems & DSP // Block Diagram of

More information

7.16 Discrete Fourier Transform

7.16 Discrete Fourier Transform 38 Signals, Systems, Transforms and Digital Signal Processing with MATLAB i.e. F ( e jω) = F [f[n]] is periodic with period 2π and its base period is given by Example 7.17 Let x[n] = 1. We have Π B (Ω)

More information

BME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY

BME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY 1 Lucas Parra, CCNY BME 50500: Image and Signal Processing in Biomedicine Lecture 2: Discrete Fourier Transform Lucas C. Parra Biomedical Engineering Department CCNY http://bme.ccny.cuny.edu/faculty/parra/teaching/signal-and-image/

More information

HW13 Solutions. Pr (a) The DTFT of c[n] is. C(e jω ) = 0.5 m e jωm e jω + 1

HW13 Solutions. Pr (a) The DTFT of c[n] is. C(e jω ) = 0.5 m e jωm e jω + 1 HW3 Solutions Pr..8 (a) The DTFT of c[n] is C(e jω ) = = =.5 n e jωn + n=.5e jω + n= m=.5 n e jωn.5 m e jωm.5e jω +.5e jω.75 =.5 cos(ω) }{{}.5e jω /(.5e jω ) C(e jω ) is the power spectral density. (b)

More information

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding J. McNames Portland State University ECE 223 FFT Ver. 1.03 1 Fourier Series

More information

System Modeling and Identification CHBE 702 Korea University Prof. Dae Ryook Yang

System Modeling and Identification CHBE 702 Korea University Prof. Dae Ryook Yang System Modeling and Identification CHBE 702 Korea University Prof. Dae Ryook Yang 1-1 Course Description Emphases Delivering concepts and Practice Programming Identification Methods using Matlab Class

More information

Lecture 5. The Digital Fourier Transform. (Based, in part, on The Scientist and Engineer's Guide to Digital Signal Processing by Steven Smith)

Lecture 5. The Digital Fourier Transform. (Based, in part, on The Scientist and Engineer's Guide to Digital Signal Processing by Steven Smith) Lecture 5 The Digital Fourier Transform (Based, in part, on The Scientist and Engineer's Guide to Digital Signal Processing by Steven Smith) 1 -. 8 -. 6 -. 4 -. 2-1 -. 8 -. 6 -. 4 -. 2 -. 2. 4. 6. 8 1

More information

Central to this is two linear transformations: the Fourier Transform and the Laplace Transform. Both will be considered in later lectures.

Central to this is two linear transformations: the Fourier Transform and the Laplace Transform. Both will be considered in later lectures. In this second lecture, I will be considering signals from the frequency perspective. This is a complementary view of signals, that in the frequency domain, and is fundamental to the subject of signal

More information

Dr. Ian R. Manchester

Dr. Ian R. Manchester Dr Ian R. Manchester Week Content Notes 1 Introduction 2 Frequency Domain Modelling 3 Transient Performance and the s-plane 4 Block Diagrams 5 Feedback System Characteristics Assign 1 Due 6 Root Locus

More information

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2)

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2) E.5 Signals & Linear Systems Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & ) 1. Sketch each of the following continuous-time signals, specify if the signal is periodic/non-periodic,

More information

Exercises in Digital Signal Processing

Exercises in Digital Signal Processing Exercises in Digital Signal Processing Ivan W. Selesnick September, 5 Contents The Discrete Fourier Transform The Fast Fourier Transform 8 3 Filters and Review 4 Linear-Phase FIR Digital Filters 5 5 Windows

More information

3.2 Complex Sinusoids and Frequency Response of LTI Systems

3.2 Complex Sinusoids and Frequency Response of LTI Systems 3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n]. LTI system: LTI System Output = A weighted superposition of the system response to each complex

More information

Information and Communications Security: Encryption and Information Hiding

Information and Communications Security: Encryption and Information Hiding Short Course on Information and Communications Security: Encryption and Information Hiding Tuesday, 10 March Friday, 13 March, 2015 Lecture 5: Signal Analysis Contents The complex exponential The complex

More information

ELEG 305: Digital Signal Processing

ELEG 305: Digital Signal Processing ELEG 5: Digital Signal Processing Lecture 6: The Fast Fourier Transform; Radix Decimatation in Time Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 8 K.

More information

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University ENSC327 Communications Systems 2: Fourier Representations Jie Liang School of Engineering Science Simon Fraser University 1 Outline Chap 2.1 2.5: Signal Classifications Fourier Transform Dirac Delta Function

More information

Chirp Transform for FFT

Chirp Transform for FFT Chirp Transform for FFT Since the FFT is an implementation of the DFT, it provides a frequency resolution of 2π/N, where N is the length of the input sequence. If this resolution is not sufficient in a

More information

Signals and Systems Laboratory with MATLAB

Signals and Systems Laboratory with MATLAB Signals and Systems Laboratory with MATLAB Alex Palamides Anastasia Veloni @ CRC Press Taylor &. Francis Group Boca Raton London NewYork CRC Press is an imprint of the Taylor & Francis Group, an informa

More information

Homework 6. April 11, H(s) = Y (s) X(s) = s 1. s 2 + 3s + 2

Homework 6. April 11, H(s) = Y (s) X(s) = s 1. s 2 + 3s + 2 Homework 6 April, 6 Problem Steady state of LTI systems The transfer function of an LTI system is H(s) = Y (s) X(s) = s s + 3s + If the input to this system is x(t) = + cos(t + π/4), < t

More information

EE123 Digital Signal Processing

EE123 Digital Signal Processing EE123 Digital Signal Processing Lecture 1 Time-Dependent FT Announcements! Midterm: 2/22/216 Open everything... but cheat sheet recommended instead 1am-12pm How s the lab going? Frequency Analysis with

More information

Discrete-Time Fourier Transform

Discrete-Time Fourier Transform Discrete-Time Fourier Transform Chapter Intended Learning Outcomes: (i) (ii) (iii) Represent discrete-time signals using discrete-time Fourier transform Understand the properties of discrete-time Fourier

More information

Introduction to Signal Analysis Parts I and II

Introduction to Signal Analysis Parts I and II 41614 Dynamics of Machinery 23/03/2005 IFS Introduction to Signal Analysis Parts I and II Contents 1 Topics of the Lecture 11/03/2005 (Part I) 2 2 Fourier Analysis Fourier Series, Integral and Complex

More information

The Z-Transform. For a phasor: X(k) = e jωk. We have previously derived: Y = H(z)X

The Z-Transform. For a phasor: X(k) = e jωk. We have previously derived: Y = H(z)X The Z-Transform For a phasor: X(k) = e jωk We have previously derived: Y = H(z)X That is, the output of the filter (Y(k)) is derived by multiplying the input signal (X(k)) by the transfer function (H(z)).

More information

The Fourier Transform (and more )

The Fourier Transform (and more ) The Fourier Transform (and more ) imrod Peleg ov. 5 Outline Introduce Fourier series and transforms Introduce Discrete Time Fourier Transforms, (DTFT) Introduce Discrete Fourier Transforms (DFT) Consider

More information

UNIVERSITI MALAYSIA PERLIS

UNIVERSITI MALAYSIA PERLIS UNIVERSITI MALAYSIA PERLIS SCHOOL OF COMPUTER & COMMUNICATIONS ENGINEERING EKT 230 SIGNALS AND SYSTEMS LABORATORY MODULE LAB 5 : LAPLACE TRANSFORM & Z-TRANSFORM 1 LABORATORY OUTCOME Ability to describe

More information

THE FOURIER TRANSFORM (Fourier series for a function whose period is very, very long) Reading: Main 11.3

THE FOURIER TRANSFORM (Fourier series for a function whose period is very, very long) Reading: Main 11.3 THE FOURIER TRANSFORM (Fourier series for a function whose period is very, very long) Reading: Main 11.3 Any periodic function f(t) can be written as a Fourier Series a 0 2 + a n cos( nωt) + b n sin n

More information

6.003 Signal Processing

6.003 Signal Processing 6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal

More information

6.003 Signal Processing

6.003 Signal Processing 6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal

More information

Lecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.

Lecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. Lecture 10 Digital Signal Processing Chapter 7 Discrete Fourier transform DFT Mikael Swartling Nedelko Grbic Bengt Mandersson rev. 016 Department of Electrical and Information Technology Lund University

More information

Vibration Testing. an excitation source a device to measure the response a digital signal processor to analyze the system response

Vibration Testing. an excitation source a device to measure the response a digital signal processor to analyze the system response Vibration Testing For vibration testing, you need an excitation source a device to measure the response a digital signal processor to analyze the system response i) Excitation sources Typically either

More information

Continuous Fourier transform of a Gaussian Function

Continuous Fourier transform of a Gaussian Function Continuous Fourier transform of a Gaussian Function Gaussian function: e t2 /(2σ 2 ) The CFT of a Gaussian function is also a Gaussian function (i.e., time domain is Gaussian, then the frequency domain

More information

Chapter 6: Applications of Fourier Representation Houshou Chen

Chapter 6: Applications of Fourier Representation Houshou Chen Chapter 6: Applications of Fourier Representation Houshou Chen Dept. of Electrical Engineering, National Chung Hsing University E-mail: houshou@ee.nchu.edu.tw H.S. Chen Chapter6: Applications of Fourier

More information

ECG782: Multidimensional Digital Signal Processing

ECG782: Multidimensional Digital Signal Processing Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Spring 2014 TTh 14:30-15:45 CBC C313 Lecture 05 Image Processing Basics 13/02/04 http://www.ee.unlv.edu/~b1morris/ecg782/

More information

Ch.11 The Discrete-Time Fourier Transform (DTFT)

Ch.11 The Discrete-Time Fourier Transform (DTFT) EE2S11 Signals and Systems, part 2 Ch.11 The Discrete-Time Fourier Transform (DTFT Contents definition of the DTFT relation to the -transform, region of convergence, stability frequency plots convolution

More information

Digital Signal Processing Chapter 10. Fourier Analysis of Discrete- Time Signals and Systems CHI. CES Engineering. Prof. Yasser Mostafa Kadah

Digital Signal Processing Chapter 10. Fourier Analysis of Discrete- Time Signals and Systems CHI. CES Engineering. Prof. Yasser Mostafa Kadah Digital Signal Processing Chapter 10 Fourier Analysis of Discrete- Time Signals and Systems Prof. Yasser Mostafa Kadah CHI CES Engineering Discrete-Time Fourier Transform Sampled time domain signal has

More information

Contents. Digital Signal Processing, Part II: Power Spectrum Estimation

Contents. Digital Signal Processing, Part II: Power Spectrum Estimation Contents Digital Signal Processing, Part II: Power Spectrum Estimation 5. Application of the FFT for 7. Parametric Spectrum Est. Filtering and Spectrum Estimation 7.1 ARMA-Models 5.1 Fast Convolution 7.2

More information

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science : Discrete-Time Signal Processing

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science : Discrete-Time Signal Processing Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.34: Discrete-Time Signal Processing OpenCourseWare 006 ecture 8 Periodogram Reading: Sections 0.6 and 0.7

More information

Chapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum

Chapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum Chapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum CEN352, DR. Nassim Ammour, King Saud University 1 Fourier Transform History Born 21 March 1768 ( Auxerre ). Died 16 May 1830 ( Paris ) French

More information

SIGNALS CONTINUOUS/DISCRETE TIME/FREQUENCY DOMAINS

SIGNALS CONTINUOUS/DISCRETE TIME/FREQUENCY DOMAINS SIGNALS CONTINUOUS/DISCRETE TIME/FREQUENCY DOMAINS Continuous-Time Signals Signals in the real world Frequency content (spectrum) for finite-time signals theoretically extends to infinity Ref: Discrete-Time

More information

EEL3135: Homework #3 Solutions

EEL3135: Homework #3 Solutions EEL335: Homework #3 Solutions Problem : (a) Compute the CTFT for the following signal: xt () cos( πt) cos( 3t) + cos( 4πt). First, we use the trigonometric identity (easy to show by using the inverse Euler

More information

LAB 2: DTFT, DFT, and DFT Spectral Analysis Summer 2011

LAB 2: DTFT, DFT, and DFT Spectral Analysis Summer 2011 University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 2: DTFT, DFT, and DFT Spectral

More information

A Note on Upsampling by Integer Factors Using the DFT

A Note on Upsampling by Integer Factors Using the DFT A Note on Upsampling by Integer Factors Using the FT Mark Richards February 24, 202 Let x[n] be a sequence of length N with discrete-time Fourier transform (TFT) X(). Let x [n] be a decimated sequence

More information

Solving a RLC Circuit using Convolution with DERIVE for Windows

Solving a RLC Circuit using Convolution with DERIVE for Windows Solving a RLC Circuit using Convolution with DERIVE for Windows Michel Beaudin École de technologie supérieure, rue Notre-Dame Ouest Montréal (Québec) Canada, H3C K3 mbeaudin@seg.etsmtl.ca - Introduction

More information

Review: Continuous Fourier Transform

Review: Continuous Fourier Transform Review: Continuous Fourier Transform Review: convolution x t h t = x τ h(t τ)dτ Convolution in time domain Derivation Convolution Property Interchange the order of integrals Let Convolution Property By

More information

SNR Calculation and Spectral Estimation [S&T Appendix A]

SNR Calculation and Spectral Estimation [S&T Appendix A] SR Calculation and Spectral Estimation [S&T Appendix A] or, How not to make a mess of an FFT Make sure the input is located in an FFT bin 1 Window the data! A Hann window works well. Compute the FFT 3

More information

!Sketch f(t) over one period. Show that the Fourier Series for f(t) is as given below. What is θ 1?

!Sketch f(t) over one period. Show that the Fourier Series for f(t) is as given below. What is θ 1? Second Year Engineering Mathematics Laboratory Michaelmas Term 998 -M L G Oldfield 30 September, 999 Exercise : Fourier Series & Transforms Revision 4 Answer all parts of Section A and B which are marked

More information

Aspects of Continuous- and Discrete-Time Signals and Systems

Aspects of Continuous- and Discrete-Time Signals and Systems Aspects of Continuous- and Discrete-Time Signals and Systems C.S. Ramalingam Department of Electrical Engineering IIT Madras C.S. Ramalingam (EE Dept., IIT Madras) Networks and Systems 1 / 45 Scaling the

More information

Laplace Transforms. Chapter 3. Pierre Simon Laplace Born: 23 March 1749 in Beaumont-en-Auge, Normandy, France Died: 5 March 1827 in Paris, France

Laplace Transforms. Chapter 3. Pierre Simon Laplace Born: 23 March 1749 in Beaumont-en-Auge, Normandy, France Died: 5 March 1827 in Paris, France Pierre Simon Laplace Born: 23 March 1749 in Beaumont-en-Auge, Normandy, France Died: 5 March 1827 in Paris, France Laplace Transforms Dr. M. A. A. Shoukat Choudhury 1 Laplace Transforms Important analytical

More information

DOING PHYSICS WITH MATLAB FOURIER ANALYSIS FOURIER TRANSFORMS

DOING PHYSICS WITH MATLAB FOURIER ANALYSIS FOURIER TRANSFORMS DOING PHYSICS WITH MATLAB FOURIER ANALYSIS FOURIER TRANSFORMS Ian Cooper School of Physics, University of Sydney ian.cooper@sydney.edu.au DOWNLOAD DIRECTORY FOR MATLAB SCRIPTS maths_ft_01.m mscript used

More information

Solutions - Homework # 3

Solutions - Homework # 3 ECE-34: Signals and Systems Summer 23 PROBLEM One period of the DTFS coefficients is given by: X[] = (/3) 2, 8. Solutions - Homewor # 3 a) What is the fundamental period 'N' of the time-domain signal x[n]?

More information

Discrete Time Fourier Transform (DTFT)

Discrete Time Fourier Transform (DTFT) Discrete Time Fourier Transform (DTFT) 1 Discrete Time Fourier Transform (DTFT) The DTFT is the Fourier transform of choice for analyzing infinite-length signals and systems Useful for conceptual, pencil-and-paper

More information

Continuous and Discrete Time Signals and Systems

Continuous and Discrete Time Signals and Systems Continuous and Discrete Time Signals and Systems Mrinal Mandal University of Alberta, Edmonton, Canada and Amir Asif York University, Toronto, Canada CAMBRIDGE UNIVERSITY PRESS Contents Preface Parti Introduction

More information

/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by

/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by Code No: RR320402 Set No. 1 III B.Tech II Semester Regular Examinations, Apr/May 2006 DIGITAL SIGNAL PROCESSING ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering,

More information

Lecture 3 - Design of Digital Filters

Lecture 3 - Design of Digital Filters Lecture 3 - Design of Digital Filters 3.1 Simple filters In the previous lecture we considered the polynomial fit as a case example of designing a smoothing filter. The approximation to an ideal LPF can

More information

Fourier analysis of discrete-time signals. (Lathi Chapt. 10 and these slides)

Fourier analysis of discrete-time signals. (Lathi Chapt. 10 and these slides) Fourier analysis of discrete-time signals (Lathi Chapt. 10 and these slides) Towards the discrete-time Fourier transform How we will get there? Periodic discrete-time signal representation by Discrete-time

More information

Centre for Mathematical Sciences HT 2017 Mathematical Statistics

Centre for Mathematical Sciences HT 2017 Mathematical Statistics Lund University Stationary stochastic processes Centre for Mathematical Sciences HT 2017 Mathematical Statistics Computer exercise 3 in Stationary stochastic processes, HT 17. The purpose of this exercise

More information

EE 505 Lecture 10. Spectral Characterization. Part 2 of 2

EE 505 Lecture 10. Spectral Characterization. Part 2 of 2 EE 505 Lecture 10 Spectral Characterization Part 2 of 2 Review from last lecture Spectral Analysis If f(t) is periodic f(t) alternately f(t) = = A A ( kω t + ) 0 + Aksin θk k= 1 0 + a ksin t k= 1 k= 1

More information

E : Lecture 1 Introduction

E : Lecture 1 Introduction E85.2607: Lecture 1 Introduction 1 Administrivia 2 DSP review 3 Fun with Matlab E85.2607: Lecture 1 Introduction 2010-01-21 1 / 24 Course overview Advanced Digital Signal Theory Design, analysis, and implementation

More information

From Fourier Series to Analysis of Non-stationary Signals - X

From Fourier Series to Analysis of Non-stationary Signals - X From Fourier Series to Analysis of Non-stationary Signals - X prof. Miroslav Vlcek December 14, 21 Contents Stationary and non-stationary 1 Stationary and non-stationary 2 3 Contents Stationary and non-stationary

More information

LAB 6: FIR Filter Design Summer 2011

LAB 6: FIR Filter Design Summer 2011 University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 6: FIR Filter Design Summer 011

More information

Digital Signal Processing Lab 3: Discrete Fourier Transform

Digital Signal Processing Lab 3: Discrete Fourier Transform Digital Signal Processing Lab 3: Discrete Fourier Transform Discrete Time Fourier Transform (DTFT) The discrete-time Fourier transform (DTFT) of a sequence x[n] is given by (3.1) which is a continuous

More information

Section 6.5 Impulse Functions

Section 6.5 Impulse Functions Section 6.5 Impulse Functions Key terms/ideas: Unit impulse function (technically a generalized function or distribution ) Dirac delta function Laplace transform of the Dirac delta function IVPs with forcing

More information