Chapter 12 Fast Fourier Transform

Slides:



Advertisements
Similar presentations
DFT & FFT Computation.
Advertisements

| Page Angelo Farina UNIPR | All Rights Reserved | Confidential Digital sound processing Convolution Digital Filters FFT.
Window Fourier and wavelet transforms. Properties and applications of the wavelets. A.S. Yakovlev.
Ch 3 Analysis and Transmission of Signals
Digital Kommunikationselektronik TNE027 Lecture 5 1 Fourier Transforms Discrete Fourier Transform (DFT) Algorithms Fast Fourier Transform (FFT) Algorithms.
Engineering Mathematics Class #15 Fourier Series, Integrals, and Transforms (Part 3) Sheng-Fang Huang.
Review of Frequency Domain
Lecture 21 Continuous Problems Fréchet Derivatives.
Computer Graphics Recitation 6. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
Sampling theorem, I  Suppose function h(t) is sampled at evenly spaced intervals in time; – 1/  : Sampling rate  For any sampling interval , there.
Reminder Fourier Basis: t  [0,1] nZnZ Fourier Series: Fourier Coefficient:
MA5233: Computational Mathematics
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.
CELLULAR COMMUNICATIONS DSP Intro. Signals: quantization and sampling.
Spectral analysis: Foundations
Chapter 12 Fast Fourier Transform. 1.Metropolis algorithm for Monte Carlo 2.Simplex method for linear programming 3.Krylov subspace iteration (CG) 4.Decomposition.
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.
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.
Transforms. 5*sin (2  4t) Amplitude = 5 Frequency = 4 Hz seconds A sine wave.
1 Week 5 Linear operators and the Sturm–Liouville theory 1.Complex differential operators 2.Properties of self-adjoint operators 3.Sturm-Liouville theory.
Fourier Series. Introduction Decompose a periodic input signal into primitive periodic components. A periodic sequence T2T3T t f(t)f(t)
Advanced Digital Signal Processing
Chapter 4 Fourier transform Prepared by Dr. Taha MAhdy.
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
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.
The Fast Fourier Transform and Applications to Multiplication
Astronomical Data Analysis I
THE LAPLACE TRANSFORM LEARNING GOALS Definition
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
11 Lecture 2 Signals and Systems (II) Principles of Communications Fall 2008 NCTU EE Tzu-Hsien Sang.
DTFT continue (c.f. Shenoi, 2006)  We have introduced DTFT and showed some of its properties. We will investigate them in more detail by showing the associated.
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.
Chapter 2 Ideal Sampling and Nyquist Theorem
Math for CS Fourier Transforms
Math for CS Fourier Transform
1 Chapter 8 The Discrete Fourier Transform (cont.)
Chapter 4 Discrete-Time Signals and transform
Jean Baptiste Joseph Fourier
Integral Transform Method
DIGITAL SIGNAL PROCESSING ELECTRONICS
CE Digital Signal Processing Fall Discrete-time Fourier Transform
MECH 373 Instrumentation and Measurements
EET 422 EMC & COMPLIANCE ENGINEERING
EE Audio Signals and Systems
Chapter 2. Fourier Representation of Signals and Systems
UNIT II Analysis of Continuous Time signal
The sampling of continuous-time signals is an important topic
Lecture #17 INTRODUCTION TO THE FAST FOURIER TRANSFORM ALGORITHM
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
Notes Assignments Tutorial problems
Digital Image Processing
Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Lecture #18 FAST FOURIER TRANSFORM ALTERNATE IMPLEMENTATIONS
Fast Fourier Transform (FFT) Algorithms
Lecture #17 INTRODUCTION TO THE FAST FOURIER TRANSFORM ALGORITHM
Presentation transcript:

Chapter 12 Fast Fourier Transform

Metropolis algorithm for Monte Carlo Simplex method for linear programming Krylov subspace iteration (CG) Decomposition approach to matrix computation (LU, Singular value) The Fortran compiler QR algorithm for eigenvalues Quick sort Fast Fourier transform Integer relation detection Fast multipole From “Computing in science & engineering” Jan/Feb 2000.

Definition of Fourier Transform The preferred notation in physics is the angular frequency ω, instead of frequency f.

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 hn=h(nΔ), n = …,-2,-1,0,1,2,…, the sampled value of continuous function h(t). Let fc=1/(2Δ) [Nyquist critical frequency]. Then if H( f ) = 0 for all | f | ≥ fc, then the function h(t) is completely determined by hn.

Aliasing Figure 12.1.1. 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), tk=kΔ, k = 0, 1, 2, …, N-1. Frequency takes values at fn=n/(NΔ), n=-N/2,-N/2+1, …, 0, 1, 2,…,N/2-1. Then

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

Basic Idea of FFT Where HN/2,e is the discrete Fourier transform of N/2 points formed from even set of points, and HN/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 FT of x in place 4= eik 2= eik/2 = eik/4 x0 x0 Swap data according to bit reversal FT of x in place 4= eik 2= eik/2 = eik/4 x0 x0 x0+x4 x0+x4+x2+x6 x0+x4+x2+x6+x1+x5+x3+x7 F2 x1 x4 x0–x4 x0-x4+i(x2-x6) x0-x4+i(x2-x6)+ei/4 (x1-x5+i(x3-x7)) F4 x2 x2 x2+x6 x0+x4-(x2+x6) x0+x4-x2-x6+i(x1+x5-x3-x7) x3 x6 x2–x6 x0-x4-i(x2-x6) x0-x4-i(x2-x6)+ ei3/4(x1-x5-i(x3-x7)) F8 x4 x1 x1+x5 x1+x5+x3+x7 x0+x4+x2+x6-(x1+x5+x3+x7) x5 x5 x1–x5 x1-x5+i(x3-x7) x0-x4+i(x2-x6)-ei/4 (x1-x5+i(x3-x7)) x6 x3 x3+x7 x1+x5-(x3+x7) x0+x4-x2-x6-i(x1+x5-x3-x7) x7 x7 x3–x7 x1-x5-i(x3-x7) x0-x4-i(x2-x6)- ei3/4(x1-x5-i(x3-x7)) Spacing =1 Spacing =2 Spacing =4

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

Input Output

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 FTF=I Wavelets are used in data compression and efficient representation of functions

Daubechies Wavelet Filter The coefficients ci are determined by requirements of orthogonality (FTF=I), and certain “vanishing moments”.

Discrete Wavelet Transform 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 http://www.fftw.org/

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 k2 are given, and gk(t) and k(t) are unknown real functions. Dot means time derivative.