Computational Methods CMSC/AMSC/MAPL 460. Fourier transform
|
|
- Ethel Carson
- 5 years ago
- Views:
Transcription
1 Computational Methods CMSC/AMSC/MAPL 460 Fourier transform Ramani Duraiswami, Dept. of Computer Science Several slides from Prof. Healy s course at UMD
2 Fourier Methods Fourier analysis ( harmonic analysis ) a key field of math Has many applications and has enabled many technologies. Basic idea: Use Fourier representation to represent functions Has fast algorithms to manipulate them (the fast Fourier Transform) Requires a complete course (Signal Processing in EE or Math 464 Introduction to Fourier Analysis
3 Basic idea Function spaces can have many different types of bases We have already met monomials and other polynomial basis functions Fourier introduced another set of basis functions : the Fourier series These basis functions are particularly good for describing things that repeat with time
4 Fourier s Representation F(t)= A 0 /2 + A Cos( t) + A 2 Cos(2 t) + A 3 Cos(3 t) + + B Sin( t) + B 2 Sin(2 t) + B 3 Sin(3 t) + For coefficients that go to 0 fast enough these sums will converge at each value of t. This defines a new function, which must be a periodic function. (Period 2 π ) Fourier s claim: ANY periodic function f(t) can be written this way
5 Music
6 Mr. Fourier s Representation Sin( t) + Represent f(t) = t for t < π and 2π periodic
7 Mr. Fourier s Representation Sin( t)
8 Mr. Fourier s Representation Sin( t) - /2 Sin( 2 t)
9 Mr. Fourier s Representation Sin( t) - /2 Sin( 2 t)
10 Mr. Fourier s Representation Sin( t) - /2 Sin( 2 t) +/3 Sin( 3 t)
11 Mr. Fourier s Representation Sin( t) - /2 Sin( 2 t) + /3 Sin( 3 t)
12 Mr. Fourier s Representation 20 th degree Fourier expansion
13 How do you get the Coefficients for a given f? A 0 /2 + A Cos( t) + A 2 Cos(2 t) + A 3 Cos(3 t) + + B Sin( t) + B 2 Sin(2 t) + B 3 Sin(3 t) + Fourier s claim: ANY periodic function f(t) can be written this way (SYNTHESIS) The coefficients are uniquely determined by f: (ANALYSIS) A k = / 2 π 0 2 π f (t) cos( k t) d t B k = / 2 π 0 2 π f (t) sin ( k t) d t
14 Fourier Analysis: match data with sinusoids 0.75 s(t) Time t S[k] = s (t) cos( k t) d t Frequency k
15 Complex Notation For f, periodic with period p Fourier transform f(t) -> F[k] F[k] = /p 0 p f (t) e -2 π i k t/p d t = /p 0 p f (t) cos(2 π k t/p) dt i / p 0 p f (t) sin(2 π k t/p) dt Inverse Fourier transform F[k] -> f(t) f(t) = Σ k in Z F[k] e 2 π i k t/p
16 Sampling Fourier representations work just fine with sampled data Simple connection to Fourier of the continuous function it came form Familiar example: Digital Audio
17 Measuring and Discretizing Input field Physical Field (continuum) PHYSICAL LAYER
18 Sample Physical Field (continuum) PHYSICAL LAYER
19 Quantize Physical Field (continuum) PHYSICAL discretized waveform LAYER
20 Code and output Physical Field (continuum) Digital Representation PHYSICAL LAYER 3, 8, 0, 9, 3,, 2
21 Sampling Often must work with a discrete set of measurements of a continuous function
22 Sampling R Takes a function defined on and creates a function defined on Z S h f(t) φ[n] = f(n h) h
23 Sampling In this case, it is a periodic function on Z, (Assuming p/h = N) N φ[n] = f(n h) φ[n+n] = φ[n] h
24 DFT N- Σ p f (t) e -2 π i k t/p φ[n] e d t 0 n =0-2 π i k nh /p f(t) φ[n] = f(n h) h
25 DFT and its inverse for periodic discrete data Inverse is like Fourier series, but with only p terms Φ[k] = N- Σ n =0 φ[n] e -2 π i k n h /p p = N h N- = Σ n=0 φ[n] e -2 π i k n / N This is automatically periodic in k with period N
26 DFT: Discrete time periodic version of Fourier time domain /Ν N Σ γ[k] e k =0-2 π i k m/n = Γ [m] frequency domain γ[k], on P N i.e. on Z, Period N γ[k]= Σ k =0 N Γ [k] e 2 π i m k/n Γ [m] on P N i.e. on Z, Period N
27 Two PERIODIC time versions of Fourier p f (t) e -2 π i k t/p d t /p f(t), period p S p/n Σ k in Z /Ν F[k] e 2 π i k t/p N- Σ k =0 γ[k] e P N -2 π i k m/n F[k], on Z 0.2 γ[k], on P N i.e. on Z, Period N time domain Σ N- Γ [k] e 2 π i m k/n Γ [m] on P N i.e. on Z, Period N k =0 frequency domain
28 Discrete time Numerical Fourier Analysis DFT is really just a matrix multiplication! Γ [m] = /Ν Γ[0] Γ[] Γ[2]... Γ[N-] = Freq. index N- Σ k =0 e -2 π i k m/n γ[k] time index γ[0] γ[] γ[2]... γ[n-] Γ = F N γ
29 Numerical Harmonic Analysis FFT: Symmetry Properties permits Divide and Conquer Sparse Factorization F mn = ( F m I n ) T mn n ( I m F n ) L mn m F n Naive FFT
30 Structured matrices Fast algorithms have been found for many dense matrices Typically the matrices have some structure Definition: A dense matrix of order N N is called structured if its entries depend on only O(N) parameters. Most famous example the fast Fourier transform
Computational 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 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 informationFast Multipole Methods: Fundamentals & Applications. Ramani Duraiswami Nail A. Gumerov
Fast Multipole Methods: Fundamentals & Applications Ramani Duraiswami Nail A. Gumerov Week 1. Introduction. What are multipole methods and what is this course about. Problems from physics, mathematics,
More informationIn 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 informationThe (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 informationEE 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 informationEE123 Digital Signal Processing
EE123 Digital Signal Processing Lecture 5 based on slides by J.M. Kahn Info Last time Finished DTFT Ch. 2 z-transforms Ch. 3 Today: DFT Ch. 8 Reminders: HW Due tonight The effects of sampling What is going
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 informationESE 250: Digital Audio Basics. Week 4 February 5, The Frequency Domain. ESE Spring'13 DeHon, Kod, Kadric, Wilson-Shah
ESE 250: Digital Audio Basics Week 4 February 5, 2013 The Frequency Domain 1 Course Map 2 Musical Representation With this compact notation Could communicate a sound to pianist Much more compact than 44KHz
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 informationFourier 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 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 informationDistortion 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 informationSIGNALS AND SYSTEMS: PAPER 3C1 HANDOUT 6a. Dr David Corrigan 1. Electronic and Electrical Engineering Dept.
SIGNALS AND SYSTEMS: PAPER 3C HANDOUT 6a. Dr David Corrigan. Electronic and Electrical Engineering Dept. corrigad@tcd.ie www.mee.tcd.ie/ corrigad FOURIER SERIES Have seen how the behaviour of systems can
More informationChapter 1 Divide and Conquer Polynomial Multiplication Algorithm Theory WS 2015/16 Fabian Kuhn
Chapter 1 Divide and Conquer Polynomial Multiplication Algorithm Theory WS 2015/16 Fabian Kuhn Formulation of the D&C principle Divide-and-conquer method for solving a problem instance of size n: 1. Divide
More informationNumerical Methods I: Interpolation (cont ed)
1/20 Numerical Methods I: Interpolation (cont ed) Georg Stadler Courant Institute, NYU stadler@cims.nyu.edu November 30, 2017 Interpolation Things you should know 2/20 I Lagrange vs. Hermite interpolation
More informationTopic 3: Fourier Series (FS)
ELEC264: Signals And Systems Topic 3: Fourier Series (FS) o o o o Introduction to frequency analysis of signals CT FS Fourier series of CT periodic signals Signal Symmetry and CT Fourier Series Properties
More informationLecture 19: Discrete Fourier Series
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 19: Discrete Fourier Series Dec 5, 2001 Prof: J. Bilmes TA: Mingzhou
More informationEE 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 informationEE 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 informationEE 435. Lecture 29. Data Converters. Linearity Measures Spectral Performance
EE 435 Lecture 9 Data Converters Linearity Measures Spectral Performance Linearity Measurements (testing) Consider ADC V IN (t) DUT X IOUT V REF Linearity testing often based upon code density testing
More informationEE 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 informationThe 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 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 informationTHE 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 informationMath 260: Solving the heat equation
Math 260: Solving the heat equation D. DeTurck University of Pennsylvania April 25, 2013 D. DeTurck Math 260 001 2013A: Solving the heat equation 1 / 1 1D heat equation with Dirichlet boundary conditions
More informationTransforms and Orthogonal Bases
Orthogonal Bases Transforms and Orthogonal Bases We now turn back to linear algebra to understand transforms, which map signals between different domains Recall that signals can be interpreted as vectors
More informationFourier Analysis Overview (0B)
CTFS: Continuous Time Fourier Series CTFT: Continuous Time Fourier Transform DTFS: Fourier Series DTFT: Fourier Transform DFT: Discrete Fourier Transform Copyright (c) 2009-2016 Young W. Lim. Permission
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 informationMLISP: Machine Learning in Signal Processing Spring Lecture 8-9 May 4-7
MLISP: Machine Learning in Signal Processing Spring 2018 Prof. Veniamin Morgenshtern Lecture 8-9 May 4-7 Scribe: Mohamed Solomon Agenda 1. Wavelets: beyond smoothness 2. A problem with Fourier transform
More informationElec4621 Advanced Digital Signal Processing Chapter 11: Time-Frequency Analysis
Elec461 Advanced Digital Signal Processing Chapter 11: Time-Frequency Analysis Dr. D. S. Taubman May 3, 011 In this last chapter of your notes, we are interested in the problem of nding the instantaneous
More informationDivide and Conquer algorithms
Divide and Conquer algorithms Another general method for constructing algorithms is given by the Divide and Conquer strategy. We assume that we have a problem with input that can be split into parts in
More informationELEC2400 Signals & Systems
ELEC2400 Signals & Systems Chapter 7. Z-Transforms Brett Ninnes brett@newcastle.edu.au. School of Electrical Engineering and Computer Science The University of Newcastle Slides by Juan I. Yu (jiyue@ee.newcastle.edu.au
More informationChapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform Introduction Representation of periodic sequences: the discrete Fourier series Properties of the DFS The Fourier transform of periodic signals Sampling the Fourier
More informationMathematics for Chemists 2 Lecture 14: Fourier analysis. Fourier series, Fourier transform, DFT/FFT
Mathematics for Chemists 2 Lecture 14: Fourier analysis Fourier series, Fourier transform, DFT/FFT Johannes Kepler University Summer semester 2012 Lecturer: David Sevilla Fourier analysis 1/25 Remembering
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 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 informationLab Fourier Analysis Do prelab before lab starts. PHSX 262 Spring 2011 Lecture 5 Page 1. Based with permission on lectures by John Getty
Today /5/ Lecture 5 Fourier Series Time-Frequency Decomposition/Superposition Fourier Components (Ex. Square wave) Filtering Spectrum Analysis Windowing Fast Fourier Transform Sweep Frequency Analyzer
More informationMedical Image Processing Using Transforms
Medical Image Processing Using Transforms Hongmei Zhu, Ph.D Department of Mathematics & Statistics York University hmzhu@yorku.ca MRcenter.ca Outline Image Quality Gray value transforms Histogram processing
More informationFast Multipole Methods: Fundamentals & Applications. Ramani Duraiswami Nail A. Gumerov
Fast Multipole Methods: Fundamentals & Applications Ramani Duraiswami Nail A. Gumerov Week 1. Introduction. What are multipole methods and what is this course about. Problems from physics, mathematics,
More information5th-order differentiation
ARBITRARY-ORDER REAL-TIME EXACT ROBUST DIFFERENTIATION A. Levant Applied Mathematics Dept., Tel-Aviv University, Israel E-mail: levant@post.tau.ac.il Homepage: http://www.tau.ac.il/~levant/ 5th-order differentiation
More information6.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 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 informationSequential Fast Fourier Transform
Sequential Fast Fourier Transform Departement Computerwetenschappen Room 03.018 (Celestijnenlaan 200A) albert-jan.yzelman@cs.kuleuven.be Includes material from slides by Prof. dr. Rob H. Bisseling Applications
More information6.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 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 informationBinomial coefficients and k-regular sequences
Binomial coefficients and k-regular sequences Eric Rowland Hofstra University New York Combinatorics Seminar CUNY Graduate Center, 2017 12 22 Eric Rowland Binomial coefficients and k-regular sequences
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 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 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 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 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 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 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 information! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals
ESE 531: Digital Signal Processing Lec 25: April 24, 2018 Review Course Content! Introduction! Discrete Time Signals & Systems! Discrete Time Fourier Transform! Z-Transform! Inverse Z-Transform! Sampling
More informationEEO 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 informationEDISP (NWL2) (English) Digital Signal Processing Transform, FT, DFT. March 11, 2015
EDISP (NWL2) (English) Digital Signal Processing Transform, FT, DFT March 11, 2015 Transform concept We want to analyze the signal represent it as built of some building blocks (well known signals), possibly
More informationChapter 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 informationComputational Methods CMSC/AMSC/MAPL 460. Ordinary differential equations
/0/0 Computational Methods CMSC/AMSC/MAPL 460 Ordinar differential equations Ramani Duraiswami Dept. of Computer Science Several slides adapted from Profs. Dianne O Lear and Eric Sandt TAMU Higher Order
More informationNormal modes. where. and. On the other hand, all such systems, if started in just the right way, will move in a simple way.
Chapter 9. Dynamics in 1D 9.4. Coupled motions in 1D 491 only the forces from the outside; the interaction forces cancel because they come in equal and opposite (action and reaction) pairs. So we get:
More informationFourier Transform 4: z-transform (part 2) & Introduction to 2D Fourier Analysis
052600 VU Signal and Image Processing Fourier Transform 4: z-transform (part 2) & Introduction to 2D Fourier Analysis Torsten Möller + Hrvoje Bogunović + Raphael Sahann torsten.moeller@univie.ac.at hrvoje.bogunovic@meduniwien.ac.at
More information1 Introduction & Objective
Signal Processing First Lab 13: Numerical Evaluation of Fourier Series Pre-Lab and Warm-Up: You should read at least the Pre-Lab and Warm-up sections of this lab assignment and go over all exercises in
More information6.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 informationDiscrete 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 informationThe O () notation. Definition: Let f(n), g(n) be functions of the natural (or real)
The O () notation When analyzing the runtime of an algorithm, we want to consider the time required for large n. We also want to ignore constant factors (which often stem from tricks and do not indicate
More informationFunctions not limited in time
Functions not limited in time We can segment an arbitrary L 2 function into segments of width T. The mth segment is u m (t) = u(t)rect(t/t m). We then have m 0 u(t) =l.i.m. m0 u m (t) m= m 0 This wors
More informationCh. 15 Wavelet-Based Compression
Ch. 15 Wavelet-Based Compression 1 Origins and Applications The Wavelet Transform (WT) is a signal processing tool that is replacing the Fourier Transform (FT) in many (but not all!) applications. WT theory
More informationFourier Analysis Overview (0A)
CTFS: Fourier Series CTFT: Fourier Transform DTFS: Fourier Series DTFT: Fourier Transform DFT: Discrete Fourier Transform Copyright (c) 2011-2016 Young W. Lim. Permission is granted to copy, distribute
More informationEE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley
EE123 Digital Signal Processing Today Last time: DTFT - Ch 2 Today: Continue DTFT Z-Transform Ch. 3 Properties of the DTFT cont. Time-Freq Shifting/modulation: M. Lustig, EE123 UCB M. Lustig, EE123 UCB
More informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 3 Signals & Systems Prof. Mark Fowler Note Set #9 C-T Systems: Laplace Transform Transfer Function Reading Assignment: Section 6.5 of Kamen and Heck /7 Course Flow Diagram The arrows here show conceptual
More informationDivide and Conquer: Polynomial Multiplication Version of October 1 / 7, 24201
Divide and Conquer: Polynomial Multiplication Version of October 7, 2014 Divide and Conquer: Polynomial Multiplication Version of October 1 / 7, 24201 Outline Outline: Introduction The polynomial multiplication
More informationDigital Image Processing
Digital Image Processing Image Transforms Unitary Transforms and the 2D Discrete Fourier Transform DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON What is this
More informationEE 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 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 informationEE 435. Lecture 26. Data Converters. Differential Nonlinearity Spectral Performance
EE 435 Lecture 26 Data Converters Differential Nonlinearity Spectral Performance . Review from last lecture. Integral Nonlinearity (DAC) Nonideal DAC INL often expressed in LSB INL = X k INL= max OUT OF
More informationMATH 312 Section 7.1: Definition of a Laplace Transform
MATH 312 Section 7.1: Definition of a Laplace Transform Prof. Jonathan Duncan Walla Walla University Spring Quarter, 2008 Outline 1 The Laplace Transform 2 The Theory of Laplace Transforms 3 Conclusions
More informationCS S Lecture 5 January 29, 2019
CS 6363.005.19S Lecture 5 January 29, 2019 Main topics are #divide-and-conquer with #fast_fourier_transforms. Prelude Homework 1 is due Tuesday, February 5th. I hope you ve at least looked at it by now!
More information8 The Discrete Fourier Transform (DFT)
8 The Discrete Fourier Transform (DFT) ² Discrete-Time Fourier Transform and Z-transform are de ned over in niteduration sequence. Both transforms are functions of continuous variables (ω and z). For nite-duration
More informationLINEAR EQUATIONS OF HIGHER ORDER. EXAMPLES. General framework
Differential Equations Grinshpan LINEAR EQUATIONS OF HIGHER ORDER. EXAMPLES. We consider linear ODE of order n: General framework (1) x (n) (t) + P n 1 (t)x (n 1) (t) + + P 1 (t)x (t) + P 0 (t)x(t) = 0
More informationFrequency, Vibration, and Fourier
Lecture 22: Frequency, Vibration, and Fourier Computer Graphics CMU 15-462/15-662, Fall 2015 Last time: Numerical Linear Algebra Graphics via linear systems of equations Why linear? Have to solve BIG problems
More informationQuiescent Steady State (DC) Analysis The Newton-Raphson Method
Quiescent Steady State (DC) Analysis The Newton-Raphson Method J. Roychowdhury, University of California at Berkeley Slide 1 Solving the System's DAEs DAEs: many types of solutions useful DC steady state:
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 informationSinusoidal Modeling. Yannis Stylianou SPCC University of Crete, Computer Science Dept., Greece,
Sinusoidal Modeling Yannis Stylianou University of Crete, Computer Science Dept., Greece, yannis@csd.uoc.gr SPCC 2016 1 Speech Production 2 Modulators 3 Sinusoidal Modeling Sinusoidal Models Voiced Speech
More informationEE16B, Spring 2018 UC Berkeley EECS. Maharbiz and Roychowdhury. Lecture 4A: Overview Slides. State Space Representations
EE16B, Spring 2018 UC Berkeley EECS Maharbiz and Roychowdhury Lecture 4A: Overview Slides State Space Representations Slide 1 Systems Previously: circuits Now: systems circuits + more: a broader concept
More informationEA2.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 informationChapter 23. Fast Fourier Transform Introduction. By Sariel Har-Peled, November 28, Version: 0.11
Chapter 23 Fast Fourier Transform By Sariel Har-Peled, November 28, 208 Version: 0 But now, reflecting further, there begins to creep into his breast a touch of fellow-feeling for his imitators For it
More informationMathematical Methods wk 1: Vectors
Mathematical Methods wk : Vectors John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationMathematical Methods wk 1: Vectors
Mathematical Methods wk : Vectors John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationNeed for transformation?
Z-TRANSFORM In today s class Z-transform Unilateral Z-transform Bilateral Z-transform Region of Convergence Inverse Z-transform Power Series method Partial Fraction method Solution of difference equations
More informationNotes on Fourier Series and Integrals Fourier Series
Notes on Fourier Series and Integrals Fourier Series et f(x) be a piecewise linear function on [, ] (This means that f(x) may possess a finite number of finite discontinuities on the interval). Then f(x)
More informationCSE 421. Dynamic Programming Shortest Paths with Negative Weights Yin Tat Lee
CSE 421 Dynamic Programming Shortest Paths with Negative Weights Yin Tat Lee 1 Shortest Paths with Neg Edge Weights Given a weighted directed graph G = V, E and a source vertex s, where the weight of edge
More informationFFT: Fast Polynomial Multiplications
FFT: Fast Polynomial Multiplications Jie Wang University of Massachusetts Lowell Department of Computer Science J. Wang (UMass Lowell) FFT: Fast Polynomial Multiplications 1 / 20 Overview So far we have
More informationWave Phenomena Physics 15c
Wave Phenomena Physics 5c Lecture Fourier Analysis (H&L Sections 3. 4) (Georgi Chapter ) What We Did Last ime Studied reflection of mechanical waves Similar to reflection of electromagnetic waves Mechanical
More informationarxiv:math/ v1 [math.na] 12 Jul 2004
arxiv:math/0407177v1 [math.na] 12 Jul 2004 On improving the accuracy of Horner s and Goertzel s algorithms Alica Smoktunowicz and Iwona Wróbel Faculty of Mathematics and Information Science, Warsaw University
More information1. Prove the following properties satisfied by the gamma function: 4 n n!
Math 205A: Complex Analysis, Winter 208 Homework Problem Set #6 February 20, 208. Prove the following properties satisfied by the gamma function: (a) Values at half-integers: Γ ( n + 2 (b) The duplication
More informationFrom Fourier Series to Analysis of Non-stationary Signals - II
From Fourier Series to Analysis of Non-stationary Signals - II prof. Miroslav Vlcek October 10, 2017 Contents Signals 1 Signals 2 3 4 Contents Signals 1 Signals 2 3 4 Contents Signals 1 Signals 2 3 4 Contents
More informationComputational Methods CMSC/AMSC/MAPL 460. Linear Systems, Matrices, LU Decomposition, Ramani Duraiswami, Dept. of Computer Science
Computational ethods CSC/ASC/APL 460 Linear Systems, atrices, LU Decomposition, Ramani Duraiswami, Dept. of Computer Science Class Outline uch of scientific computation involves solution of linear equations
More informationPhysics 6303 Lecture 11 September 24, LAST TIME: Cylindrical coordinates, spherical coordinates, and Legendre s equation
Physics 6303 Lecture September 24, 208 LAST TIME: Cylindrical coordinates, spherical coordinates, and Legendre s equation, l l l l l l. Consider problems that are no axisymmetric; i.e., the potential depends
More informationMATH 1231 MATHEMATICS 1B CALCULUS. Section 5: - Power Series and Taylor Series.
MATH 1231 MATHEMATICS 1B CALCULUS. Section 5: - Power Series and Taylor Series. The objective of this section is to become familiar with the theory and application of power series and Taylor series. By
More information1 Orthonormal sets in Hilbert space
Math 857 Fall 15 1 Orthonormal sets in Hilbert space Let S H. We denote by [S] the span of S, i.e., the set of all linear combinations of elements from S. A set {u α : α A} is called orthonormal, if u
More information