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

Size: px
Start display at page:

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

Transcription

1 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 ) Part 1 THEORY Instantaneous power of continuous-time signals: Let x t be a real (ie no imaginary part) signal If x t represents voltage across a 1 W resistor, then the instantaneous power dissipated by Ohmic losses in the resistor is: p t = % & ' ( = x t ) (Instantaneous power in [W]=[J/s]) (1) Total energy of continuous-time signals: The total energy dissipated across the resistor is the time-integral of the instantaneous power: E, = p t dt = x t ) dt (Total signal energy in [J]) (2) A signal with a finite energy E, (ie E, < ) is called an energy signal We are focusing solely on energy signals here Continuous time Fourier transform (CTFT) pair: Recall the CTFT: X f = x t e /5)67& dt (3) Energy of continuous-time signals computed in frequency domain It can be shown using Parseval s theorem that the total energy can also be computed in the frequency domain: E, = X f ) df (Total signal energy in [J] computed in frequency domain) (4) Compare equation (4) with (2) These are two ways equations to compute the total energy E Energy spectral density Looking at Equation (5), we see that we can define an energy spectral density (ESD) given by: Ψ, f = X f ) (Energy spectral density in [J/Hz]) (5) 1

2 Part 2 MATLAB Our goal in this section is to use MATLAB to plot the amplitude spectrum, energy spectral density, and numerically estimate the total energy Eg First, let s sample! How do we sample a signal x t in MATLAB? For ease, let s work specifically on an example (you can easily generalize what is presented here to other signals) Suppose our signal is a small piece of sinusoid with frequency f ; described by the function: x t = 0 t < 1 sin 2πf ; t, 1 t 1 0, t > 1 (6) where the units for time are in seconds Given f ; we need to choose a sampling frequency f G that is sufficiently high (should be higher than Nyquist rate to avoid aliasing ) For this example, let us choose f ; = 2 Hz and a sampling frequency f G = 20 Hz The MATLAB code looks like this: 1 - f0=2; %center frequency [Hz] 2 - fs=20; %sample rate [Hz] 3 - Ts=1/fs; %sample period [s] 4 - Tbegin=-1; %Our signal is nonzero over the time interval [Tbegin Tend] 5 - Tend=1; 6 - t=[tbegin:ts:tend]; %define array with sampling times 7 - x=sin(2*pi*f0*t); %define discrete-time function This is x[n] Mathematically, our discrete-time function x[n] (defined in line 7 of code above) is equal to the continuous-function x t (ignoring quantization error) at discrete points in time Hence, we may write: where t M are the sampling times defined in line 6 of code above: x[n] = x t M (7) t M = T OPQRS + n 1 T G, n = 1 N ; (8) where T G = 1 f G is the sampling period, N ; is the final index of x[n], ie N ; =length(x), and T OPQRS is the initial time where the finite-energy signal x(t) is nonzero (eg for the signal given by equation (6), T OPQRS = 1 seconds) In MATLAB, the indices n always start at 1 and are positive This can cause confusion, since in other programming languages indices commonly start at 0 So, in MATLAB, x[0] would give an error You must start with an index of 1; x[1] would be fine 2

3 If we are interested in evaluating x t M at some specific time, say at t = 0, we can figure out the index n that corresponds to t = 0, and plug it in to our expression for x However, the easier way is to simply plot our function x and look at the value of this function at t = 0, as done below 8 - figure(1) 9 - plot(t,x) 10 - grid on 11 - xlabel('time (seconds)','fontsize',14) 12 - ylabel('amplitude','fontsize',14) Amplitude Time (seconds) Figure 1 Plot of x n = x t M Discrete points are connected by straight lines and the x-axis is labeled as time in seconds This gives the illusion that this is a plot of a true continuous time signal x t It s actually a plot of a discrete time signal From the plot above, it is clear that the function x(t) = 0 at t = 0 If we weren t in the mood to plot, we could also find the index value that corresponds to t = 0, and plug that directly into x to find the value of x at t = 0, as shown in the code below: 13 - index = find(t==0,1) %find index n corresponding to t=0this returns x(index) %This returns 0, as expected Total energy approximation We can numerically estimate the total energy by approximating equation (2) with a Riemann sum: ^_ E g T G x[n] ) n=1 (Estimate total signal energy in [J]) (9) 3

