Discrete Fourier Transform (DFT)

Slides:



Advertisements
Similar presentations
DCSP-13 Jianfeng Feng Department of Computer Science Warwick Univ., UK
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.
Lecture 7: Basis Functions & Fourier Series
LECTURE Copyright  1998, Texas Instruments Incorporated All Rights Reserved Use of Frequency Domain Telecommunication Channel |A| f fcfc Frequency.
Lecture 15 Orthogonal Functions Fourier Series. LGA mean daily temperature time series is there a global warming signal?
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.
Fourier Transform – Chapter 13. Image space Cameras (regardless of wave lengths) create images in the spatial domain Pixels represent features (intensity,
Math Review with Matlab:
Digital Signal Processing
Kaggle: Whale Challenge
Introduction to Wavelets
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
Analogue and digital techniques in closed loop regulation applications Digital systems Sampling of analogue signals Sample-and-hold Parseval’s theorem.
Time and Frequency Representation
Continuous Time Signals All signals in nature are in continuous time.
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.
Chapter 15 Fourier Series and Fourier Transform
ENG4BF3 Medical Image Processing
Frequency Domain Representation of Sinusoids: Continuous Time Consider a sinusoid in continuous time: Frequency Domain Representation: magnitude phase.
Numerical algorithms for power system protection Prof. dr. sc. Ante Marušić, doc. dr. sc. Juraj Havelka University of Zagreb Faculty of Electrical Engineering.
Discrete-Time and System (A Review)
DTFT And Fourier Transform
GCT731 Fall 2014 Topics in Music Technology - Music Information Retrieval Overview of MIR Systems Audio and Music Representations (Part 1) 1.
Motivation Music as a combination of sounds at different frequencies
The Discrete Fourier Transform. The Fourier Transform “The Fourier transform is a mathematical operation with many applications in physics and engineering.
Fourier series. The frequency domain It is sometimes preferable to work in the frequency domain rather than time –Some mathematical operations are easier.
Transforms. 5*sin (2  4t) Amplitude = 5 Frequency = 4 Hz seconds A sine wave.
Digital Signal Processing – Chapter 10
Digital Linear Filters 張智星 (Roger Jang) 多媒體資訊檢索實驗室 清華大學 資訊工程系.
1 Fourier Representations of Signals & Linear Time-Invariant Systems Chapter 3.
Seismic Reflection Data Processing and Interpretation A Workshop in Cairo 28 Oct. – 9 Nov Cairo University, Egypt Dr. Sherif Mohamed Hanafy Lecturer.
Digital Image Processing Chapter 4 Image Enhancement in the Frequency Domain Part I.
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.
Extends Euclidean space algebra to higher dimensions
Part 4 Chapter 16 Fourier Analysis PowerPoints organized by Prof. Steve Chapra, University All images copyright © The McGraw-Hill Companies, Inc. Permission.
Signals & Systems Lecture 13: Chapter 3 Spectrum Representation.
Fourier Analysis of Signals and Systems
Fourier Transform.
Fourier and Wavelet Transformations Michael J. Watts
DTW for Speech Recognition J.-S. Roger Jang ( 張智星 ) MIR Lab ( 多媒體資訊檢索實驗室 ) CS, Tsing Hua Univ. ( 清華大學.
Performance Indices for Binary Classification 張智星 (Roger Jang) 多媒體資訊檢索實驗室 台灣大學 資訊工程系.
Chapter 2. Characteristics of Signal ※ Signal : transmission of information The quality of the information depends on proper selection of a measurement.
Frequency Domain Representation of Biomedical Signals.
Math for CS Fourier Transforms
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
Convergence of Fourier series It is known that a periodic signal x(t) has a Fourier series representation if it satisfies the following Dirichlet conditions:
Fourier Analysis Patrice Koehl Department of Biological Sciences National University of Singapore
Fourier Series Prof. Brian L. Evans
DIGITAL SIGNAL PROCESSING ELECTRONICS
MECH 373 Instrumentation and Measurements
Part 4 Chapter 16 Fourier Analysis
Intro. to Audio Signals Jyh-Shing Roger Jang (張智星)
Fourier Analyses Time series Sampling interval Total period
Fourier and Wavelet Transformations
UNIT II Analysis of Continuous Time signal
Sinusoids: continuous time
Interpolation and Pulse Shaping
Chapter 2 Ideal Sampling and Nyquist Theorem
Fourier Analyses Time series Sampling interval Total period
Signal Processing First
Endpoint Detection ( 端點偵測)
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Discrete Fourier Transform
Lec.6:Discrete Fourier Transform and Signal Spectrum
Duration & Pitch Modification via WSOLA
ENEE222 Elements of Discrete Signal Analysis Lab 9 1.
Longest Common Subsequence (LCS)
Edit Distance 張智星 (Roger Jang)
Presentation transcript:

Discrete Fourier Transform (DFT) Jyh-Shing Roger Jang (張智星) MIR Lab (多媒體資訊檢索實驗室) CSIE, NTU (台灣大學 資訊工程系) jang@mirlab.org, http://mirlab.org/jang

Discrete Fourier Transform Goal Decompose a given vector of discrete signals into sinusoidal components whose amplitudes can be view as energy distribution over a range of frequencies Applications Speech recognition Digital filtering Many many more... Due to sampling

Decomposition How to decompose xn=x(n/fs), n=0~N-1 into a linear combination of sinusoidal functions? Magnitude spectrum  Phase spectrum  Remaining problems To determine no. of terms and their frequencies

How to Select Frequencies Signals of N points with sample rate fs Total duration d=N/fs (sec) Periods = d, d/2, d/3, … Freq. of sinusoids (bin frequencies) Total count = N/2+1

No. of Terms for Decomposition Curve fitting for a parabola # of unknowns = # of equations (= # of points) Curve fitting view for sinusoidal decomp. How many terms do we need if there are N points?  N/2+1!

Example When N=4

Example When N=8

Sinusoidal Basis Functions (1/2) Can be converted into sin & cos Phase is necessary

Sinusoidal Basis Functions (2/2)

Decompose x(t) into Basis Functions n=0,1,2,…, N-1 # of terms = # of bin freq = N/2+1 # of fitting parameters = N

Decomposition into Basis Functions Overall expression: No. of parameters is 1+2*(N/2-1)+1=N, which is equal to the no. of data points  Exact solution is likely to exist. Amplitude Freq= Phase

Parameter Identification How to identify coefficients of the basis functions: Solving simultaneous linear equations Integration (which take advantage of the orthogonality of the basis functions) Fast Fourier transform (FFT) A fast algorithm with a complexity of O(N log N)

From Time-domain to Freq-domain Many animation over the web 3D animation Please post on FB if you find more.

Frequencies of Basis Functions Due to Euler identity, we can express the k-th term shown on the right. Quiz!

Frequencies of Basis Functions Plug in the simplified k-th term: Include the first and last terms:

Representations of DFT: Two-side Characteristics General representation If x is complex, then c is not conjugate symmetric MATLAB command: c=fft(x) Usually complex numbers

Representations of DFT: One-side Characteristics When x is real, c is conjugate symmetric and we only have to look at one-side of FFT result. MATLAB command: magSpec=fftOneside(x) Real Real In SAP toolbox Complex conjugate

Representations of DFT: One-side Formulas

Example: Conjugate Symmetric Conjugate symmetric of DFT for real x fftSym01.m

Example: Two-side FFT Two-side FFT of a pure sinusoid at one of the bin freqency fft01.m

Example: Two-side FFT Two-side FFT of a pure sinusoid NOT at one of the bin frequencies fft02.m

Example: One-side FFT One-side FFT of a pure sinusoid NOT at one of the bin frequencies fft03.m

Example: One-side FFT One-side FFT of a frame of audio signals fft04.m

Example: FFT for Data Compression Use partial coefficients to reconstruct the original signals fftApproximate01.m High-frequency components are not so important

Example: FFT for Data Compression Use low-freq components to reconstruct a frame fftApproximate01.m

Example: FFT for Periodic Signals Quiz! FFT on periodic signals fftRepeat01.m Useful for pitch tracking Interpretation of harmonics from viewpoints of Approximation by basis functions Integration for obtaining the coefficients

Why Harmonic Structures?

Example: Zero-padding for FFT Purpose N’=N+a=2^n, easier for FFT computation Interpolation to have better resolution Example fftZeroPadding01.m Quiz!

Example: Down-sampling High-frequency components are missing fftResample01.m

Harmonics Why do we have harmonic structures in a power spectrum? Since the original frame is quasi-periodic… If we want to use the spectrum for pitch tracking, we need to enhance the harmonics.  How?

How to Enhance Harmonics? Goal Enhance harmonics for pitch tracking Approach Take an integer number of fundamental periods Hard! Use windowing Use zero-padding for better resolution

Example: Harmonics Enhancement (1) fftHarmonics01.m

Example: Harmonics Enhancement (2) fftHarmonics02.m

Example: Harmonics Enhancement (3) fftHarmonics03.m