Spring 2014, EE123 Digital Signal Processing

Similar documents
Spring 2014, EE123 Digital Signal Processing

A. Basics of Discrete Fourier Transform

EE123 Digital Signal Processing

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement

Finite-length Discrete Transforms. Chapter 5, Sections

EE123 Digital Signal Processing

6.003 Homework #12 Solutions

6.003 Homework #12 Solutions

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004.

Frequency Domain Filtering

Ch3 Discrete Time Fourier Transform

The Discrete Fourier Transform

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course

Linear time invariant systems

2D DSP Basics: 2D Systems

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and

Frequency Response of FIR Filters

The Z-Transform. Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, Prentice Hall Inc.

Fall 2011, EE123 Digital Signal Processing

FIR Filter Design: Part II

EE Midterm Test 1 - Solutions

Chapter 8. DFT : The Discrete Fourier Transform

Spectral Analysis. This week in lab. Next classes: 3/26 and 3/28. Your next experiment Homework is to prepare

Signal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform

(, ) (, ) (, ) ( ) ( )

EECE 301 Signals & Systems

ELEG 4603/5173L Digital Signal Processing Ch. 1 Discrete-Time Signals and Systems

UNIT-I. 2. A real valued sequence x(n) is anti symmetric if a) X(n)=x(-n) b) X(n)=-x(-n) c) A) and b) d) None Ans: b)

FIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.

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

Solutions. Number of Problems: 4. None. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors.

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

Block-by Block Convolution, FFT/IFFT, Digital Spectral Analysis

Advanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis

Exponential Moving Average Pieter P

Mathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1

Solution of EECS 315 Final Examination F09

Question1 Multiple choices (circle the most appropriate one):

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

Professor: Mihnea UDREA DIGITAL SIGNAL PROCESSING. Grading: Web: MOODLE. 1. Introduction. General information

Chapter 7 z-transform

ELEG3503 Introduction to Digital Signal Processing

EE422G Homework #13 (12 points)

x[0] x[1] x[2] Figure 2.1 Graphical representation of a discrete-time signal.

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016

FIR Filter Design by Windowing

Review of Discrete-time Signals. ELEC 635 Prof. Siripong Potisuk

ECE 564/645 - Digital Communication Systems (Spring 2014) Final Exam Friday, May 2nd, 8:00-10:00am, Marston 220

Analog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals

I. Review of 1D continuous and discrete convolution. A. Continuous form: B. Discrete form: C. Example interface and review:

Module 18 Discrete Time Signals and Z-Transforms Objective: Introduction : Description: Discrete Time Signal representation

The Discrete-Time Fourier Transform (DTFT)

Wave Phenomena Physics 15c

Signal Processing in Mechatronics

Orthogonal Gaussian Filters for Signal Processing

CHM 424 EXAM 2 - COVER PAGE FALL

from definition we note that for sequences which are zero for n < 0, X[z] involves only negative powers of z.

Riemann Sums y = f (x)

radians A function f ( x ) is called periodic if it is defined for all real x and if there is some positive number P such that:

Signals & Systems Chapter3

6.003 Homework #3 Solutions

Ma 530 Introduction to Power Series

ADVANCED DIGITAL SIGNAL PROCESSING

Chapter 2 Systems and Signals

1the 1it is said to be overdamped. When 1, the roots of

DIGITAL SIGNAL PROCESSING LECTURE 3

2D DSP Basics: Systems Stability, 2D Sampling

Expectation and Variance of a random variable

FIR Filter Design: Part I

COMM 602: Digital Signal Processing

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

Discrete Fourier Transform

Olli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5


6.003: Signal Processing

Exam. Notes: A single A4 sheet of paper (double sided; hand-written or computer typed)

Chapter 7: The z-transform. Chih-Wei Liu

Apply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.

MAT1026 Calculus II Basic Convergence Tests for Series

CALCULUS BASIC SUMMER REVIEW

Lecture 2 Linear and Time Invariant Systems

Discrete-Time Signals and Systems. Signals and Systems. Digital Signals. Discrete-Time Signals. Operations on Sequences: Basic Operations

Vibratory Motion. Prof. Zheng-yi Feng NCHU SWC. National CHung Hsing University, Department of Soil and Water Conservation