4 MATLAB s FFT function Matlab s fft function is an efficient algorithm for computing the discrete Fourier transform (DFT) of a function To find the double-sided spectrum you need to use the fftshift function Equation (3) shows how to manually compute the continuous time Fourier transform (CTFT) X f of a continuous time function x t Instead of using an integral, we can use MATLAB to numerically compute the CFT at discrete frequency points f` as follows: X f` = a 7 b fftshift(fft(x,n)) (10) where N is the number of frequency points in the FFT, and f` are discrete frequency points: f` = 7 b + n 1 7 b, n = 1 N (11) ) ^/a Recall that N ; = length(x) is the number of discrete time points of the original signal x[n] In general N ; N, and you are free to choose N as large as you want (so long as your computer can handle it) In fact, you will generally set N>>N 0 A good value for N is N=2 16 The code below demonstrates how to calculate and plot the FFT 15 - N=2^16; %good general value for FFT (this is the number of discrete 16 - points in the FFT) 17 - y=fft(x,n); %compute FFT! There is a lot going on "behind the scenes" 18 - with this one line of code 19 - z=fftshift(y); %Move the zero-frequency component to the center of the 20 - %array This is used for finding the double-sided spectrum (as opposed 21 - to the single-sided spectrum) 22 - f_vec=[0:1:n-1]*fs/n-fs/2; %Create frequency vector (this is an array 23 - of numbers Each number corresponds to a discrete point in frequency 24 - in which we shall evaluate and plot the function) 25 - amplitude_spectrum=abs(z)/fs %Extract the amplitude of the 26 - spectrum Here we also apply a scaling factor of 1/fs so that 27 - the amplitude of the FFT at a frequency component equals that of the 28 - CFT and to preserve Parseval s theorem 29 - figure(2) 30 - plot(f_vec,amplitude_spectrum); 31 - set(gca,'fontsize',18) %set font size of axis tick labels to xlabel('frequency [Hz]','fontsize',18) 33 - ylabel('amplitude','fontsize',18) 34 - title('amplitude spectra','fontsize',18) 35 - grid on 36 - set(gcf,'color','w');%set background color from grey(default) to white 37 - axis tight 4

5 1 Amplitude spectra 08 Amplitude Frequency [Hz] Figure 2 Once you have computed X f` using equation (10), you can then numerically compute and plot the energy spectral density (ESD): Ψ, [f`]= X f` ) (Energy spectral density in [J/Hz]) (12) The total energy can then be found by approximating equation (4) with a Riemann sum: E g 7 b ^ ^ ) X n=1 f` (Total signal energy in [J] computed in frequency domain) (13) The code below demonstrates how to calculate and plot the energy spectral density 38 - figure(3) 39 - plot(f_vec,abs(amplitude_spectrum)^2); 40 - xlabel('frequency [Hz]','fontsize',18) 41 - ylabel('energy/hz','fontsize',18) 42 - title('energy spectral density','fontsize',18) 43 - grid on 44 - set(gcf,'color','w'); %set background color to white 45 - axis tight 1 Energy spectral density Energy/Hz Frequency [Hz] Figure 3 5

