LECTURE 18: FAST FOURIER TRANSFORM

Slides:



Advertisements
Similar presentations
DFT & FFT Computation.
Advertisements

ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Response to a Sinusoidal Input Frequency Analysis of an RC Circuit.
Digital Kommunikationselektronik TNE027 Lecture 5 1 Fourier Transforms Discrete Fourier Transform (DFT) Algorithms Fast Fourier Transform (FFT) Algorithms.
The Discrete Fourier Transform. The spectrum of a sampled function is given by where –  or 0 .
LECTURE Copyright  1998, Texas Instruments Incorporated All Rights Reserved Use of Frequency Domain Telecommunication Channel |A| f fcfc Frequency.
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.
Introduction to Fast Fourier Transform (FFT) Algorithms R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2003.
Chapter 12 Fourier Transforms of Discrete Signals.
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.
Discrete Time Periodic Signals A discrete time signal x[n] is periodic with period N if and only if for all n. Definition: Meaning: a periodic signal keeps.
Systems: Definition Filter
Representing Acoustic Information
Discrete-Time Fourier Series
Integral Transform Dongsup Kim Department of Biosystems, KAIST Fall, 2004.
Discrete-Time and System (A Review)
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.
Motivation Music as a combination of sounds at different frequencies
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Introduction to the IEEE Derivation of the DFT Relationship to DTFT DFT of Truncated.
Preprocessing Ch2, v.5a1 Chapter 2 : Preprocessing of audio signals in time and frequency domain  Time framing  Frequency model  Fourier transform 
Jeff Wang Kay-Won Chang March 18, DEMO Harmonic Product Spectrum (HPS) pitch detection: obtain fundamental frequency from FFT Fast Fourier Transform.
1 BIEN425 – Lecture 8 By the end of the lecture, you should be able to: –Compute cross- /auto-correlation using matrix multiplication –Compute cross- /auto-correlation.
Interconnections Blocks can be thought of as subsystems that make up a system described by a signal flow graph. We can reduce such graphs to a transfer.
1 © 2010 Cengage Learning Engineering. All Rights Reserved. 1 Introduction to Digital Image Processing with MATLAB ® Asia Edition McAndrew ‧ Wang ‧ Tseng.
Chapter 5 Finite-Length Discrete Transform
Professor A G Constantinides 1 Discrete Fourier Transforms Consider finite duration signal Its z-tranform is Evaluate at points on z-plane as We can evaluate.
Fast Fourier Transforms. 2 Discrete Fourier Transform The DFT pair was given as Baseline for computational complexity: –Each DFT coefficient requires.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: FIR Filters Design of Ideal Lowpass Filters Filter Design Example.
The Discrete Fourier Transform
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Derivation of the DFT Relationship to DTFT DFT of Truncated Signals.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Difference Equations Transfer Functions Block Diagrams Resources:
Eeng Chapter 2 Discrete Fourier Transform (DFT) Topics:  Discrete Fourier Transform. Using the DFT to Compute the Continuous Fourier Transform.
EE345S Real-Time Digital Signal Processing Lab Fall 2006 Lecture 17 Fast Fourier Transform Prof. Brian L. Evans Dept. of Electrical and Computer Engineering.
بسم الله الرحمن الرحيم Digital Signal Processing Lecture 14 FFT-Radix-2 Decimation in Frequency And Radix -4 Algorithm University of Khartoum Department.
Discrete Fourier Transform
Lecture 19 Spectrogram: Spectral Analysis via DFT & DTFT
Chapter 4 Discrete-Time Signals and transform
Lecture 6 Periodic Signals, Harmonics & Time-Varying Sinusoids
Ch. 2 : Preprocessing of audio signals in time and frequency domain
CS 591 S1 – Computational Audio
DIGITAL SIGNAL PROCESSING ELECTRONICS
MECH 373 Instrumentation and Measurements
LECTURE 11: FOURIER TRANSFORM PROPERTIES
FFT-based filtering and the
LECTURE 33: DIFFERENCE EQUATIONS
Fast Fourier Transforms Dr. Vinu Thomas
Fast Fourier Transform
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
Fast Fourier Transformation (FFT)
Z TRANSFORM AND DFT Z Transform
Lecture 18 DFS: Discrete Fourier Series, and Windowing
Lecture 17 DFT: Discrete Fourier Transform
Chapter 9 Computation of the Discrete Fourier Transform
LECTURE 18: FAST FOURIER TRANSFORM
Chapter 2 Discrete Fourier Transform (DFT)
LECTURE 18: FOURIER ANALYSIS OF CT SYSTEMS
Chapter 19 Fast Fourier Transform
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
LECTURE 05: CONVOLUTION OF DISCRETE-TIME SIGNALS
Lecture #18 FAST FOURIER TRANSFORM ALTERNATE IMPLEMENTATIONS
Fast Fourier Transform (FFT) Algorithms
Lec.6:Discrete Fourier Transform and Signal Spectrum
Lecture #17 INTRODUCTION TO THE FAST FOURIER TRANSFORM ALGORITHM
Electrical Communication Systems ECE Spring 2019
Fast Fourier Transform
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Fourier Transforms of Discrete Signals By Dr. Varsha Shah
Electrical Communications Systems ECE
Presentation transcript:

LECTURE 18: FAST FOURIER TRANSFORM Objectives: Discrete Fourier Transform Computational Complexity Decimation in Time Butterfly Diagrams Convolution Application Waterfall Plots Spectrograms Resources: DPWE: The Fast Fourier Transform CNX: Decimation in Time ECE 4773: The Fast Fourier Transform Wiki: The Cooley-Tukey FFT MS Equation 3.0 was used with settings of: 18, 12, 8, 18, 12. URL:

The Discrete Fourier Transform Recall our definition for the Discrete Fourier Transform (DFT): The computation for Xk requires N2 complex multiplications that require four multiplications of real numbers per complex multiplication. The Fast Fourier Transform (FFT) is an approach to reduce the computational complexity that produces the same result as a DFT (same result, significantly fewer multiplications). To simplify notation, define: We can rewrite the DFT equations: ]i=k,

Decimation in Time (Radix 2) Let’s explore an approach that subdivides time interval into successively smaller intervals. Assume N, the size of the DFT, is an even integer so that N/2 is also an integer. Define two auxiliary signals: Let Ak and Bk denote two (N/2)-point DFTs of a[n] and b[n]: We can show that these are related to the DFT by the following equations: The computation of Ak and Bk each requires (N/2)2 = N2/4 multiplications. The scaling by requires N/2 additional multiplications. The total computation is N2/2+N/2 multiplications, which represents N2/2-N/2 fewer multiplications than the N2 multiplications required by the DFT. For N = 128, this is a savings of 8,128 multiplications (16,384 vs. 8,256).

Block Diagram of an FFT Algorithm If N is a power of 2 (e.g., N = 2q), we can repeat this process to further reduce the computations. The overall complexity reduces from N2 to (Nlog2N)/2.

Bit Reversing Note that the inputs have been shuffled so that the outputs are produced in the correct order. This can be represented as a bit-reversing process: Time Point (n) Binary Word Reversed-Bit Word Order 000 x[0] 1 001 100 x[4] 2 010 x[2] 3 011 110 x[6] 4 x[1] 5 101 x[5] 6 x[3] 7 111 x[7]

Application – Convolution Given two time-limited signals: let r equal the smallest possible integer such that N + Q < 2r. Let L = 2r. We can pad these signals with zeros to make them the same length so that we can apply an FFT: The convolution of these two (zero-padded) signals computed using a convolution sum requires L2 /2 + 3L/2 multiplications. Computing the convolution using the FFT requires (3L/2)log2L + L multiplications. Example: Consider the convolution of a pulse and a truncated exponential. What is the effect of truncating the exponential in the frequency domain?

Application – Convolution (Cont.) We can select an FFT Order as follows: N = 16 Q = 16 (an approximation) N + Q = 32 =2**5  L = 5 The MATLAB code to generate the L-point DFT using the function fft() is: N = 0:16; L = 32; v = (0.8).^n; Vk = fft(v, L); x = [ones(1, 10)] Xk = fft(x, L); The output can be generated by multiplying the frequency responses, and taking the inverse FFT: Yk = Vk.*Xk; y = ifft(Yk, L); This can be validated by using the time-domain convolution function from Chapter 2.

Application – Waterfall Plots Often we will used an overlapping frame-based analysis to compute the spectrum as a function of time. This approach is used in many disciplines (e.g., graphic equalizer in audio systems). One popular visualization is referred to as a waterfall plot.

Applications of the FFT – The Spectrogram Another very important visualization tool is the spectrogram, a time-frequency plot of the spectrum in which the spectral magnitude is plotted as a grayscale value or color.

Spectrograms As Continuous Images

Narrowband vs. Wideband Spectrograms

Applications to Speech Processing The choice of the length of the FFT can produce dramatically different views of your signal. For speech signals, a 6 ms window (48 samples at 8 kHz) allows visualization of individual speech sounds (phonemes). A longer FFT length (240 samples – 30 ms at 8 kHz) allows visualization of the fundamental frequency and its harmonics, which is related to the vibration of the vocal chords. Such time-frequency displays need not be limited to the Fourier transform. For example, wavelets are a popular alternative.

Spectrograms in MATLAB MATLAB contains a wide variety of visualization tools including a spectrogram function. MATLAB can read several file formats directly, including .wav files. Several aspects of the spectrogram can be programmed, including the color map and the analysis window.

Summary Introduced a decimation-in-time approach to fast computation of the DFT known as the Fast Fourier Transform. Discussed the computational efficiency. Demonstrated application of this to convolution. Introduced applications of the convolution known as the waterfall plot and the spectrogram.