Vibrationdata 1 Unit 6E Fast Fourier Transform (FFT)

Slides:



Advertisements
Similar presentations
DFT & FFT Computation.
Advertisements

DCSP-12 Jianfeng Feng
1 Fast Multiplication of Large Numbers Using Fourier Techniques Henry Skiba Advisor: Dr. Marcus Pendergrass.
Department of Kinesiology and Applied Physiology Spectrum Estimation W. Rose
UNLOCKING THE SECRETS HIDDEN IN YOUR DATA Part 3 Data Analysis.
ACHIZITIA IN TIMP REAL A SEMNALELOR. Three frames of a sampled time domain signal. The Fast Fourier Transform (FFT) is the heart of the real-time spectrum.
1 Chapter 16 Fourier Analysis with MATLAB Fourier analysis is the process of representing a function in terms of sinusoidal components. It is widely employed.
DFT/FFT and Wavelets ● Additive Synthesis demonstration (wave addition) ● Standard Definitions ● Computing the DFT and FFT ● Sine and cosine wave multiplication.
Han Q Le© ECE 3336 Introduction to Circuits & Electronics Lecture Set #10 Signal Analysis & Processing – Frequency Response & Filters Dr. Han Le ECE Dept.
Fourier series With coefficients:. Complex Fourier series Fourier transform (transforms series from time to frequency domain) Discrete Fourier transform.
Vibrationdata 1 Unit 7 Fast Fourier Transform (FFT)
Digital Signal Processing
Statistical properties of Random time series (“noise”)
Sampling, Reconstruction, and Elementary Digital Filters R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2002.
Discrete Fourier Transform(2) Prof. Siripong Potisuk.
Fourier Transform and Applications
Continuous Time Signals All signals in nature are in continuous time.
Leakage & Hanning Windows
Prime Factorization.
Vibrationdata 1 Unit 5 The Fourier Transform. Vibrationdata 2 Courtesy of Professor Alan M. Nathan, University of Illinois at Urbana-Champaign.
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.
Outline 2-D Fourier transforms The sampling theorem Sampling Aliasing
GCT731 Fall 2014 Topics in Music Technology - Music Information Retrieval Overview of MIR Systems Audio and Music Representations (Part 1) 1.
Vibrationdata 1 Unit 19 Digital Filtering (plus some seismology)
Lecture 1 Signals in the Time and Frequency Domains
Power Spectral Density Function
Fourier (1) Hany Ferdinando Dept. of Electrical Eng. Petra Christian University.
CSC361/661 Digital Media Spring 2002
Processor Architecture Needed to handle FFT algoarithm M. Smith.
Vibrationdata 1 Unit 17 SDOF Response to Applied Force Revision A.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 19.
Preprocessing Ch2, v.5a1 Chapter 2 : Preprocessing of audio signals in time and frequency domain  Time framing  Frequency model  Fourier transform 
Vibrationdata 1 Unit 5 The Fourier Transform. Vibrationdata 2 Courtesy of Professor Alan M. Nathan, University of Illinois at Urbana-Champaign.
Vibrationdata 1 Unit 9 White Noise FFT. Vibrationdata 2 Fourier Transform, Sine Function A Fourier transform will give the exact magnitude and frequency.
Chapter 6 Spectrum Estimation § 6.1 Time and Frequency Domain Analysis § 6.2 Fourier Transform in Discrete Form § 6.3 Spectrum Estimator § 6.4 Practical.
Pre-Class Music Paul Lansky Six Fantasies on a Poem by Thomas Campion.
Estimation of the spectral density function. The spectral density function, f( ) The spectral density function, f(x), is a symmetric function defined.
Vibrationdata 1 Unit 6a The Fourier Transform. Vibrationdata 2 Courtesy of Professor Alan M. Nathan, University of Illinois at Urbana-Champaign.
Vibrationdata 1 Power Spectral Density Function PSD Unit 11.
Geology 6600/7600 Signal Analysis 30 Sep 2015 © A.R. Lowry 2015 Last time: The transfer function relating linear SISO input & output signals is given by.
CS 376b Introduction to Computer Vision 03 / 17 / 2008 Instructor: Michael Eckmann.
The Discrete Fourier Transform
The Spectrum n Jean Baptiste Fourier ( ) discovered a fundamental tenet of wave theory.
1 Introduction to bx Program (BANAL) To accompany Exercise 2 C.T. Russell April 9, 2008.
The Frequency Domain Digital Image Processing – Chapter 8.
بسم الله الرحمن الرحيم Digital Signal Processing Lecture 14 FFT-Radix-2 Decimation in Frequency And Radix -4 Algorithm University of Khartoum Department.
Lecture 19 Spectrogram: Spectral Analysis via DFT & DTFT
Properties of the power spectral density (1/4)
Chapter 4 Discrete-Time Signals and transform
Fourier series With coefficients:.
(plus some seismology)
Spectrum Analysis and Processing
SDOF Response to Applied Force Revision A
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
MECH 373 Instrumentation and Measurements
Unit 5 The Fourier Transform.
Fast Fourier Transform (FFT)
Fast Fourier Transform (FFT)
EET 422 EMC & COMPLIANCE ENGINEERING
Fast Fourier Transform (FFT)
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.
Unit 44 Vibrationdata Sine Filtering.
Lecture 18 DFS: Discrete Fourier Series, and Windowing
LECTURE 18: FAST FOURIER TRANSFORM
Hanning and Rectangular Windows
(plus some seismology)
Lec.6:Discrete Fourier Transform and Signal Spectrum
ENEE222 Elements of Discrete Signal Analysis Lab 9 1.
LECTURE 18: FAST FOURIER TRANSFORM
Presentation transcript:

Vibrationdata 1 Unit 6E Fast Fourier Transform (FFT)

Vibrationdata SETI program uses as FFT to analyze radio telescope data.

Vibrationdata Introduction The discrete Fourier transform requires a tremendous amount of calculations. A time history with M coordinates would require M 2 complex multiplication steps. The discrete Fourier transform can be carried out by a Fast Fourier transform method, however. The method is based on a time series with a number of points equal to 2 N, where N is an integer. The FFT requires M log 2 M complex multiplication steps, where M = 2 N.

Vibrationdata Calculation Step Example Now consider a time history with 1,000,000 points. A regular Fourier transform would require complex multiplication steps. On the other hand, an FFT would only require approximately 2(10 7 ) steps. Thus, the FFT achieves the calculation in 1/50,000 th of the time.

Vibrationdata Limitations of the FFT The above example is not quite correct. Again, the FFT is based on a time series with 2 N coordinates. Note that 2 19 = 524,288 and 2 20 = 1,048,576 Unfortunately, a time history with 1,000,000 points falls between these two cases.

Vibrationdata Options There are two options for dealing with a time history that is not an integer power of 2. One option is to truncate the time history. This should be acceptable if the data is stationary. In the above example, the time history would thus be truncated to 524,288 points. The second option is to pad the time history with trailing zeroes to bring its length to an integer power of 2. A problem with this option is that it artificially reduces the amplitude of the Fourier transform spectral lines. Truncation, rather than zero-padding, is the preferred method in this course.

Vibrationdata Unit 6E Exercise 1 Plot the accelerometer time history in file panel.txt. The file has two columns: time(sec) and accel(G). The data was measured on the front panel of a semi-trailer, as it was driven over a test course. The data has 8192 points, which is conveniently an integer power of 2. In many cases, data acquisition systems are set-up to measure data segments which are an integer power of 2. Calculate the Fourier transform of panel.txt using program fourier.exe. Use the Hanning window. Plot the full.out magnitude file.

Vibrationdata Unit 6E Exercise 2 Calculate the FFT of panel.txt using program FFT.exe. Use the mean removal and Hanning window options. Plot the fft_full.out magnitude file.

Vibrationdata Unit 6e Exercise 3 Compare the results of steps 1 and 2. Are the results similar or different?

Vibrationdata Unit 6e Exercise 4 Synthesizing a Time History to Satisfy a Power Spectral Density using Sinusoids Aside from the interactive data entry, what was the difference in processing time between the fourier.exe program and the FFT.exe program? You may give a qualitative answer. What were the two dominant frequencies in the Fourier transform magnitude?

Vibrationdata Unit 6e Exercise 5 File apache.txt is the sound pressure time history of an Apache helicopter fly-over. Take the FFT of apache.txt. Use the mean removal and Hanning window options. Plot the fft_full.out magnitude file. What is the blade passing frequency of the main rotor? Click on the icon to listen to the sound file.

Vibrationdata Exercise 6 Transformer Hum Calculate an FFT of transformer.txt

Vibrationdata Transformer Core

Vibrationdata Magnetostriction