6 We can now numerically calculate the total energy using either equation (9) or (13): %calculate total energy 46 - Eg=sum(x^2)*Ts %using discrete time function x[n] 47 - Eg=sum(amplitude_spectrum^2)*fs/N %using ESD MATLAB returns Eg = 1000 for both methods The units of energy are Joules [J] The full MATLAB code for the above example is pasted below Simply save this code in an m- file and run the m-file clc; clear all; f0=2; %center frequency [Hz] fs=20; %sample rate [Hz] Ts=1/fs; %sample period [s] Tbegin=-1; %Our signal is nonzero over the time interval [Tbegin Tend] Tend=+1; t=[tbegin:ts:tend]; %define array with discrete sampling times x=sin(2*pi*f0*t); %define discrete-time function This is x[n] figure(1) plot(t,x) grid on xlabel('time (seconds)','fontsize',14) ylabel('amplitude','fontsize',14) N=2^16; %good general value for FFT (this is the number of discrete points in the FFT) y=fft(x,n); %compute FFT! There is a lot going on "behind the scenes" with %this one line of code z=fftshift(y); %Move the zero-frequency component to the center of the %array This is used for finding the double-sided spectrum (as opposed to %the single-sided spectrum) f_vec=[0:1:n-1]*fs/n-fs/2; %Create frequency vector (this is an array of %numbers Each number corresponds to a discrete point in frequency in which we %shall evaluate and plot the function) amplitude_spectrum=abs(z)/fs; %Extract the amplitude of the spectrum %Here we also apply a scaling factor of 1/fs, so that the amplitude %of the FFT at a frequency component equals that of the the CFT and to %preserve Parseval's theorem amplitude_spectrum=abs(z)*ts; figure(2) plot(f_vec,amplitude_spectrum); set(gca,'fontsize',18) %set font size of axis tick labels to 18 xlabel('frequency [Hz]','fontsize',18) ylabel('amplitude','fontsize',18) title('amplitude spectra','fontsize',18) grid on set(gcf,'color','w'); %set background color from grey (default) to white axis tight figure(3) plot(f_vec,abs(amplitude_spectrum)^2); xlabel('frequency [Hz]','fontsize',18) ylabel('energy/hz','fontsize',18) title('energy spectral density','fontsize',18) grid on set(gcf,'color','w'); %set background color from grey (default) to white axis tight %calculate total energy Eg=sum(x^2)*Ts %using discrete time function x[n] Eg=sum(amplitude_spectrum^2)*fs/N %Using ESD 6

7 Part 3 One last thing Autocorrelation Method Believe it or not, there is a second way to calculate the energy spectral density (ESD), Ψ, t Equation (5) presents one method for calculating Ψ, But folks, in life we have choices Let s examine the second method First, the time autocorrelation function is defined as: ψ, τ = x t x t + τ dt (Autocorrelation function) (14) It can be proved that the Fourier transform of the autocorrelation function is equal to the ESD, Ψ, t, ie F ψ, τ = Ψ, f = X f ) (FT of autocorrelation function is ESD) (15) In MATLAB, we can numerically compute the autocorrelation function presented in equation (14) using the xcorr function : ψ, τ M = a 7 b xcorr(x,x) (16) We can then find the ESD by taking the FFT of ψ, τ M The MATAB code below shows how to compute ESD using the autocorrelation method Figure 4 shows a spectral plot of the ESD Compare Figure 4 with Figure 3 they are identical which demonstrates the two different methods for yield identical results for the ESD %This code continues from the previous code (ie, x, Ts, fs, f_vec and %N are already defined) %Below I demonstrate an alternative method to plot EST This method %uses autocorrelation cor=ts*xcorr(x,x); %numerically compute autocorrelation %cor=ts*conv(flipud(x),x); %this is an alternative way to compute %autocorrelation y=fft(cor,n)/fs; %take FFT of autocorrrelation function and scale 7

8 %This yields the ESD z=fftshift(y); %we want to plot double-sided spectrum figure(4) %open new figure plot(f_vec,abs(z)) %plot ESD xlabel('frequency [Hz]','fontsize',18) ylabel('energy/hz','fontsize',18) title('energy spectral density - Via FFT of Autocorrelation','fontsize',18) grid on set(gcf,'color','w'); %set background color from grey (default) to white axis tight %calculate total energy with autocorrelation function Eg=sum(abs(z))*fs/N %Using ESD Energy spectral density - Via FFT of Autocorrelation Energy/Hz Frequency [Hz] Figure 4 8

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

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

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

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

CE 513: STATISTICAL METHODS

CE 513: STATISTICAL METHODS 28-8-217/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 Fourier Analysis Fourier Series

More information

Solution 7 August 2015 ECE301 Signals and Systems: Final Exam. Cover Sheet

Solution 7 August 2015 ECE301 Signals and Systems: Final Exam. Cover Sheet Solution 7 August 2015 ECE301 Signals and Systems: Final Exam Cover Sheet Test Duration: 120 minutes Coverage: Chap. 1, 2, 3, 4, 5, 7 One 8.5" x 11" crib sheet is allowed. Calculators, textbooks, notes

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

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

Review of Fourier Transform

Review of Fourier Transform Review of Fourier Transform Fourier series works for periodic signals only. What s about aperiodic signals? This is very large & important class of signals Aperiodic signal can be considered as periodic

