Lab 3: The FFT and Digital Filtering. Slides prepared by: Chun-Te (Randy) Chu

Similar documents
EEO 401 Digital Signal Processing Prof. Mark Fowler

NAME: 11 December 2013 Digital Signal Processing I Final Exam Fall Cover Sheet

2 Frequency-Domain Analysis

Ch.11 The Discrete-Time Fourier Transform (DTFT)

George Mason University ECE 201: Introduction to Signal Analysis Spring 2017

CAP 5415 Computer Vision Fall 2011

A Fourier Transform Model in Excel #1

Responses of Digital Filters Chapter Intended Learning Outcomes:

Signals & Linear Systems Analysis Chapter 2&3, Part II

1. Design a 3rd order Butterworth low-pass filters having a dc gain of unity and a cutoff frequency, fc, of khz.

ENSC327 Communications Systems 2: Fourier Representations. School of Engineering Science Simon Fraser University

CAP 5415 Computer Vision

EE482: Digital Signal Processing Applications

/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by

Additional exercises in Stationary Stochastic Processes

Digital Signal Octave Codes (0A)

LAB 2: DTFT, DFT, and DFT Spectral Analysis Summer 2011

Centre for Mathematical Sciences HT 2017 Mathematical Statistics

Digital Signal Octave Codes (0A)

Two-step self-tuning phase-shifting interferometry

Midterm Summary Fall 08. Yao Wang Polytechnic University, Brooklyn, NY 11201

Digital Signal Octave Codes (0A)

Design of Coprime DFT Arrays and Filter Banks

Figure 3.1 Effect on frequency spectrum of increasing period T 0. Consider the amplitude spectrum of a periodic waveform as shown in Figure 3.2.

Digital Signal Octave Codes (0A)

Digital Signal Octave Codes (0A)

FINAL EXAM. Problem Value Score

Introduction to Analog And Digital Communications

TLT-5200/5206 COMMUNICATION THEORY, Exercise 3, Fall TLT-5200/5206 COMMUNICATION THEORY, Exercise 3, Fall Problem 1.

LAB # 5 HANDOUT. »»» The N-point DFT is converted into two DFTs each of N/2 points. N = -W N Then, the following formulas must be used. = k=0,...

Lab 4: Introduction to Signal Processing: Fourier Transform

Digital Signal Octave Codes (0A)

EECE 301 Signals & Systems Prof. Mark Fowler

ECGR4124 Digital Signal Processing Final Spring 2009

Discrete-time signals and systems

LAB 6: FIR Filter Design Summer 2011

Problem Value Score No/Wrong Rec

Lecture 13: Applications of Fourier transforms (Recipes, Chapter 13)

Discrete-Time Fourier Transform

SIO 211B, Rudnick. We start with a definition of the Fourier transform! ĝ f of a time series! ( )

Notes on Wavelets- Sandra Chapman (MPAGS: Time series analysis) # $ ( ) = G f. y t

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

EEL3135: Homework #4

Problem Value

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2)

DEPARTMENT OF EI DIGITAL SIGNAL PROCESSING ASSIGNMENT 1

Low order continuous-time filters for approximation of the ISO human vibration sensitivity weightings

Lab on Taylor Polynomials. This Lab is accompanied by an Answer Sheet that you are to complete and turn in to your instructor.

Review of Discrete-Time System

Lecture 19 IIR Filters

FFT Octave Codes (1B) Young Won Lim 7/6/17

Digital Image Processing. Lecture 6 (Enhancement) Bu-Ali Sina University Computer Engineering Dep. Fall 2009

In this Lecture. Frequency domain analysis

WORCESTER POLYTECHNIC INSTITUTE

Problem Value

!Sketch f(t) over one period. Show that the Fourier Series for f(t) is as given below. What is θ 1?

Chapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum

Part I: Thin Converging Lens

Chapter 4 Image Enhancement in the Frequency Domain

EE 313 Linear Signals & Systems (Fall 2018) Solution Set for Homework #7 on Infinite Impulse Response (IIR) Filters CORRECTED

Exercises in Digital Signal Processing

AH 2700A. Attenuator Pair Ratio for C vs Frequency. Option-E 50 Hz-20 khz Ultra-precision Capacitance/Loss Bridge

Chapter 7: IIR Filter Design Techniques

Filtering in the Frequency Domain

EEO 401 Digital Signal Processing Prof. Mark Fowler

Signals and Systems. Problem Set: The z-transform and DT Fourier Transform

Problem Value

Problem Value Score No/Wrong Rec 3

E : Lecture 1 Introduction

6.003 (Fall 2011) Quiz #3 November 16, 2011