Run-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE

2. Fourier Series, Fourier Integrals and Fourier Transforms

Digital signal processing: Lecture 5. z-transformation - I. Produced by Qiangfu Zhao (Since 1995), All rights reserved

10-701/ Machine Learning Mid-term Exam Solution

Quiz No. 1. ln n n. 1. Define: an infinite sequence A function whose domain is N 2. Define: a convergent sequence A sequence that has a limit

M2.The Z-Transform and its Properties

EEO 401 Digital Signal Processing Prof. Mark Fowler

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and

Module 11: Applications : Linear prediction, Speech Analysis and Speech Enhancement Prof. Eliathamby Ambikairajah Dr. Tharmarajah Thiruvaran School

T Signal Processing Systems Exercise material for autumn Solutions start from Page 16.

Image pyramid example

Math 140A Elementary Analysis Homework Questions 3-1

LECTURE 21. DISCUSSION OF MIDTERM EXAM. θ [0, 2π). f(θ) = π θ 2

First, note that the LS residuals are orthogonal to the regressors. X Xb X y = 0 ( normal equations ; (k 1) ) So,

LING 439/539 notes: Digital signal processing

Transcription:

Aoucemets EE3 Digital Sigal Processig Last time: FF oday: Frequecy aalysis with DF Widowig Effect of zero-paddig Lecture 9 based o slides by J.M. Kah Spectral Aalysis with the DF Spectral Aalysis with the DF he DF ca be used to aalyze the spectrum of a sigal. It would seem that this should be simple, take a block of the sigal ad compute the spectrum with the DF. Cosider these steps of processig cotiuous-time sigals: However, there are may importat issues ad tradeo s: Sigal duratio vs spectral resolutio Sigal samplig rate vs spectral rage Spectral samplig rate Spectral artifacts Sprig, EE3 Digital Sigal Processig Sprig, EE3 Digital Sigal Processig Spectral Aalysis with the DF wo importat tools: Applyig a widow to the iput sigal reduces spectral artifacts Paddig iput sigal with zeros icreases the spectral samplig Key Parameters: Parameter Symbol Uits Samplig iterval s Samplig frequecy s = rad/s Widow legth L uitless Widow duratio L s DF legth N L uitless DF duratio N s Spectral resolutio s L = L rad/s Spectral samplig iterval rad/s s N = N Filtered Cotiuous-ime Sigal We cosider a example: x c (t) = A cos! t + A cos! t X c (j ) = A [ (! )+ ( +! )] + A [ (! )+ ( +! )] x c (t) C Sigal x c (t), - < t <, / = 3. Hz, / =. Hz.. -. - -.... t (s) F of Origial C Sigal (heights represet areas of () Ω impulses) X c (j) 3. 3... - - Ω/ (Hz) Sprig, EE3 Digital Sigal Processig Sprig, EE3 Digital Sigal Processig

Sampled Filtered Cotiuous-ime Sigal Sampled Filtered Cotiuous-ime Sigal Sampled Sigal If we sampled the sigal over a ifiite time duratio, we would have: x[] =x c (t) t=, < < described by the discrete-time Fourier trasform: X (e j )= X r= X c j r, < < Recall X (e j! )=X (e j ), where! =... more i ch. I the examples show here, the samplig rate is s / =/ = Hz, su cietly high that aliasig does ot occur. x[].. -. - -. Sampled Sigal, x[] = x c (), - < <, / = Hz DF of Sampled Sigal (heights represet areas of () Ω impulses) X(e j ) 7 3 - - / (Hz) Sprig, EE3 Digital Sigal Processig Sprig, EE3 Digital Sigal Processig Widowed Sampled Sigal Widowed Sampled Sigal Block of L Sigal Samples I ay real system, we sample oly over a fiite block of L samples: x[] =x c (t) t=, apple apple L his simply correspods to a rectagular widow of duratio L. Recall: i Homework we explored the e ect of rectagular ad triagular widowig Widowed Block of L Sigal Samples We take the block of sigal samples ad multiply by a widow of duratio L, obtaiig: v[] =x[] w[], apple apple L Suppose the widow w[] hasdfw (e j! ). he the widowed block of sigal samples has a DF give by the periodic covolutio betwee X (e j! )adw(e j! ): V (e j! )= Z X (e j )W (e j(! ) )d Sprig, EE3 Digital Sigal Processig Sprig, EE3 Digital Sigal Processig Widowed Sampled Sigal Widows (as defied i MALAB) Name(s) Defiitio MALAB Commad Graph (M = ) boxcar(m+), M = Covolutio with W (e j! )hastwoe ects i the spectrum: It limits the spectral resolutio. Mai lobes of the DF of the widow he widow ca produce spectral leakage. Side lobes of the DF of the widow Rectagular Boxcar Fourier riagular w M M M w M M boxcar(m+) triag(m+) w[] w[].... - triag(m+), M =.... * hese two are always a tradeo -time-frequecyucertaity priciple - bartlett(m+), M = Bartlett w M M M bartlett(m+) w[].... - Sprig, EE3 Digital Sigal Processig Sprig, EE3 Digital Sigal Processig

