Chapter 12 Fast Fourier Transform. 1.Metropolis algorithm for Monte Carlo 2.Simplex method for linear programming 3.Krylov subspace iteration (CG) 4.Decomposition.

Slides:



Advertisements
Similar presentations
DFT & FFT Computation.
Advertisements

Window Fourier and wavelet transforms. Properties and applications of the wavelets. A.S. Yakovlev.
Digital Kommunikationselektronik TNE027 Lecture 5 1 Fourier Transforms Discrete Fourier Transform (DFT) Algorithms Fast Fourier Transform (FFT) Algorithms.
Solving Linear Systems (Numerical Recipes, Chap 2)
Review of Frequency Domain
Chapter 8: The Discrete Fourier Transform
Computer Graphics Recitation 6. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
Reminder Fourier Basis: t  [0,1] nZnZ Fourier Series: Fourier Coefficient:
Chapter 4 Image Enhancement in the Frequency Domain.
MA5233: Computational Mathematics
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2007 Shreekanth Mandayam ECE Department Rowan University.
Some Properties of the 2-D Fourier Transform Translation Distributivity and Scaling Rotation Periodicity and Conjugate Symmetry Separability Convolution.
Multi-Resolution Analysis (MRA)
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
Unit 7 Fourier, DFT, and FFT 1. Time and Frequency Representation The most common representation of signals and waveforms is in the time domain Most signal.
Fourier Transform 2D Discrete Fourier Transform - 2D
CELLULAR COMMUNICATIONS DSP Intro. Signals: quantization and sampling.
Goals For This Class Quickly review of the main results from last class Convolution and Cross-correlation Discrete Fourier Analysis: Important Considerations.
Chapter 4: Sampling of Continuous-Time Signals
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
The sampling of continuous-time signals is an important topic It is required by many important technologies such as: Digital Communication Systems ( Wireless.
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Integral Transform Dongsup Kim Department of Biosystems, KAIST Fall, 2004.
Discrete-Time and System (A Review)
DTFT And Fourier Transform
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
10 Algorithms in 20th Century Science, Vol. 287, No. 5454, p. 799, February 2000 Computing in Science & Engineering, January/February : The Metropolis.
1 Chapter 5 Divide and Conquer Slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved.
CS654: Digital Image Analysis Lecture 15: Image Transforms with Real Basis Functions.
Transforms. 5*sin (2  4t) Amplitude = 5 Frequency = 4 Hz seconds A sine wave.
1 Chapter 5 Ideal Filters, Sampling, and Reconstruction Sections Wed. June 26, 2013.
1 LES of Turbulent Flows: Lecture 2 Supplement (ME EN ) Prof. Rob Stoll Department of Mechanical Engineering University of Utah Fall 2014.
Chapter 7: The Fourier Transform 7.1 Introduction
ECE 4710: Lecture #6 1 Bandlimited Signals  Bandlimited waveforms have non-zero spectral components only within a finite frequency range  Waveform is.
1 © 2010 Cengage Learning Engineering. All Rights Reserved. 1 Introduction to Digital Image Processing with MATLAB ® Asia Edition McAndrew ‧ Wang ‧ Tseng.
Chapter 4 Fourier transform Prepared by Dr. Taha MAhdy.
DCT.
1 Using Wavelets for Recognition of Cognitive Pattern Primitives Dasu Aravind Feature Group PRISM/ASU 3DK – 3DK – September 21, 2000.
Digital Signal Processing Chapter 3 Discrete transforms.
Fourier Analysis of Discrete Time Signals
The Fast Fourier Transform and Applications to Multiplication
Astronomical Data Analysis I
THE LAPLACE TRANSFORM LEARNING GOALS Definition
5.0 Discrete-time Fourier Transform 5.1 Discrete-time Fourier Transform Representation for discrete-time signals Chapters 3, 4, 5 Chap 3 Periodic Fourier.
7- 1 Chapter 7: Fourier Analysis Fourier analysis = Series + Transform ◎ Fourier Series -- A periodic (T) function f(x) can be written as the sum of sines.
revision Transfer function. Frequency Response
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
11 Lecture 2 Signals and Systems (II) Principles of Communications Fall 2008 NCTU EE Tzu-Hsien Sang.
Chapter 13 Discrete Image Transforms
Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: 2.3 Fourier Transform: From Fourier Series to Fourier Transforms.
Fourier transform.
Math for CS Fourier Transforms
Math for CS Fourier Transform
Discrete Fourier Transform
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Chapter 4 Discrete-Time Signals and transform
DIGITAL SIGNAL PROCESSING ELECTRONICS
Chapter 12 Fast Fourier Transform
UNIT II Analysis of Continuous Time signal
The sampling of continuous-time signals is an important topic
4.1 DFT In practice the Fourier components of data are obtained by digital computation rather than by analog processing. The analog values have to be.
Chapter 8 The Discrete Fourier Transform
Digital Image Processing
Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Fast Fourier Transform (FFT) Algorithms
Lecture 4 Image Enhancement in Frequency Domain
Eigenvalues and Eigenvectors
Presentation transcript:

Chapter 12 Fast Fourier Transform

1.Metropolis algorithm for Monte Carlo 2.Simplex method for linear programming 3.Krylov subspace iteration (CG) 4.Decomposition approach to matrix computation (LU, Singular value) 5.The Fortran compiler 6.QR algorithm for eigenvalues 7.Quick sort 8.Fast Fourier transform 9.Integer relation detection 10.Fast multipole

Definition of Fourier Transform

Convolution, Correlation, and Power Autocorrelation if g = h. Autocorrelation is equal to power spectrum |G(f)| 2 in frequency space. Total power:

Sampling Theorem Let Δ be the spacing in time domain, with h n = h (nΔ), n = …,-2,-1,0,1,2,…, the sampled value of continuous function h ( t ). Let f c =1/(2Δ) [Nyquist critical frequency]. Then if H( f ) = 0 for all | f | ≥ f c, then the function h ( t ) is completely determined by h n.

Aliasing Figure The continuous function shown in (a) is nonzero only for a finite interval of time T. It follows that its Fourier transform, whose modulus is shown schematically in (b), is not bandwidth limited but has finite amplitude for all frequencies. If the original function is sampled with a sampling interval Δ, as in (a), then the Fourier transform (c) is defined only between plus and minus the Nyquist critical frequency. Power outside that range is folded over or “aliased” into the range. The effect can be eliminated only by low-pass filtering the original function before sampling.

From Continuous to Discrete Sample time at interval Δ for N points (N even), t k =kΔ, k = 0, 1, 2, …, N-1. Frequency takes values at f n =n/(NΔ), n=-N/2,-N/2+1, …, 0, 1, 2,…,N/2-1. Then

Discrete Fourier Transform Definition Some properties F is symmetric, F T =F (F T )* F = N I F -1 =F * /N (inverse transform is obtained by replacing i by – i, and dividing by N)

Basic Idea of FFT Where H N/2,e is the discrete Fourier transform of N/2 points formed from even set of points, and H N/2,o similar but from odd set of points. This calculation is performed recursively.

Example for N=8 (A) The order of input data need to be rearranged (according to binary bit-reversed pattern. (B) Values for all k can be evaluated in place. No additional memory is needed.

Bit Reversal

Example of FFT x0x0 x1x1 x2x2 x3x3 x4x4 x5x5 x6x6 x7x7 x0x0 x4x4 x2x2 x6x6 x1x1 x5x5 x3x3 x7x7 Swap data according to bit reversal Spacing =1 x0–x4x0–x4 x 2 +x 6 x2–x6x2–x6 x 1 +x 5 x1–x5x1–x5 x 3 +x 7 x3–x7x3–x7 x 0 +x 4  4 = e i  k  2 = e i  k/2 Spacing =2 x 0 +x 4 +x 2 +x 6 x 0 -x 4 +i(x 2 -x 6 ) x 0 +x 4 -(x 2 +x 6 ) x 0 -x 4 -i(x 2 -x 6 ) x 1 +x 5 +x 3 +x 7 x 1 -x 5 +i(x 3 -x 7 ) x 1 +x 5 -(x 3 +x 7 ) x 1 -x 5 -i(x 3 -x 7 )  = e i  k/4 Spacing =4 x0+x4+x2+x6+x1+x5+x3+x7x0+x4+x2+x6+x1+x5+x3+x7 x 0 -x 4 +i(x 2 -x 6 )+e i  /4 (x 1 -x 5 +i(x 3 -x 7 )) x0+x4-x2-x6+i(x1+x5-x3-x7)x0+x4-x2-x6+i(x1+x5-x3-x7) x 0 -x 4 -i(x 2 -x 6 )+ e i  3/4 (x 1 -x 5 -i(x 3 -x 7 )) x 0 +x 4 +x 2 +x 6 -(x 1 +x 5 +x 3 +x 7 ) x 0 -x 4 +i(x 2 -x 6 )-e i  /4 (x 1 -x 5 +i(x 3 -x 7 )) x0+x4-x2-x6-i(x1+x5-x3-x7)x0+x4-x2-x6-i(x1+x5-x3-x7) x 0 -x 4 -i(x 2 -x 6 )- e i  3/4 (x 1 -x 5 -i(x 3 -x 7 )) FT of x in place F2F2 F4F4 F8F8

Cooley-Tukey bit reversal FFT program FFT runs in O(N log N)

InputOutput

Wavelets Fourier transform is local in frequency domain and nonlocal in time Wavelet transforms are generalization that is local in both Discrete wavelet transform is some kind of matrix transform y = Fx, where F T F=I Wavelets are used in data compression and efficient representation of functions

Daubechies Wavelet Filter The coefficients c i are determined by requirements of orthogonality (F T F=I), and certain “vanishing moments”. F =

Discrete Wavelet Transform F F F Apply F to the upper half of the vector only

Suggested Reading and Software For a in-depth discussion of FFT algorithms, see C van Loan, “Computational Frameworks for the Fast Fourier Transform” For state-of-the-art free software, use FFTW at

Problem set 8 In the mode-coupling theory of heat transport through materials, one need to solve a set of coupled nonlinear integral-differential equations numerically as follows: (a) Transform the first equation into frequency domain and solve (algebraically) g in terms of . (b) Describe a procedure to solve the system iteratively using FFT. Where  k 2 are given, and g k ( t ) and  k ( t ) are unknown real functions. Dot means time derivative.