More information

V(t) = Total Power = Calculating the Power Spectral Density (PSD) in IDL. Thomas Ferree, Ph.D. August 23, 1999

V(t) = Total Power = Calculating the Power Spectral Density (PSD) in IDL. Thomas Ferree, Ph.D. August 23, 1999 Calculating the Power Spectral Density (PSD) in IDL Thomas Ferree, Ph.D. August 23, 1999 This note outlines the calculation of power spectra via the fast Fourier transform (FFT) algorithm. There are several

More information

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

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

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

Discrete Fourier Transform (DFT) & Fast Fourier Transform (FFT) Lab 9

Discrete Fourier Transform (DFT) & Fast Fourier Transform (FFT) Lab 9 Discrete Fourier Transform (DFT) & Fast Fourier Transform (FFT) Lab 9 Last Time We found that an approximation to the Continuous Time Fourier Transform may be found by sampling x t at every mδt and turning

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

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

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

A3. Frequency Representation of Continuous Time and Discrete Time Signals

A3. Frequency Representation of Continuous Time and Discrete Time Signals A3. Frequency Representation of Continuous Time and Discrete Time Signals Objectives Define the magnitude and phase plots of continuous time sinusoidal signals Extend the magnitude and phase plots to discrete

More information

Signals and Spectra (1A) Young Won Lim 11/26/12

Signals and Spectra (1A) Young Won Lim 11/26/12 Signals and Spectra (A) Copyright (c) 202 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version.2 or any later

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

A523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011

A523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011 A523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011 Lecture 6 PDFs for Lecture 1-5 are on the web page Problem set 2 is on the web page Article on web page A Guided

More information

L29: Fourier analysis

L29: Fourier analysis L29: Fourier analysis Introduction The discrete Fourier Transform (DFT) The DFT matrix The Fast Fourier Transform (FFT) The Short-time Fourier Transform (STFT) Fourier Descriptors CSCE 666 Pattern Analysis

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

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMUTER ENGINEERING ECE 2026 Summer 208 roblem Set #3 Assigned: May 27, 208 Due: June 5, 208 Reading: Chapter 3 on Spectrum Representation, and

More information

Signal Processing COS 323

Signal Processing COS 323 Signal Processing COS 323 Digital Signals D: functions of space or time e.g., sound 2D: often functions of 2 spatial dimensions e.g. images 3D: functions of 3 spatial dimensions CAT, MRI scans or 2 space,

More information

The Hilbert Transform

The Hilbert Transform The Hilbert Transform David Hilbert 1 ABSTRACT: In this presentation, the basic theoretical background of the Hilbert Transform is introduced. Using this transform, normal real-valued time domain functions

More information

Lecture 7 Random Signal Analysis

Lecture 7 Random Signal Analysis Lecture 7 Random Signal Analysis 7. Introduction to Probability 7. Amplitude Distributions 7.3 Uniform, Gaussian, and Other Distributions 7.4 Power and Power Density Spectra 7.5 Properties of the Power

More information

ω 0 = 2π/T 0 is called the fundamental angular frequency and ω 2 = 2ω 0 is called the

ω 0 = 2π/T 0 is called the fundamental angular frequency and ω 2 = 2ω 0 is called the he ime-frequency Concept []. Review of Fourier Series Consider the following set of time functions {3A sin t, A sin t}. We can represent these functions in different ways by plotting the amplitude versus

More information

Distortion Analysis T

Distortion Analysis T EE 435 Lecture 32 Spectral Performance Windowing Spectral Performance of Data Converters - Time Quantization - Amplitude Quantization Quantization Noise . Review from last lecture. Distortion Analysis

More information

2A1H Time-Frequency Analysis II

2A1H Time-Frequency Analysis II 2AH Time-Frequency Analysis II Bugs/queries to david.murray@eng.ox.ac.uk HT 209 For any corrections see the course page DW Murray at www.robots.ox.ac.uk/ dwm/courses/2tf. (a) A signal g(t) with period

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

Lecture 8 ELE 301: Signals and Systems

Lecture 8 ELE 301: Signals and Systems Lecture 8 ELE 30: Signals and Systems Prof. Paul Cuff Princeton University Fall 20-2 Cuff (Lecture 7) ELE 30: Signals and Systems Fall 20-2 / 37 Properties of the Fourier Transform Properties of the Fourier

