Nov EXAM INFO DB Victor Phillip Dahdaleh Building (DB) - TEL building
|
|
- Hugo Paul
- 6 years ago
- Views:
Transcription
1 ESSE 4020 / ESS 5020 Time Series and Spectral Analysis Nov EXAM INFO Sun, 11 Dec :00-22:00 DB Victor Phillip Dahdaleh Building (DB) - TEL building Fourier series and Spectral Analysis, B&D, Chapter Spectral Densities (B&D) Note the factor 2π. Wavenumber (s-1) or frequency (Hz). eikλ or e2πihλ 1
2 Basic Fourier Transform and Inverse Euler's formula, named after Leonhard Euler, is a mathematical formula in complex analysis that establishes the fundamental relationship between the trigonometric functions and the complex exponential function. Euler's formula states that, for any real number x: e i x = cos x + i sin x where e is the base of the natural logarithm, i is the imaginary unit, and cos and sin are the trigonometric functions cosine and sine respectively, with the argument x given in radians. Various proofs, e.g. using power series eiπ =? An interesting link. 2
3 Basic Fourier Transform pair, f in Hz, note the extra 2π in exponentials, ω = 2πf is angular frequency radians/sec, s-1. (12.0.1) h(t) could be complex, but we will use real examples, H may be complex but, From: 3
4 Note: with double bars indicates FT pair. Assume N is even and hn = h0 (periodic) 4
5 5
6 Numerical Recipies has Fortran and C++ codes. In Matlab; Definition: The functions X = fft(x) and x = ifft(x) implement the transform and inverse transform pair given for vectors of length... Syntax Y = fft(x) example Y = fft(x,n) example Y = fft(x,n,dim) example Description example Y = fft(x) computes the discrete Fourier transform (DFT) of X using a fast Fourier transform (FFT) algorithm. If X is a vector, then fft(x) returns the Fourier transform of the vector. If X is a matrix, then fft(x) treats the columns of X as vectors and returns the Fourier transform of each column. If X is a multidimensional array, then fft(x) treats the values along the first array dimension whose size does not equal 1 as vectors and returns the Fourier transform of each vector. example Y = fft(x,n) returns the n-point DFT. If no value is specified, Y is the same size as X. If X is a vector and the length of X is less than n, then X is padded with trailing zeros to length n. If X is a vector and the length of X is greater than n, then X is truncated to length n. If X is a matrix, then each column is treated as in the vector case. If X is a multidimensional array, then the first array dimension whose size does not equal 1 is treated as in the vector case. example Y = fft(x,n,dim) returns the Fourier transform along the dimension dim. For example, if X is a matrix, then fft(x,n,2) returns the n-point Fourier transform of each row. 6
7 ifft Inverse fast Fourier transform Syntax: y = ifft(x), y = ifft(x,n), y = ifft(x,n,dim) y = ifft(..., 'symmetric'), y = ifft(..., 'nonsymmetric') Description y = ifft(x) returns the inverse discrete Fourier transform (DFT) of vector X, computed with a fast Fourier transform (FFT) algorithm. If X is a matrix, ifft returns the inverse DFT of each column of the matrix. ifft tests X to see whether vectors in X along the active dimension are conjugate symmetric. If so, the computation is faster and the output is real. An N-element vector x is conjugate symmetric if x(i) = conj(x(mod(n-i+1,n)+1)) for each element of x. If X is a multidimensional array, ifft operates on the first non-singleton dimension. y = ifft(x,n) returns the n-point inverse DFT of vector X. y = ifft(..., 'symmetric') causes ifft to treat X as conjugate symmetric along the active dimension. This option is useful when X is not exactly conjugate symmetric, merely because of round-off error. y = ifft(..., 'nonsymmetric') is the same as calling ifft(...) without the argument 'nonsymmetric'. For any X, ifft(fft(x)) equals X to within roundoff error. Data Type Support ifft supports inputs of data types double and single. If you call ifft with the syntax y = ifft(x,...), the output y has the same data type as the input X. Algorithms The algorithm for ifft(x) is the same as the algorithm for fft(x), except for a sign change and a scale factor of n = length(x). As for fft, the execution time for ifft depends on the length of the transform. It is fastest for powers of two. It is almost as fast for lengths that have only small prime factors. It is typically several times slower for lengths that are prime or which have large prime factors. Note You might be able to increase the speed of ifft using the utility function fftw, which controls how MATLAB software optimizes the algorithm used to compute an FFT of a particular size and dimension. 7
8 Some atmospheric turbulence data The data (about 0.5Mb) in file A DAT that I have posted at were collected on July 16, 1988 at the AES Atmospheric Dry Deposition Research Site on CFB Borden. They consist of u, v, w, T(C), and absolute humidity, q(kg m-3). Wind components have units ms-1. Each line represents one record. The data were collected at 5 Hz beginning at 14:00 EDT. There are 2^13 = 8192 records (27.5 mins). A co-ordinate rotation has been performed on the data so that mean v and mean w should equal zero (but check). The data were collected at a height of 33.4 m. The location was over a deciduous forest with a canopy height of about 18 m. The beginning of the file looks like, E E E E E E E E E E-02 8
9 Consider Vertical velocity component. First 512 records plus all 2^13 S e rie s S e rie s ^13 values; Sample Mean =.0058; Sample Variance =
10 S a m p le A C F 1.00 S a m p le P A C F L o g (P e rio d o g ra m /2 p i) Log periodogram 10
11 P e rio d o g ra m /2 p i Basic linear periodogram 11
12 Matlab use of fft, ifft % PROGRAM BordenW % Peter Taylor clc; X = csvread('f:\ \bordenw-2^13.csv'); Y = fft(x); plot(x); figure; plot(y); YR = real (Y); YI = imag (Y); figure; plot(yr); figure ; plot (YI); XX=ifft(Y); figure; plot(xx) N = length(y);y(1) = []; power = abs(y(1:n/2)).^2; nyquist = 1/2; freq = (1:N/2)/(N/2)*nyquist; l10f = log10(freq); l10p = log10(power); plot(l10f,l10p); grid on; xlabel('log10(cycles/0.2s)'); label('log10(power)'); title('periodogram') 12
13 Time (milliseconds) 13
14 14
15 S e rie s White noise and periodogram P e rio d o g ra m /2 p i Periodogram Notes: See Brockwell and Davis Section 4.2 CLOs Develop relationships between operations in the Time Domain and Fourier Analysis and Power Spectrum analysis. Understand the Wiener-Khintchine and Convolution Theorems Apply knowledge to implementation of digital filters 15
16 Differentiation and Integration Differentiation Suppose f(x) is a differentiable function, and both f and its derivative f' are integrable. Then the Fourier transform of the derivative is given by... More generally, the Fourier transformation of the n-th derivative f(n) is given by... By applying the Fourier transform and using these formulas, some ordinary differential equations can be transformed into algebraic equations, which are much easier to solve. 16
17 Wiener-KhinchinTheorem Or see
18 Convolution: In mathematics, the convolution theorem states that under suitable conditions the Fourier transform of a convolution is the pointwise product of Fourier transforms. In other words, convolution in one domain (e.g., time domain) equals point-wise multiplication in the other domain (e.g., frequency domain) The Fourier transform F(k) = or with t and ν
19 A convolution is an integral that expresses the amount of overlap of one function as it is shifted over another function. It therefore "blends" one function with another. in "The Scientist and Engineer's Guide to Digital Signal Processing By Steven W. Smith, Ph.D." Several chapters are relevant. 19
20 DSP = Digital Signal Processing. 20
21 From: in "The Scientist and Engineer's Guide to Digital Signal Processing By Steven W. Smith, Ph.D." 21
22 22
23 23
24 The Input Side Algorithm 24
25 25
26 Reversing x and h gives same y. Convolution is commutative. Is that true for continuous variable form? x(star)h (t) = x(t')h(t-t')dt' - integral over all t' = h(star)x 26
27 27
28 28
29 29
30 30
31 Compare with ARMA processes - is this MA or AR? 31
32 32
33 33
34 34
35 35
36 36
37 37
38 Borden w data - Gaussian? 38
39 S e rie s sample histogram 39
40 S e rie s Longer data set, 2^13 points Looks more Gaussian. Impact on dispersion, random walk. The central limit theorem and the law of large numbers are the two fundamental theorems of probability. Roughly, the central limit theorem states that the distribution of the sum (or average) of a large number of independent, identically distributed variables will be approximately normal, regardless of the underlying distribution. The importance of the central limit theorem is hard to overstate; indeed it is the reason that many statistical procedures work. The law of large numbers states that the sample mean converges to the distribution mean as the sample size increases, and is one of the fundamental theorems of probability. 40
41 Correlation 41
42 42
43 43
44 44
45 45
46 46
47 from Wikipedia - weather radar dbz stands for decibel relative to Z. It is a logarithmic dimensionless technical unit used in radar, mostly in weather radar, to compare the equivalent reflectivity factor (Z) of a radar signal reflected off a remote object (in mm 6 per m3) to the return of a droplet of rain with a diameter of 1 mm (1 mm6 per m3).[1] It is proportional to the number of drops per unit volume and the sixth power of drops diameter and is thus used to estimate the rain or snow intensity.[2] With other variables analyzed from the radar returns it helps to determine the type of precipitation. Both the radar reflectivity factor and its logarithmic version are commonly referred to as reflectivity when the context is clear. MAPLE predictions - based on correlations to estimate advection velocities of precipitation patterns. 47
48 Information in time domain or frequency domain, Smith Ch 14 48
Definition. A signal is a sequence of numbers. sequence is also referred to as being in l 1 (Z), or just in l 1. A sequence {x(n)} satisfying
Signals and Systems. Definition. A signal is a sequence of numbers {x(n)} n Z satisfying n Z x(n)
More informationLABORATORY 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 informationBME 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 informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Filtering in the Frequency Domain http://www.ee.unlv.edu/~b1morris/ecg782/ 2 Outline Background
More informationLecture 4 Filtering in the Frequency Domain. Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2016
Lecture 4 Filtering in the Frequency Domain Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2016 Outline Background From Fourier series to Fourier transform Properties of the Fourier
More informationSEISMIC 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 informationSummary 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 informationFall 2011, EE123 Digital Signal Processing
Lecture 6 Miki Lustig, UCB September 11, 2012 Miki Lustig, UCB DFT and Sampling the DTFT X (e jω ) = e j4ω sin2 (5ω/2) sin 2 (ω/2) 5 x[n] 25 X(e jω ) 4 20 3 15 2 1 0 10 5 1 0 5 10 15 n 0 0 2 4 6 ω 5 reconstructed
More informationCS711008Z Algorithm Design and Analysis
CS711008Z Algorithm Design and Analysis Lecture 5 FFT and Divide and Conquer Dongbo Bu Institute of Computing Technology Chinese Academy of Sciences, Beijing, China 1 / 56 Outline DFT: evaluate a polynomial
More informationLecture 6: Discrete Fourier Transform
Lecture 6: Discrete Fourier Transform In the previous lecture we introduced the discrete Fourier transform as given either by summations or as a matrix vector product The discrete Fourier transform of
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 12 Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction permitted for noncommercial,
More informationLecture 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 informationToday s lecture. The Fourier transform. Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm
Today s lecture The Fourier transform What is it? What is it useful for? What are its properties? Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm Jean Baptiste Joseph Fourier
More informationCentre 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 informationSF2943: TIME SERIES ANALYSIS COMMENTS ON SPECTRAL DENSITIES
SF2943: TIME SERIES ANALYSIS COMMENTS ON SPECTRAL DENSITIES This document is meant as a complement to Chapter 4 in the textbook, the aim being to get a basic understanding of spectral densities through
More informationTopic 7. Convolution, Filters, Correlation, Representation. Bryan Pardo, 2008, Northwestern University EECS 352: Machine Perception of Music and Audio
Topic 7 Convolution, Filters, Correlation, Representation Short time Fourier Transform Break signal into windows Calculate DFT of each window The Spectrogram spectrogram(y,1024,512,1024,fs,'yaxis'); A
More informationDFT 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 informationPART 1. Review of DSP. f (t)e iωt dt. F(ω) = f (t) = 1 2π. F(ω)e iωt dω. f (t) F (ω) The Fourier Transform. Fourier Transform.
PART 1 Review of DSP Mauricio Sacchi University of Alberta, Edmonton, AB, Canada The Fourier Transform F() = f (t) = 1 2π f (t)e it dt F()e it d Fourier Transform Inverse Transform f (t) F () Part 1 Review
More informationThe Discrete Fourier Transform
In [ ]: cd matlab pwd The Discrete Fourier Transform Scope and Background Reading This session introduces the z-transform which is used in the analysis of discrete time systems. As for the Fourier and
More informationFFT 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 informationComputational 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 informationEE123 Digital Signal Processing
Announcements EE Digital Signal Processing otes posted HW due Friday SDR give away Today! Read Ch 9 $$$ give me your names Lecture based on slides by JM Kahn M Lustig, EECS UC Berkeley M Lustig, EECS UC
More informationEach 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! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular
Previously ESE 531: Digital Signal Processing Lec 22: April 18, 2017 Fast Fourier Transform (con t)! Circular Convolution " Linear convolution with circular convolution! Discrete Fourier Transform " Linear
More informationEE482: 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 informationEE482: 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 information8/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 informationDigital 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 informationLES 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 informationFourier Transforms For additional information, see the classic book The Fourier Transform and its Applications by Ronald N. Bracewell (which is on the shelves of most radio astronomers) and the Wikipedia
More informationEngineering Geodesy I. Exercise 3: Monitoring of a Bridge Determination of the Eigenfrequencies
Engineering Geodesy I Exercise 3: Monitoring of a Bridge Determination of the Eigenfrequencies Prof. Dr. H. Ingensand Geodetic Metrology and Engineering Geodesy 29.11.2010 Model Analyses of the Bridge
More informationCorrelation, 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 informationLAB 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 informationMath 56 Homework 5 Michael Downs
1. (a) Since f(x) = cos(6x) = ei6x 2 + e i6x 2, due to the orthogonality of each e inx, n Z, the only nonzero (complex) fourier coefficients are ˆf 6 and ˆf 6 and they re both 1 2 (which is also seen from
More informationSHOCK AND VIBRATION RESPONSE SPECTRA COURSE Unit 7A. Power Spectral Density Function
SHOCK AND VIBRATION RESPONSE SPECTRA COURSE Unit 7A. Power Spectral Density Function By Tom Irvine Introduction A Fourier transform by itself is a poor format for representing random vibration because
More informationE : 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 informationAdaptive Filtering. Squares. Alexander D. Poularikas. Fundamentals of. Least Mean. with MATLABR. University of Alabama, Huntsville, AL.
Adaptive Filtering Fundamentals of Least Mean Squares with MATLABR Alexander D. Poularikas University of Alabama, Huntsville, AL CRC Press Taylor & Francis Croup Boca Raton London New York CRC Press is
More informationExperimental 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 informationSignal 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 informationDCSP-2: Fourier Transform
DCSP-2: Fourier Transform Jianfeng Feng Department of Computer Science Warwick Univ., UK Jianfeng.feng@warwick.ac.uk http://www.dcs.warwick.ac.uk/~feng/dcsp.html Data transmission Channel characteristics,
More informationFig. 1: Fourier series Examples
FOURIER SERIES AND ITS SOME APPLICATIONS P. Sathyabama Assistant Professor, Department of Mathematics, Bharath collage of Science and Management, Thanjavur, Tamilnadu Abstract: The Fourier series, the
More informationInformation 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 informationSolutions for examination in TSRT78 Digital Signal Processing,
Solutions for examination in TSRT78 Digital Signal Processing 212-12-2 1. (a) The forgetting factor balances the accuracy and the adaptation speed of the RLS algorithm. This as the forgetting factor controls
More informationIntroduction to Complex Mathematics
EEL335: Discrete-Time Signals and Systems. Introduction In our analysis of discrete-time signals and systems, complex numbers will play an incredibly important role; virtually everything we do from here
More informationLecture # 06. Image Processing in Frequency Domain
Digital Image Processing CP-7008 Lecture # 06 Image Processing in Frequency Domain Fall 2011 Outline Fourier Transform Relationship with Image Processing CP-7008: Digital Image Processing Lecture # 6 2
More informationFinal Exam January 31, Solutions
Final Exam January 31, 014 Signals & Systems (151-0575-01) Prof. R. D Andrea & P. Reist Solutions Exam Duration: Number of Problems: Total Points: Permitted aids: Important: 150 minutes 7 problems 50 points
More informationPeriodic motions. Periodic motions are known since the beginning of mankind: Motion of planets around the Sun; Pendulum; And many more...
Periodic motions Periodic motions are known since the beginning of mankind: Motion of planets around the Sun; Pendulum; And many more... Periodic motions There are several quantities which describe a periodic
More informationComputational Methods CMSC/AMSC/MAPL 460
Computational Methods CMSC/AMSC/MAPL 460 Fourier transform Balaji Vasan Srinivasan Dept of Computer Science Several slides from Prof Healy s course at UMD Last time: Fourier analysis F(t) = A 0 /2 + A
More informationDigital 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 informationAdvanced Digital Signal Processing -Introduction
Advanced Digital Signal Processing -Introduction LECTURE-2 1 AP9211- ADVANCED DIGITAL SIGNAL PROCESSING UNIT I DISCRETE RANDOM SIGNAL PROCESSING Discrete Random Processes- Ensemble Averages, Stationary
More informationESS Finite Impulse Response Filters and the Z-transform
9. Finite Impulse Response Filters and the Z-transform We are going to have two lectures on filters you can find much more material in Bob Crosson s notes. In the first lecture we will focus on some of
More informationWaves, the Wave Equation, and Phase Velocity. We ll start with optics. The one-dimensional wave equation. What is a wave? Optional optics texts: f(x)
We ll start with optics Optional optics texts: Waves, the Wave Equation, and Phase Velocity What is a wave? f(x) f(x-) f(x-) f(x-3) Eugene Hecht, Optics, 4th ed. J.F. James, A Student's Guide to Fourier
More informationFILTERING IN THE FREQUENCY DOMAIN
1 FILTERING IN THE FREQUENCY DOMAIN Lecture 4 Spatial Vs Frequency domain 2 Spatial Domain (I) Normal image space Changes in pixel positions correspond to changes in the scene Distances in I correspond
More informationName (print): Lab (circle): W8 Th8 Th11 Th2 F8. θ (radians) θ (degrees) cos θ sin θ π/ /2 1/2 π/4 45 2/2 2/2 π/3 60 1/2 3/2 π/
Name (print): Lab (circle): W8 Th8 Th11 Th2 F8 Trigonometric Identities ( cos(θ) = cos(θ) sin(θ) = sin(θ) sin(θ) = cos θ π ) 2 Cosines and Sines of common angles Euler s Formula θ (radians) θ (degrees)
More informationω (rad/s)
1. (a) From the figure we see that the signal has energy content in frequencies up to about 15rad/s. According to the sampling theorem, we must therefore sample with at least twice that frequency: 3rad/s
More informationFOURIER TRANSFORM METHODS David Sandwell, January, 2013
1 FOURIER TRANSFORM METHODS David Sandwell, January, 2013 1. Fourier Transforms Fourier analysis is a fundamental tool used in all areas of science and engineering. The fast fourier transform (FFT) algorithm
More informationMATH 350: Introduction to Computational Mathematics
MATH 350: Introduction to Computational Mathematics Chapter VIII: The Fast Fourier Transform Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Spring 2008 Outline 1 The
More informationThe Discrete Fourier Transform (DFT) Properties of the DFT DFT-Specic Properties Power spectrum estimate. Alex Sheremet.
4. April 2, 27 -order sequences Measurements produce sequences of numbers Measurement purpose: characterize a stochastic process. Example: Process: water surface elevation as a function of time Parameters:
More informationNotes on FFT-based differentiation
Notes on FFT-based differentiation Steven G Johnson, MIT Applied Mathematics Created April, 2011, updated May 4, 2011 Abstract A common numerical technique is to differentiate some sampled function y(x)
More informationFOURIER TRANSFORM AND
Version: 11 THE DISCRETE TEX d: Oct. 23, 2013 FOURIER TRANSFORM AND THE FFT PREVIEW Classical numerical analysis techniques depend largely on polynomial approximation of functions for differentiation,
More informationCS 179: GPU Programming. Lecture 9 / Homework 3
CS 179: GPU Programming Lecture 9 / Homework 3 Recap Some algorithms are less obviously parallelizable : Reduction Sorts FFT (and certain recursive algorithms) Parallel FFT structure (radix-2) Bit-reversed
More informationLES of Turbulent Flows: Lecture 4 (ME EN )
1 LES of Turbulent Flows: Lecture 4 (ME EN 796 8) Prof. Rob Stoll Department of Mechanical Engineering University of Utah Spring 11 Fourier Transforms Fourier Transforms are a common tool in fluid dynamics
More informationsinc function T=1 sec T=2 sec angle(f(w)) angle(f(w))
T=1 sec sinc function 3 angle(f(w)) T=2 sec angle(f(w)) 1 A quick script to plot mag & phase in MATLAB w=0:0.2:50; Real exponential func b=5; Fourier transform (filter) F=1.0./(b+j*w); subplot(211), plot(w,
More informationBiomedical Engineering Image Formation II
Biomedical Engineering Image Formation II PD Dr. Frank G. Zöllner Computer Assisted Clinical Medicine Medical Faculty Mannheim Fourier Series - A Fourier series decomposes periodic functions or periodic
More informationDSP Algorithm Original PowerPoint slides prepared by S. K. Mitra
Chapter 11 DSP Algorithm Implementations 清大電機系林嘉文 cwlin@ee.nthu.edu.tw Original PowerPoint slides prepared by S. K. Mitra 03-5731152 11-1 Matrix Representation of Digital Consider Filter Structures This
More informationEmpirical Mean and Variance!
Global Image Properties! Global image properties refer to an image as a whole rather than components. Computation of global image properties is often required for image enhancement, preceding image analysis.!
More informationDFT & Fast Fourier Transform PART-A. 7. Calculate the number of multiplications needed in the calculation of DFT and FFT with 64 point sequence.
SHRI ANGALAMMAN COLLEGE OF ENGINEERING & TECHNOLOGY (An ISO 9001:2008 Certified Institution) SIRUGANOOR,TRICHY-621105. DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING UNIT I DFT & Fast Fourier
More informationMA 110 Algebra and Trigonometry for Calculus Fall 2016 Exam 4 12 December Multiple Choice Answers EXAMPLE A B C D E.
MA 110 Algebra and Trigonometry for Calculus Fall 2016 Exam 4 12 December 2016 Multiple Choice Answers EXAMPLE A B C D E Question Name: Section: Last 4 digits of student ID #: This exam has twelve multiple
More informationCS 179: GPU Programming. Lecture 9 / Homework 3
CS 179: GPU Programming Lecture 9 / Homework 3 Recap Some algorithms are less obviously parallelizable : Reduction Sorts FFT (and certain recursive algorithms) Parallel FFT structure (radix-2) Bit-reversed
More informationSNR 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 informationANALOG 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 informationSignal Processing. Young Won Lim 2/22/18
Copyright (c) 2016 2018 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 informationPhasor mathematics. Resources and methods for learning about these subjects (list a few here, in preparation for your research):
Phasor mathematics This worksheet and all related files are licensed under the Creative Commons Attribution License, version 1.0. To view a copy of this license, visit http://creativecommons.org/licenses/by/1.0/,
More informationEP375 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 information3. Lecture. Fourier Transformation Sampling
3. Lecture Fourier Transformation Sampling Some slides taken from Digital Image Processing: An Algorithmic Introduction using Java, Wilhelm Burger and Mark James Burge Separability ² The 2D DFT can be
More informationReview of Linear Systems Theory
Review of Linear Systems Theory The following is a (very) brief review of linear systems theory, convolution, and Fourier analysis. I work primarily with discrete signals, but each result developed in
More informationReal Time Phasor Data Processing using Complex Number Analysis Methods R.A. DE CALLAFON 1, C.H. WELLS 2 USA
21, rue d Artois, F-75008 PARIS CIGRE US National Committee http : //www.cigre.org 2015 Grid of the Future Symposium Real Time Phasor Data Processing using Complex Number Analysis Methods R.A. DE CALLAFON
More informationSignal interactions Cross correlation, cross spectral coupling and significance testing Centre for Doctoral Training in Healthcare Innovation
Signal interactions Cross correlation, cross spectral coupling and significance testing Centre for Doctoral Training in Healthcare Innovation Dr. Gari D. Clifford, University Lecturer & Director, Centre
More informationFeature extraction 1
Centre for Vision Speech & Signal Processing University of Surrey, Guildford GU2 7XH. Feature extraction 1 Dr Philip Jackson Cepstral analysis - Real & complex cepstra - Homomorphic decomposition Filter
More informationFourier Transform in Image Processing. CS/BIOEN 6640 U of Utah Guido Gerig (slides modified from Marcel Prastawa 2012)
Fourier Transform in Image Processing CS/BIOEN 6640 U of Utah Guido Gerig (slides modified from Marcel Prastawa 2012) Basis Decomposition Write a function as a weighted sum of basis functions f ( x) wibi(
More informationDOING 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 informationUp/down-sampling & interpolation Centre for Doctoral Training in Healthcare Innovation
Up/down-sampling & interpolation Centre for Doctoral Training in Healthcare Innovation Dr. Gari D. Clifford, University Lecturer & Director, Centre for Doctoral Training in Healthcare Innovation, Institute
More informationLecture 3: Linear Filters
Lecture 3: Linear Filters Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Images as functions Linear systems (filters) Convolution and correlation Discrete Fourier Transform (DFT)
More informationDiscrete Simulation of Power Law Noise
Discrete Simulation of Power Law Noise Neil Ashby 1,2 1 University of Colorado, Boulder, CO 80309-0390 USA 2 National Institute of Standards and Technology, Boulder, CO 80305 USA ashby@boulder.nist.gov
More informationTutorial 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!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 informationSignals, 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 informationContents. 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 informationSIMG-782 Digital Image Processing Homework 6
SIMG-782 Digital Image Processing Homework 6 Ex. 1 (Circular Convolution) Let f [1, 3, 1, 2, 0, 3] and h [ 1, 3, 2]. (a) Calculate the convolution f h assuming that both f and h are zero-padded to a length
More informationChapter 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 informationComputer Exercise 0 Simulation of ARMA-processes
Lund University Time Series Analysis Mathematical Statistics Fall 2018 Centre for Mathematical Sciences Computer Exercise 0 Simulation of ARMA-processes The purpose of this computer exercise is to illustrate
More information18.085: Summer 2016 Due: 3 August 2016 (in class) Problem Set 8
Problem Set 8 Unless otherwise specified, you may use MATLAB to assist with computations. provide a print-out of the code used and its output with your assignment. Please 1. More on relation between Fourier
More informationThe Spectrum of Broadway: A SAS
The Spectrum of Broadway: A SAS PROC SPECTRA Inquiry James D. Ryan and Joseph Earley Emporia State University and Loyola Marymount University Abstract This paper describes how to use the sophisticated
More informationImage Enhancement in the frequency domain. GZ Chapter 4
Image Enhancement in the frequency domain GZ Chapter 4 Contents In this lecture we will look at image enhancement in the frequency domain The Fourier series & the Fourier transform Image Processing in
More information13.7 Power Spectrum Estimation by the Maximum Entropy (All Poles) Method
3.7 Maximum Entropy (All Poles) Method 565 LP coefficients for each segment of the data. The output is reconstructed by driving these coefficients with initial conditions consisting of all zeros except
More informationLecture 3: Linear Filters
Lecture 3: Linear Filters Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Images as functions Linear systems (filters) Convolution and correlation Discrete Fourier Transform (DFT)
More informationLecture 20: Discrete Fourier Transform and FFT
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept of Electrical Engineering Lecture 20: Discrete Fourier Transform and FFT Dec 10, 2001 Prof: J Bilmes TA:
More informationThe 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 informationPulsars: Observation & Timing. Stephen Eikenberry 28 Jan 2014
Pulsars: Observation & Timing Stephen Eikenberry 28 Jan 2014 Timing Pulsars Figure: D. Nice Pulsars send out pulsed signals We receive them Goal is to measure a Time of Arrival (TOA); this provides great
More informationCast of Characters. Some Symbols, Functions, and Variables Used in the Book
Page 1 of 6 Cast of Characters Some s, Functions, and Variables Used in the Book Digital Signal Processing and the Microcontroller by Dale Grover and John R. Deller ISBN 0-13-081348-6 Prentice Hall, 1998
More information