Widows (as defied i MALAB) Widows Name(s) Defiitio MALAB Commad Graph (M = ) Ha cos w M M M ha(m+) w[].... ha(m+), M = - haig(m+), M = All of the widow fuctios w[] are real ad eve. All of the discrete-time Fourier trasforms W (e j! )= M X = M w[]e j! Haig Hammig cos w M M M..cos w M M M haig(m+) hammig(m+) w[] w[].... - hammig(m+), M =.... are real, eve, ad periodic i! with period. I the followig plots, we have ormalized the widows to uit d.c. gai: M X W (e j )= w[] = = M his makes it easier to compare widows. - Sprig, EE3 Digital Sigal Processig Sprig, EE3 Digital Sigal Processig Widow Example Widows Properties W (e j ) W (e j ) M = Boxcar riagular.... -.... 3 M = Haig Hammig.... -.... 3 log W (e j ) log W (e j ) - - -3 - - - M = Boxcar riagular -7... 3 - - -3 - - - M = Haig Hammig -7... 3 hese are characteristic of the widow type Widow Mai-lobe Sidelobe s Sidelobe log s Rect.9 M + Bartlett. M + Ha.3 M + Hammig. 3 M + Blackma. 7 M + Most of these (Bartlett, Ha, Hammig) have a trasitio width that is twice that of the rect widow. Warig: Always check what s the defiitio of M Adapted from ACourseIDigitalSigalProcessigby Boaz Porat, Wiley, 997 Sprig, EE3 Digital Sigal Processig Sprig, EE3 Digital Sigal Processig Widows Examples Widows Examples Here we cosider several examples. As before, the samplig rate is s / =/ = Hz. Rectagular Widow, L = 3 w[]...... Rectagular Widow, L = 3 3 Sampled, Widowed Sigal, Rectagular Widow, L = 3 W(e j ) 3 3 DF of Rectagular Widow - - Ω/ (Hz) DF of Sampled, Widowed Sigal riagular Widow, L = 3 w[]...... 3 riagular Widow, L = 3 Sampled, Widowed Sigal, riagular Widow, L = 3 W(e j ) - - / (Hz) DF of riagular Widow DF of Sampled, Widowed Sigal v[]. -. V(e j ) v[]. -. V(e j ) - - -. -. 3 - - / (Hz) 3 - - / (Hz) Sprig, EE3 Digital Sigal Processig Sprig, EE3 Digital Sigal Processig