More information

EE 313 Linear Systems and Signals The University of Texas at Austin. Solution Set for Homework #1 on Sinusoidal Signals

EE 313 Linear Systems and Signals The University of Texas at Austin. Solution Set for Homework #1 on Sinusoidal Signals Solution Set for Homework #1 on Sinusoidal Signals By Mr. Houshang Salimian and Prof. Brian L. Evans September 7, 2018 1. Prologue: This problem helps you to identify the points of interest in a sinusoidal

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

EE 435. Lecture 32. Spectral Performance Windowing

EE 435. Lecture 32. Spectral Performance Windowing EE 435 Lecture 32 Spectral Performance Windowing . Review from last lecture. Distortion Analysis T 0 T S THEOREM?: If N P is an integer and x(t) is band limited to f MAX, then 2 Am Χ mnp 1 0 m h N and

More information

LES of Turbulent Flows: Lecture 3

LES of Turbulent Flows: Lecture 3 LES of Turbulent Flows: Lecture 3 Dr. Jeremy A. Gibbs Department of Mechanical Engineering University of Utah Fall 2016 1 / 53 Overview 1 Website for those auditing 2 Turbulence Scales 3 Fourier transforms

More information

Discrete Fourier Transform

Discrete Fourier Transform Discrete Fourier Transform Valentina Hubeika, Jan Černocký DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz Diskrete Fourier transform (DFT) We have just one problem with DFS that needs to be solved.

More information

Correlator I. Basics. Chapter Introduction. 8.2 Digitization Sampling. D. Anish Roshi

Correlator I. Basics. Chapter Introduction. 8.2 Digitization Sampling. D. Anish Roshi Chapter 8 Correlator I. Basics D. Anish Roshi 8.1 Introduction A radio interferometer measures the mutual coherence function of the electric field due to a given source brightness distribution in the sky.

More information

Computational Methods for Astrophysics: Fourier Transforms

Computational Methods for Astrophysics: Fourier Transforms Computational Methods for Astrophysics: Fourier Transforms John T. Whelan (filling in for Joshua Faber) April 27, 2011 John T. Whelan April 27, 2011 Fourier Transforms 1/13 Fourier Analysis Outline: Fourier

More information

Solutions to Assignment 4

Solutions to Assignment 4 EE35 Spectrum Analysis and Discrete Time Systems (Fall 5) Solutions to Assignment. Consider the continuous-time periodic signal: x(t) = sin(t 3) + sin(6t) (8) [] (a) Obviously, the fundamental frequency

More information

(i) Represent continuous-time periodic signals using Fourier series

(i) Represent continuous-time periodic signals using Fourier series Fourier Series Chapter Intended Learning Outcomes: (i) Represent continuous-time periodic signals using Fourier series (ii) (iii) Understand the properties of Fourier series Understand the relationship

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

FROM ANALOGUE TO DIGITAL

FROM ANALOGUE TO DIGITAL SIGNALS AND SYSTEMS: PAPER 3C1 HANDOUT 7. Dr David Corrigan 1. Electronic and Electrical Engineering Dept. corrigad@tcd.ie www.mee.tcd.ie/ corrigad FROM ANALOGUE TO DIGITAL To digitize signals it is necessary

More information

2A1H Time-Frequency Analysis II Bugs/queries to HT 2011 For hints and answers visit dwm/courses/2tf

2A1H Time-Frequency Analysis II Bugs/queries to HT 2011 For hints and answers visit   dwm/courses/2tf Time-Frequency Analysis II (HT 20) 2AH 2AH Time-Frequency Analysis II Bugs/queries to david.murray@eng.ox.ac.uk HT 20 For hints and answers visit www.robots.ox.ac.uk/ dwm/courses/2tf David Murray. A periodic

More information

Lecture 4&5 MATLAB applications In Signal Processing. Dr. Bedir Yousif

Lecture 4&5 MATLAB applications In Signal Processing. Dr. Bedir Yousif Lecture 4&5 MATLAB applications In Signal Processing Dr. Bedir Yousif Signal Analysis Fourier Series and Fourier Transform Trigonometric Fourier Series Where w0=2*pi/tp and the Fourier coefficients a n

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

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

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