This is only a list of questions use a separate sheet to work out the problems. 1. (1.2 and 1.4) Use the given graph to answer each question.

DFT Octave Codes (0B) Young Won Lim 4/15/17

ECGR4124 Digital Signal Processing Exam 2 Spring 2017

Nyquist sampling a bandlimited function. Sampling: The connection from CT to DT. Impulse Train sampling. Interpolation: Signal Reconstruction

SIDDHARTH GROUP OF INSTITUTIONS:: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)

In many diverse fields physical data is collected or analysed as Fourier components.

Definition. A signal is a sequence of numbers. sequence is also referred to as being in l 1 (Z), or just in l 1. A sequence {x(n)} satisfying

UNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems.

EE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley

DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A

The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Final May 4, 2012

Presenters. Time Domain and Statistical Model Development, Simulation and Correlation Methods for High Speed SerDes

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

ELEG 305: Digital Signal Processing

Fourier Methods in Digital Signal Processing Final Exam ME 579, Spring 2015 NAME

UNIVERSITI SAINS MALAYSIA. EEE 512/4 Advanced Digital Signal and Image Processing

Detailed Solutions to Exercises

Velocity estimates from sampled position data

Optimal FIR Filters for DTMF Applications

Assignment 2. Signal Processing and Speech Communication Lab. Graz University of Technology

UNCERTAINTY EVALUATION OF SINUSOIDAL FORCE MEASUREMENT

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

( ) ( ) numerically using the DFT. The DTFT is defined. [ ]e. [ ] = x n. [ ]e j 2π Fn and the DFT is defined by X k. [ ]e j 2π kn/n with N = 5.

Integration of Basic Functions. Session 7 : 9/23 1

EE 3054: Signals, Systems, and Transforms Spring A causal discrete-time LTI system is described by the equation. y(n) = 1 4.

Least-Squares Spectral Analysis Theory Summary

Evaluating Fourier Transforms with MATLAB

Digital Signal Processing. Lecture Notes and Exam Questions DRAFT

We would now like to turn our attention to a specific family of functions, the one to one functions.

Double-slit interference of biphotons generated in spontaneous parametric downconversion from a thick crystal

Transcription:

Lab 3: The FFT and Digital Filtering Slides prepared by: Chun-Te (Randy) Chu

Lab 3: The FFT and Digital Filtering Assignment 1 Assignment 2 Assignment 3 Assignment 4 Assignment 5

What you will learn in this lab Process the discrete time signal in requency domain by using MATLAB. Horizontal axis: time (sec) Horizontal axis: requency (Hz, radian)

Assignment 1: MATLAB unction FFT 1. MATLAB command : t (Fast Fourier Transorm) It computes Discrete Fourier Transorm (DFT) o a sequence eiciently. y = t(x); Magnitude abs(y) Phase angle(y) Check help or more details 2. MATLAB command : tshit Change t output range (in requency) z = tshit(y); Why do we need shit?

Assignment 1: MATLAB unction FFT The t outputs a sequence in the range 0 ω 2π tshit 0 2 0 w1 = linspace(0, 2*pi, N); plot(w1, abs(y)) w2 = linspace(-pi, pi, N); plot(w2, abs(z)) But it is more natural to plot in the range -π ω π Then the DC component is in the middle o the spectrum