Widows Examples Widows Examples Hammig Widow, L = 3 Hammig Widow, L =. Hammig Widow, L = 3 DF of Hammig Widow. Hammig Widow, L = DF of Hammig Widow w[].... W(e j ) w[].... W(e j ) 3 3. 3 Sampled, Widowed Sigal, Hammig Widow, L = 3 - - / (Hz) DF of Sampled, Widowed Sigal. 3 Sampled, Widowed Sigal, Hammig Widow, L = - - / (Hz) DF of Sampled, Widowed Sigal v[]. -. V(e j ) v[]. -. V(e j ) - - -. 3 - - / (Hz) -. 3 - - / (Hz) Sprig, EE3 Digital Sigal Processig Sprig, EE3 Digital Sigal M. Lustig, Processig EECS UC Berkeley Optimal Widow: Kaiser Miimum mai-lobe width for a give sidelobe eergy % R sidelobes H(ej! ) d! R H(ej! ) d! Example y = si(.99)+. si(.) apple < Widow is parametrized with L ad β β determies side-lobe level L determies mai-lobe width OS Eq. Example Zero-Paddig I preparatio for takig a N-poit DF, we may zero-pad the widowed block of sigal samples to a block legth N L: ( v[] apple apple L L apple apple N his zero-paddig has o e ect o the DF of v[], sice the DF is computed by summig over < <. E ect of Zero Paddig We take the N-poit DF of the zero-padded v[], to obtai the block of N spectral samples: V [k], apple k apple N Sprig, EE3 Digital Sigal Processig

Zero-Paddig Cosider the DF of the zero-padded v[]. Sice the zero-padded v[] is of legth N, its DF ca be writte: V (e j! )= v[]e j!, <! < = he N-poit DF of v[] is give by: V [k] = v[]w k = N = N X v[]e j( /N)k, apple k apple N = We see that V [k] correspods to the samples of V (e j! ): V [k] =V (e j! )!=k, apple k apple N N o obtai samples at more closely spaced frequecies, we zero-pad v[] to loger block legth N. he spectrum is the same, we just have more samples. Frequecy Aalysis with DF Note that the orderig of the DF samples is uusual. V [k] = v[]wn k = he DC sample of the DF is k = V [] = v[]w = N = N X v[] = he positive frequecies are the first N/ samples he first N/ egative frequecies are circularly shifted (( k)) N = N k so they are the last N/ samples. (Use fftshift to reorder) Sprig, EE3 Digital Sigal Processig Sprig, EE3 Digital Sigal Processig Frequecy Aalysis with DF Examples: Hammig Widow, L = 3, N = 3 Frequecy Aalysis with DF Examples: Hammig Widow, L = 3, Zero-Padded to N = Sampled, Widowed Sigal, Hammig Widow, L = 3, Zero-Padded to N = 3 N-Poit DF of Sampled, Widowed, Zero-Padded Sigal Sampled, Widowed Sigal, Hammig Widow, L = 3, Zero-Padded to N = N-Poit DF of Sampled, Widowed, Zero-Padded Sigal.. Zero-Padded v[]. -. - -. V[k] Zero-Padded v[]. -. - -. V[k] 3 3 k 3 3 k Spectrum of Sampled, Widowed, Zero-Padded Sigal Spectrum of Sampled, Widowed, Zero-Padded Sigal V(e j ) V[k], k = k/n V(e j ) V[k], k = k/n V[k], V(e j ) V[k], V(e j ) / (Hz) / (Hz) Sprig, EE3 Digital Sigal Processig Sprig, EE3 Digital Sigal Processig idf Rect widow idf

Frequecy Aalysis with DF Legth of widow determies spectral resolutio ype of widow determies side-lobe amplitude. (Some widows have better tradeo betwee resolutio-sidelobe) A yo pt with a history of lower limb weakess referred for mri screeig of brai ad whole spie for cord. MRI sagittal screeig of dorsal regio shows a fait uiform liear high sigal at the ceter of the cord. he sigal abormality likely to represet: Zero-paddig approximates the DF better. Does ot itroduce ew iformatio! () Cord demyeliatio. () Syrix (spial cord disease). (3) Artifact. Aswer : Its a artifact, kow as trucatio or Gibbs artifact http://www.euroradiologycases.com Sprig, EE3 Digital Sigal Processig Potetial Problems ad Solutios Potetial Problems ad Solutios Problem Possible Solutios. Spectral error a. Filter sigal to reduce frequecy cotet above s/ = /. from aliasig Ch. b. Icrease samplig frequecy s = /.. Isu ciet frequecy a. Icrease L resolutio. b. Use widow havig arrow mai lobe. 3. Spectral error a. Use widow havig low side lobes. from leakage b. Icrease L. Missig features a. Icrease L, due to spectral samplig. b. Icrease N by zero-paddig v[] to legth N > L. Sprig, EE3 Digital Sigal Processig