Discrete-Time Signals and Systems. Efficient Computation of the DFT: FFT Algorithms. Analog-to-Digital Conversion. Sampling Process.

Discrete-Time Signals and Systems. Efficient Computation of the DFT: FFT Algorithms. Analog-to-Digital Conversion. Sampling Process. iscrete-time Signals and Systems Efficient Computation of the FT: FFT Algorithms r. eepa Kundur University of Toronto Reference: Sections 6.1, 6., 6.4, 6.5 of John G. Proakis and imitris G. Manolakis,

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

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE) QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE) 1. For the signal shown in Fig. 1, find x(2t + 3). i. Fig. 1 2. What is the classification of the systems? 3. What are the Dirichlet s conditions of Fourier

More information

CHAPTER 4 FOURIER SERIES S A B A R I N A I S M A I L

CHAPTER 4 FOURIER SERIES S A B A R I N A I S M A I L CHAPTER 4 FOURIER SERIES 1 S A B A R I N A I S M A I L Outline Introduction of the Fourier series. The properties of the Fourier series. Symmetry consideration Application of the Fourier series to circuit

More information

Solutions to Problems in Chapter 4

Solutions to Problems in Chapter 4 Solutions to Problems in Chapter 4 Problems with Solutions Problem 4. Fourier Series of the Output Voltage of an Ideal Full-Wave Diode Bridge Rectifier he nonlinear circuit in Figure 4. is a full-wave

More information

Chapter 2: Problem Solutions

Chapter 2: Problem Solutions Chapter 2: Problem Solutions Discrete Time Processing of Continuous Time Signals Sampling à Problem 2.1. Problem: Consider a sinusoidal signal and let us sample it at a frequency F s 2kHz. xt 3cos1000t

More information

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n.

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n. ECE 3 Fall Division Homework Solutions Problem. Reconstruction of a continuous-time signal from its samples. Consider the following periodic signal, depicted below: {, if n t < n +, for any integer n,

More information

EE 435. Lecture 30. Data Converters. Spectral Performance

EE 435. Lecture 30. Data Converters. Spectral Performance EE 435 Lecture 30 Data Converters Spectral Performance . Review from last lecture. INL Often Not a Good Measure of Linearity Four identical INL with dramatically different linearity X OUT X OUT X REF X

More information

Introduction to DFT. Deployment of Telecommunication Infrastructures. Azadeh Faridi DTIC UPF, Spring 2009

Introduction to DFT. Deployment of Telecommunication Infrastructures. Azadeh Faridi DTIC UPF, Spring 2009 Introduction to DFT Deployment of Telecommunication Infrastructures Azadeh Faridi DTIC UPF, Spring 2009 1 Review of Fourier Transform Many signals can be represented by a fourier integral of the following

More information

Signals and Spectra - Review

Signals and Spectra - Review Signals and Spectra - Review SIGNALS DETERMINISTIC No uncertainty w.r.t. the value of a signal at any time Modeled by mathematical epressions RANDOM some degree of uncertainty before the signal occurs

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

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

Notes perso. - cb1 1. Version 3 - November u(t)e i2πft dt u(t) =

Notes perso. - cb1 1. Version 3 - November u(t)e i2πft dt u(t) = Notes perso. - cb1 1 Tutorial : fft, psd & coherence with Matlab Version 3 - November 01 1 Fourier transform by Fast Fourier Transform (FFT) Definition of the Fourier transform : û(f) = F[u(t)] = As an

More information

Lab 4: Quantization, Oversampling, and Noise Shaping

Lab 4: Quantization, Oversampling, and Noise Shaping Lab 4: Quantization, Oversampling, and Noise Shaping Due Friday 04/21/17 Overview: This assignment should be completed with your assigned lab partner(s). Each group must turn in a report composed using

More information

x[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn

x[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn Sampling Let x a (t) be a continuous time signal. The signal is sampled by taking the signal value at intervals of time T to get The signal x(t) has a Fourier transform x[n] = x a (nt ) X a (Ω) = x a (t)e

More information

ANSWERS TO SELECTED EXCERCISES, CH 6-7

ANSWERS TO SELECTED EXCERCISES, CH 6-7 Exercise 6.2 a. We start from equation (6.4) and plug in δ(t) for f(t) F(jω) = δ(t)e jωt dt By the sifting property of δ(t), we see that F(jω) = e jω0 = 1 b. Starting from equation (6.8) and plugging in

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

!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

Fundamentals of the Discrete Fourier Transform

Fundamentals of the Discrete Fourier Transform Seminar presentation at the Politecnico di Milano, Como, November 12, 2012 Fundamentals of the Discrete Fourier Transform Michael G. Sideris sideris@ucalgary.ca Department of Geomatics Engineering University

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

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

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

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals 1. Sampling and Reconstruction 2. Quantization 1 1. Sampling & Reconstruction DSP must interact with an analog world: A to D D to A x(t)

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

MATLAB and Mathematical Introduction Will be discussed in class on 1/24/11

MATLAB and Mathematical Introduction Will be discussed in class on 1/24/11 MATLAB and Mathematical Introduction Will be discussed in class on 1/24/11 GEOP 523; Theoretical Seismology January 17, 2011 Much of our work in this class will be done using MATLAB. The goal of this exercise

More information

University Question Paper Solution

University Question Paper Solution Unit 1: Introduction University Question Paper Solution 1. Determine whether the following systems are: i) Memoryless, ii) Stable iii) Causal iv) Linear and v) Time-invariant. i) y(n)= nx(n) ii) y(t)=