k N N k k X 2 1 0 ~ ], [ DFT: ] [ ]) [ ( ] [ ]) [ ( ] [ ] [ ] [ ] [ ] [ * * 1 0 2 1 0 ) ( 2 1 0 2 k X k X k N X k X e n x e n x k N X e n x k X N n kn N N n n k N N N n kn N So the magnitude plot is symmetric around w=pi

DFT: X[ k], k 0 ~ N 1 2 k N Which one has higher requency? 2 2 1. cos(( ) n) v. s. cos(( 3) n) 8 8 2 2 2. cos(( ) n) v. s. cos(( 7) n) 8 8 2 2 3. cos(( 3) n) v. s. cos(( 7) n) 8 8

Assignment 1: MATLAB unction FFT Short summary 1. Frequency components are symmetric with respect to 2. Highest requency in radian o discrete time signal is, not 2

Assignment 1: MATLAB unction FFT Frequency in Hz ( ) x[ n] 1 cos(2 n) 0.25 or Given is the requency in Hz? and normalized requency 0.5 normalized requency ( ), what x( t) x[ n] e. g. 1 cos(2t) 1 cos(2 ( nt T Sampling s 10 4 s s period 2500 T s or 10, 5000 Hz is normalized in )) 1 cos(2n) 4 0.25 Hz requency or 0.5 requency in Hz sampling requency

Assignment 1: MATLAB unction FFT Normalized requency and requency in radian ) ( s n n n x 2 2 ) cos( 1 ) cos(2 1 ] [ 2 1 2 1 2 2 2 0 1 0 0 s s s ater tshit() ) (

Summary or assignment 1 Use = 0.25 and 0.5 Plot magnitude o (1) unshited DFT, (2) shited DFT; both in radians. Plot magnitude o (3) shited DFT in Hz ( 0 w 2 ) ( w ) s 2 Please indicate which one you are plotting and the requency axis as well. You can use subplot to show dierent plots in the same window. Total 6 images Answer the questions in the lab document. (The text with underline) 2 ( s )

Assignment 2: Frequency Shiting x 3 [n]=sinc( 1 (n-32)) cos(2π 2 n), where 1 = 0.15, 2 = 0.2, n= 0 ~ 255 x3 = sinc(1*(n-32)).*cos(2*pi*2*n); y3 = tshit(t(x3)); 4 FFT Result: 3.5 3 Magnitude o y3 2.5 2 1.5 1 0.5 0-0.5-0.4-0.3-0.2-0.1 0 0.1 0.2 0.3 0.4 0.5 w

Assignment 2: Frequency Shiting 1. Important Concept : convolution property Suppose e[n], g[n] are two the discrete signal E[ω], G[ω] are FFT results or e[n] and g[n] FFT 1 e[ n] g[ n] E[ ] G[ ] 2 2. i e[n] is the sinc unction E[ω] will be a rect. unction

Assignment 2: Frequency Shiting 3. I g[n] is the cosine unction G[ω] will be impulse signal pairs From 1~3 above, we can know that the tshit(t(x3)) can be viewed as E[ ] [ M ] E[ ( M ])

Summary or assignment 2 Turn in the magnitude and phase plots only or (d) x4[n]. The requency range is in 0.5 0.5 You can use subplot to show dierent plots in the same window. Total 2 images Normalized requency Answer the questions in the lab document. (The text with underline)

Assignment 3: FIR Digital Filters FIR: A ilter with Finite Impulse Response b_lowir = ir1(ilter_order, cut-o_req); The cut-o_req is the requency in radian () normalized with respect to e.g. i is 0.3 ; what will be? 0 1 0 Use revalz01() to analyze the system revalz01(b_lowir, 1 ) Only two inputs are necessary. The 2 nd input or revalz01 should be set as 1 here.

Assignment 3: FIR Digital Filters Ex: order o 5 with cuto requency o b_lowir = ir1(5, 0.7); revalz01(b_lowir, 1 ); 0.7

Summary or assignment 3 Turn in the revalz01 plot.

Assignment 4: IIR Digital Filters IIR: A ilter with Ininite Impulse Response [b_lowbutt, a_lowbutt] = butter(ilter_order, cut-o_req); revalz01(b_lowbutt, a_lowbutt );

Summary or assignment 4 Turn in the revalz01 plot. Answer the questions in the lab document. (The text with underline)

Assignment 5: Filter Implementation Matlab Command: ilter x[n] is the input signal: u[n]-u[n-20] with 40 zeros appended. So the total length is 60. y_ir = ilter(b_lowir, 1, x); y_butt = ilter(b_lowbutt, a_lowbutt, x);

Summary or assignment 5 Turn in the plots o (1) input signal x (2) output y_ir (3) output y_butt You can use subplot to show dierent plots in the same window. Total 3 images ater appending zeros Answer the questions in the lab document. (The text with underline)

More About Lab 3 For assignment 1, the 2 nd and 3 rd plots should be almost the same. The dierence between them is the horizontal axis. Because they have dierent units in the horizontal axis, the labeled values are dierent, too. You need to ollow the requirement in the slides, such as indicating clearly and correctly the horizontal axis. The main reason that we want to label the horizontal axis in dierent units is because it is sometimes easy to observe in some speciic unit.

More About Lab 3 I you want to discuss i the peak locations make sense, you can try to ind out what is the result ater you transorm the input signal into requency domain. You can derive by your hand with the deinition o Fourier transorm or look up the transorm pair table in the text book. Ater you get the result, you will see where should the peaks be.

More About Lab 3 I you want to perorm N point FFT to input x[n], you just add an extra input N to the command t. t(x, N) In this lab, either you speciy the N or you don t is ine or us. I you don t speciy, it will automatically take the length o the x[n] as deault N.

More About Lab 3 (i) Please see clearly the questions mentioned in the documents. You need to answer all the questions in order to get the ull credit. (ii) Please read the slides and document careully. You need to ollow the guidelines in the slides. (iv) There is no need to submit the code. You need to turn in the hard copy report in the lab session on the due date.