G(f ) = g(t) dt. e i2πft. = cos(2πf t) + i sin(2πf t)

Similar documents
Lecture 3 Complex Exponential Signals

Topic 6. The Digital Fourier Transform. (Based, in part, on The Scientist and Engineer's Guide to Digital Signal Processing by Steven Smith)

ME scope Application Note 02 Waveform Integration & Differentiation

Physics 115 Lecture 13. Fourier Analysis February 22, 2018

Lecture 17 z-transforms 2

Discrete Fourier Transform (DFT)

Frequency Division Multiplexing Spring 2011 Lecture #14. Sinusoids and LTI Systems. Periodic Sequences. x[n] = x[n + N]

Biomedical Signals. Signals and Images in Medicine Dr Nabeel Anwar

FFT analysis in practice

Department of Electronic Engineering NED University of Engineering & Technology. LABORATORY WORKBOOK For the Course SIGNALS & SYSTEMS (TC-202)

The Discrete Fourier Transform. Claudia Feregrino-Uribe, Alicia Morales-Reyes Original material: Dr. René Cumplido

Introduction to signals and systems

The Scientist and Engineer's Guide to Digital Signal Processing By Steven W. Smith, Ph.D.

DFT: Discrete Fourier Transform & Linear Signal Processing

ESE 150 Lab 04: The Discrete Fourier Transform (DFT)

Notes on Fourier transforms

Reference Manual SPECTRUM. Signal Processing for Experimental Chemistry Teaching and Research / University of Maryland

Data Acquisition Systems. Signal DAQ System The Answer?

CHAPTER 9. Sinusoidal Steady-State Analysis

Signals A Preliminary Discussion EE442 Analog & Digital Communication Systems Lecture 2

Music 171: Amplitude Modulation

PART I: The questions in Part I refer to the aliasing portion of the procedure as outlined in the lab manual.

Laboratory Assignment 4. Fourier Sound Synthesis

ESE 150 Lab 04: The Discrete Fourier Transform (DFT)

Fourier Signal Analysis

2.1 BASIC CONCEPTS Basic Operations on Signals Time Shifting. Figure 2.2 Time shifting of a signal. Time Reversal.

EE 215 Semester Project SPECTRAL ANALYSIS USING FOURIER TRANSFORM

Digital Image Processing COSC 6380/4393

It is the speed and discrete nature of the FFT that allows us to analyze a signal's spectrum with MATLAB.

Frequency Domain Representation of Signals

ME scope Application Note 01 The FFT, Leakage, and Windowing

Midterm 1. Total. Name of Student on Your Left: Name of Student on Your Right: EE 20N: Structure and Interpretation of Signals and Systems

Digital Image Processing. Image Enhancement: Filtering in the Frequency Domain

The University of Texas at Austin Dept. of Electrical and Computer Engineering Midterm #2

DIGITAL SIGNAL PROCESSING WITH VHDL

Introduction to Wavelet Transform. Chapter 7 Instructor: Hossein Pourghassem

CS 591 S1 Midterm Exam Solution

Chapter 4 SPEECH ENHANCEMENT

+ a(t) exp( 2πif t)dt (1.1) In order to go back to the independent variable t, we define the inverse transform as: + A(f) exp(2πif t)df (1.

Sound synthesis with Pure Data

Music 270a: Modulation

Spectrum. Additive Synthesis. Additive Synthesis Caveat. Music 270a: Modulation

ECE 201: Introduction to Signal Analysis. Dr. B.-P. Paris Dept. Electrical and Comp. Engineering George Mason University

Discrete Fourier Transform, DFT Input: N time samples

Digital Signal Processing Lecture 1 - Introduction

Transforms and Frequency Filtering

ECE 201: Introduction to Signal Analysis

Sinusoids. Lecture #2 Chapter 2. BME 310 Biomedical Computing - J.Schesser

Lecture notes on Waves/Spectra Noise, Correlations and.

Instruction Manual for Concept Simulators. Signals and Systems. M. J. Roberts

Discrete Fourier Transform

Lab 4 Digital Scope and Spectrum Analyzer

Problem Set 1 (Solutions are due Mon )

SECTION 7: FREQUENCY DOMAIN ANALYSIS. MAE 3401 Modeling and Simulation

CMPT 368: Lecture 4 Amplitude Modulation (AM) Synthesis

1. In the command window, type "help conv" and press [enter]. Read the information displayed.

Spectrum Analysis: The FFT Display

ECE 201: Introduction to Signal Analysis

DISCRETE FOURIER TRANSFORM AND FILTER DESIGN

The Fast Fourier Transform

Final Exam Solutions June 7, 2004

Topic 2. Signal Processing Review. (Some slides are adapted from Bryan Pardo s course slides on Machine Perception of Music)

Math 102 Key Ideas. 1 Chapter 1: Triangle Trigonometry. 1. Consider the following right triangle: c b

ME 365 EXPERIMENT 8 FREQUENCY ANALYSIS

Wireless PHY: Modulation and Demodulation

Time Series/Data Processing and Analysis (MATH 587/GEOP 505)

Complex Numbers in Electronics

Signals and Systems Using MATLAB

Final Exam Solutions June 14, 2006

Aliasing. Consider an analog sinusoid, representing perhaps a carrier in a radio communications system,

CSC475 Music Information Retrieval

Subtractive Synthesis. Describing a Filter. Filters. CMPT 468: Subtractive Synthesis

Coming to Grips with the Frequency Domain

Signal Processing for Digitizers

THE STATE UNIVERSITY OF NEW JERSEY RUTGERS. College of Engineering Department of Electrical and Computer Engineering

16.30 Learning Objectives and Practice Problems - - Lectures 16 through 20

Application of Fourier Transform in Signal Processing

A slope of a line is the ratio between the change in a vertical distance (rise) to the change in a horizontal

EE 470 BIOMEDICAL SIGNALS AND SYSTEMS. Active Learning Exercises Part 2

Analysis of Data Chemistry 838

6.1 - Introduction to Periodic Functions

Simulate IFFT using Artificial Neural Network Haoran Chang, Ph.D. student, Fall 2018

Post-processing using Matlab (Advanced)!

INTEGRATING AND DECIPHERING SIGNAL BY FOURIER TRANSFORM

The Fundamentals of FFT-Based Signal Analysis and Measurement Michael Cerna and Audrey F. Harvey

Signals and Systems Lecture 9 Communication Systems Frequency-Division Multiplexing and Frequency Modulation (FM)

ECEn 487 Digital Signal Processing Laboratory. Lab 3 FFT-based Spectrum Analyzer

Lecture 2: SIGNALS. 1 st semester By: Elham Sunbu

ELECTRONOTES APPLICATION NOTE NO Hanshaw Road Ithaca, NY Nov 7, 2014 MORE CONCERNING NON-FLAT RANDOM FFT

Fourier and Wavelets

(i) Understanding of the characteristics of linear-phase finite impulse response (FIR) filters

EE 422G - Signals and Systems Laboratory

Outline. Wireless PHY: Modulation and Demodulation. Recap: Modulation. Admin. Recap: Demod of AM. Page 1. Recap: Amplitude Modulation (AM)

Here are some of Matlab s complex number operators: conj Complex conjugate abs Magnitude. Angle (or phase) in radians

Observation of the Effects of the Fourier Transformation on Periodic Signals ECE 521. Project 2

Advanced Audiovisual Processing Expected Background

Applications of Linear Algebra in Signal Sampling and Modeling

Laboratory Project 4: Frequency Response and Filters

Chapter Three. The Discrete Fourier Transform

Sampling and Reconstruction

Transcription:

Fourier Transforms Fourier s idea that periodic functions can be represented by an infinite series of sines and cosines with discrete frequencies which are integer multiples of a fundamental frequency can be generalized to continuous frequencies. This leads to the Fourier Transform, which replaces the summation of discrete frequency components with an integral over a continuous range of frequencies. The Fourier Transform is similar in many ways to the Laplace Transform you may have learned about in the study of differential equations. The Fourier Transform of a function g(t) is given by the integral G(f ) = g(t) dt e 2πft The function G(f) gives the frequency spectrum of the function g(t), showing us which frequencies, how much of each frequency and what phase shift each requires to construct the function g(t). The function G(f) is said to be in the frequency domain. Note that this integral depends on Euler s formula, which states that an exponential function with an imaginary exponent is equivalent to the complex sum of a cosine and a sine. Specifically, e i2πft = cos(2πf t) + i sin(2πf t) Fourier Transforms are particularly useful for analyzing the frequency content of signals and for modifying signals by filtering out particular frequencies, such as the high-frequency hiss of audio recordings, as well as synthesizing signals (such as electronic pianos) by combining appropriate sine and cosine functions. An implementation of the Fourier Transform which is suitable for use on a computer, the Discrete Fourier Transform (DFT), has been developed, and a particularly efficient algorithm for calculating the DFT when the number of data points is a power of 2, called the Fast Fourier Transform (FFT), is widely used in science and engineering. The fft( ) command in Scilab calculates either the DFT or FFT, depending on whether or not the number of data points is a power of 2, and produces the frequency spectrum of the signal, showing which frequencies are contained in the signal and how much of each frequency. Generating a Function Suppose we were given data for the graph shown for two cycles here with the Scilab commands shown below. -->x=linspace(0,1,128);

-->y=3*sin(2*%pi*4*x)+4*cos(2*%pi*6*x); -->plot(x,y) Finding the FFT We want to find what frequencies the data contains and how much of each frequency is in the signal. Here s how we do it. We first need to generate a frequency scale. It turns out that the frequency resolution (distance between two points in the frequency spectrum) is the inverse of the product of the space or time resolution x and the number of data points N: f = 1/(N x). The frequency window must then be set N f = 1/ x. -->dx=x(2)-x(1); -->f=linspace(0,1/dx,128); The fft( ) command returns complex numbers, representing coefficients to e {i2πx}. To see the frequency spectrum, we look at the magnitude, m, of the complex coefficients. The magnitude is obtained by taking the square-root of the sum of the squares of the real and 1 imaginary parts with the abs( ) command and scaling the amplitude by. (N f) -->df=f(2)-f(1) -->m=abs(fft(y))/(128*df);

-->plot(f,m) The figure above shows the frequency spectrum. The two spikes to the left are the frequency components of our signal. The two spikes to the right are reflections of the two spikes on the left and actually represent negative frequency components. (If you think of a rotation about the origin in the counterclockwise direction as representing a positive angular frequency, then a rotation in the clockwise direction represents a negative angular frequency.) We can zoom in on the positive portion of the frequency spectrum with the following Scilab command to display just the first 16 data points of the frequency and the magnitude functions: -->plot(f(1:16),m(1:16))

The close-up of the frequency spectrum shown above shows clearly that the frequency components of our signal are at 4 Hz and 6 Hz and the components have amplitudes of y = 3 sin(2π 4x) + 4 cos(2π 6x) 1.5 and 2. In the original function,, the coefficients of the sine and cosine were 3 and 4, respectively, but in the frequency spectrum, the amplitude is split evenly between the positive and negative frequency components. Filtering Out Unwanted Frequency Components Transforming a signal into the frequency domain allows us to apply filters which remove undesirable frequency components from a signal. An audio application of this idea would be to remove the high-frequency hiss or pops generated by scratches which degrade the quality of recorded music. A graphical application of this idea would be to remove scratches from an old photograph. To simulate this situation, we ll add some high-frequency noise to our previous signal. Here is the Scilab command to do that: -->yn=y+sin(2*%pi*20*x); -->plot(x,yn)

A quick comparison of this degraded signal to the one at the beginning shows the striking effect of the high-frequency noise. Transforming this signal into the frequency domain with the following commands yields the frequency spectrum shown below. -->mn=abs(fft(yn))/(128*df); -->plot(f,mn)

The high-frequency noise we added is clearly distinguishable in the frequency spectrum shown above. We can create a notch filter to remove the noise at 20 Hz by creating a function which has the value 0 near 10 Hz and has the value 1 everywhere else. The following Scilab commands do this: -->n=f-f+1; -->n(15:25)=0; -->n(103:113)=0; -->plot(f,n) Multiplying our transformed signal by the notch filter removes the noise spikes from the frequency spectrum. Note the.* operator multiplies corresponding elements of each function. -->m2=mn.*n; -->plot(f,m2)

Inverting the Filtered FFT to Exit the Frequency Domain By using the Inverse Fast Fourier Transform command signal back to the space/time domain: -->y2=ifft(fft(yn).*n); -->plot(x,y2) if f t(), we can transform our filtered A comparison of the filtered signal above with the noisy signal and the original signal,

shows that we have totally eliminated the noise and restored the full quality of the original signal. Practice 1) Find the frequencies contained in the following signal on and the amplitude of each frequency component. Show graphs resulting from each step. The data is in the file loaded into Scilab by opening the pasting it into a Scilab array: > x = [ 1 > 0.9844 > 0.9688 > 0.9688 > 0.9844] data. zip data and noisy (available at: http://civerson.com/math4c/data.zip) and it can be x. txt C[0, 1] file, copying the contents to the clipboard, and x y y The noisy data is in the file and can be similarly loaded into Scilab: > y2 = [ 4 > 6.873 > 8.9388 > 1.8834 > 0.8872] $ y2.txt 2) Remove the high-frequency noise from the noisy signal by filtering in the frequency domain. Show graphs resulting from each step, including a graph of your frequency filter. 3) Can you determine the amplitude and frequency of the original signal? 4) Can you determine the equation for the original signal?