More information

OSE801 Engineering System Identification. Lecture 05: Fourier Analysis

OSE801 Engineering System Identification. Lecture 05: Fourier Analysis OSE81 Engineering System Identification Lecture 5: Fourier Analysis What we will study in this lecture: A short introduction of Fourier analysis Sampling the data Applications Example 1 Fourier Analysis

More information

Each of these functions represents a signal in terms of its spectral components in the frequency domain.

Each of these functions represents a signal in terms of its spectral components in the frequency domain. N INTRODUCTION TO SPECTRL FUNCTIONS Revision B By Tom Irvine Email: tomirvine@aol.com March 3, 000 INTRODUCTION This tutorial presents the Fourier transform. It also discusses the power spectral density

More information

DFT and Matlab with some examples.

DFT and Matlab with some examples. DFT and Matlab with some examples 1 www.icrf.nl Fourier transform Fourier transform is defined as: X + jωt = x( t e dt ( ω ) ) with ω= 2 π f Rad/s And x(t) a signal in the time domain. www.icrf.nl 2 Fourier

More information

Spectra (2A) Young Won Lim 11/8/12

Spectra (2A) Young Won Lim 11/8/12 Spectra (A) /8/ Copyright (c) 0 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version. or any later version

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

EE 435. Lecture 28. Data Converters Linearity INL/DNL Spectral Performance

EE 435. Lecture 28. Data Converters Linearity INL/DNL Spectral Performance EE 435 Lecture 8 Data Converters Linearity INL/DNL Spectral Performance Performance Characterization of Data Converters Static characteristics Resolution Least Significant Bit (LSB) Offset and Gain Errors

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

1.4 Fourier Analysis. Random Data 17

1.4 Fourier Analysis. Random Data 17 Random Data 17 1.4 Fourier Analysis In the physical world we sample (and acquire) signals in either the temporal domain or the spatial domain. However, we are frequently interested in thefrequencycontentof

More information

SHOCK AND VIBRATION RESPONSE SPECTRA COURSE Unit 6B. Notes on the Fourier Transform Magnitude

SHOCK AND VIBRATION RESPONSE SPECTRA COURSE Unit 6B. Notes on the Fourier Transform Magnitude SHOCK AND VIBRATION RESPONSE SPECTRA COURSE Unit 6B. Notes on the Fourier Transform Magnitude By Tom Irvine Introduction Fourier transforms, which were introduced in Unit 6A, have a number of potential

More information

Chapter 33. Alternating Current Circuits

Chapter 33. Alternating Current Circuits Chapter 33 Alternating Current Circuits 1 Capacitor Resistor + Q = C V = I R R I + + Inductance d I Vab = L dt AC power source The AC power source provides an alternative voltage, Notation - Lower case

More information

8/19/16. Fourier Analysis. Fourier analysis: the dial tone phone. Fourier analysis: the dial tone phone

8/19/16. Fourier Analysis. Fourier analysis: the dial tone phone. Fourier analysis: the dial tone phone Patrice Koehl Department of Biological Sciences National University of Singapore http://www.cs.ucdavis.edu/~koehl/teaching/bl5229 koehl@cs.ucdavis.edu Fourier analysis: the dial tone phone We use Fourier

More information

13. Power Spectrum. For a deterministic signal x(t), the spectrum is well defined: If represents its Fourier transform, i.e., if.

13. Power Spectrum. For a deterministic signal x(t), the spectrum is well defined: If represents its Fourier transform, i.e., if. For a deterministic signal x(t), the spectrum is well defined: If represents its Fourier transform, i.e., if jt X ( ) = xte ( ) dt, (3-) then X ( ) represents its energy spectrum. his follows from Parseval

More information

I. Impedance of an R-L circuit.

I. Impedance of an R-L circuit. I. Impedance of an R-L circuit. [For inductor in an AC Circuit, see Chapter 31, pg. 1024] Consider the R-L circuit shown in Figure: 1. A current i(t) = I cos(ωt) is driven across the circuit using an AC

More information

EE 230 Lecture 43. Data Converters

EE 230 Lecture 43. Data Converters EE 230 Lecture 43 Data Converters Review from Last Time: Amplitude Quantization Unwanted signals in the output of a system are called noise. Distortion Smooth nonlinearities Frequency attenuation Large

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

Tutorial Sheet #2 discrete vs. continuous functions, periodicity, sampling

Tutorial Sheet #2 discrete vs. continuous functions, periodicity, sampling 2.39 utorial Sheet #2 discrete vs. continuous functions, periodicity, sampling We will encounter two classes of signals in this class, continuous-signals and discrete-signals. he distinct mathematical

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

A6523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2013

A6523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2013 A6523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2013 Lecture 26 Localization/Matched Filtering (continued) Prewhitening Lectures next week: Reading Bases, principal

More information

ECE 301 Fall 2011 Division 1 Homework 10 Solutions. { 1, for 0.5 t 0.5 x(t) = 0, for 0.5 < t 1

ECE 301 Fall 2011 Division 1 Homework 10 Solutions. { 1, for 0.5 t 0.5 x(t) = 0, for 0.5 < t 1 ECE 3 Fall Division Homework Solutions Problem. Reconstruction of a continuous-time signal from its samples. Let x be a periodic continuous-time signal with period, such that {, for.5 t.5 x(t) =, for.5

More information

ANALOG AND DIGITAL SIGNAL PROCESSING ADSP - Chapter 8

ANALOG AND DIGITAL SIGNAL PROCESSING ADSP - Chapter 8 ANALOG AND DIGITAL SIGNAL PROCESSING ADSP - Chapter 8 Fm n N fnt ( ) e j2mn N X() X() 2 X() X() 3 W Chap. 8 Discrete Fourier Transform (DFT), FFT Prof. J.-P. Sandoz, 2-2 W W 3 W W x () x () x () 2 x ()

More information

Chapter 1. Discrete Fourier Transform. 1.1 Fourier series

Chapter 1. Discrete Fourier Transform. 1.1 Fourier series Chapter Discrete Fourier Transform We usually think about processes around us as functions of time. However, it is often useful to think about them as functions of frequencies. We naturally do this without

More information

7 The Waveform Channel

7 The Waveform Channel 7 The Waveform Channel The waveform transmitted by the digital demodulator will be corrupted by the channel before it reaches the digital demodulator in the receiver. One important part of the channel

More information

EEM 409. Random Signals. Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Problem 2:

EEM 409. Random Signals. Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Problem 2: EEM 409 Random Signals Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Consider a random process of the form = + Problem 2: X(t) = b cos(2π t + ), where b is a constant,

More information

Chapter 3. Data Analysis

Chapter 3. Data Analysis Chapter 3 Data Analysis The analysis of the measured track data is described in this chapter. First, information regarding source and content of the measured track data is discussed, followed by the evaluation

More information

Tutorial 2 - Learning about the Discrete Fourier Transform

Tutorial 2 - Learning about the Discrete Fourier Transform Tutorial - Learning about the Discrete Fourier Transform This tutorial will be about the Discrete Fourier Transform basis, or the DFT basis in short. What is a basis? If we google define basis, we get:

More information