Fall 2011, EE123 Digital Signal Processing
|
|
- Annabelle Crawford
- 5 years ago
- Views:
Transcription
1 Lecture 5 Miki Lustig, UCB September 14, 211 Miki Lustig, UCB
2 Motivatios for Discrete Fourier Trasform Sampled represetatio i time ad frequecy umerical Fourier aalysis requires a Fourier represetatio that is sampled i time ad frequecy Samplig i oe domai correspods to periodicity i the other domai Hece, we wat a represetatio that is discrete ad period i both time ad frequecy This is the discrete-time Fourier series or, equivaletly, the discrete Fourier trasform However, we are ofte dealig with sigals that are ot periodic, but still usig the DFT This requires special cosideratios
3 Motivatios for Discrete Fourier Trasform Efficiet Implemetios Very efficiet implemetatios of the discrete Fourier trasform exist Direct evaluatio of DFT: O( 2 ) Fast Fourier Trasform (FFT) algorithms: O( log 2 ) FFT algorithms are most straightforward for = 2 m MATLAB commads: X=fft(x) x=ifft(x) Covolutio ca be implemeted efficietly usig the FFT Direct covolutio: O( 2 ) FFT-based covolutio: O( log 2 )
4 Discrete Fourier Series Defiitio Cosider -periodic sigal: x[ + ] = x[] ad its frequecy-domai represetatio, which is also -periodic: X [k + ] = X [k] k The ~ will idicate a periodic sigal or spectrum
5 Discrete Fourier Series Defie W = e j2π/ x[] ad X [k] are related by the discrete Fourier series: x[] = 1 X [k] = 1 = 1 k= X [k]w k x[]w k
6 Discrete Fourier Trasform By covetio, work with oe period of x[] ad X [k]: { x[] 1 x[] X [k] = = otherwise { X [k] k 1 otherwise From these, if desired, we ca recover the periodic represetatios: x[] = x[(()) ] = x[ r] X [k] = X [((k)) ] = where (()) = mod r= r= X [k r]
7 Discrete Fourier Trasform DFT The discrete Fourier trasform relates x[] ad X [k]: x[] = 1 X [k] = 1 = 1 k= X [k]w k x[]w k Iverse DFT, sythesis DFT, aalysis Although ot stated it explicitly, it is uderstood that x[] = outside 1 X [k] = outside k 1
8 Alterative trasform ot i the book: Orthoormal DFT x[] = X [k] = 1 1 X [k]w k k= 1 1 x[]w k = Iverse DFT, sythesis DFT, aalysis Why use this or the other?
9 DFS vs DFT This figure compares the periodic sigal ad its DFS, x[] DFS X [k], to the correspodig oe-period sigal ad its DFT, x[] DFT X [k] x~!" # 1 X ~!" k #1 k x!" X!" k # 1 #1 k
10 DFT Cotiued Example: Take = 5 X [k] = { 4 = W k 4 k =, 1, 2, 3, 4 otherwise = 5δ[k] What if we take = 1? 5-poit DFT
11 DFT Cotiued Q: What if we take = 1? A: X [k] = X [k] where x[] is a period-1 sequece Ca show: X [k] = { 9 = W k 9 k =, 1, 2, 3, 4 otherwise 4π j = e 1 k si( π 2 k) si( π 1 k) 1-poit DFT
12 DFT vs DTFT The DFT ad the DTFT The -poit DFT of x[] is X [k] = 1 = x[]w k The DTFT of x[] is 1 = = x[]e j(2π/)k k 1 X (e jω ) = 1 = x[]e jω < ω < Comparig these two, we see that the DFT X [k] correspods to the DTFT X (e jω ) sampled at equally spaced frequecies betwee ad 2π: X [k] = X (e jω ) ω=k 2π k 1
13 DFT vs DTFT Back to example: X (e jω ) = 4 = e jω = e j2ω si( 5 2 ω) si( ω 2 )
14 DFT ad IDFT ote that the DFT ad the iverse DFT are computed i very similar fashio If we write x[] as the iverse DFT of X [k], multiply by ad take the complex cojugate: x [] = = ( 1 k= However, we also kow that 1 1 k= X [k]w k = DFT {X [k]} X [k]w k x [] = ( DFT 1 {X [k]} ) )
15 DFT ad IDFT Combiig these two expressios DFT {X [k]} = ( DFT 1 {X [k]} ) or DFT 1 {X [k]} = 1 (DFT {X [k]}) We ca evaluate the iverse DFT by Takig the complex cojugate, Takig the DFT, Multiplyig by 1, ad Takig the complex cojugate
16 DFT as Matrix operator ote that the defiitio of the DFT ad its iverse are equivalet to matrix equatios X [] X [k] X [ 1] = W W W ( 1) W k W k W k( 1) W ( 1) W ( 1) W ( 1)( 1) x[] x[] x[ 1] x[] x[] x[ 1] = 1 W W k W ( 1) W W k W ( 1) W ( 1) W ( 1)k W ( 1)( 1) X [] X [k] X [ 1] This shows that straightforward computatio of the -poit DFT or iverse DFT requires 2 complex multiplies
17 DFT as Matrix operator We ca write this much more compactly as a matrix equatio, X = W x x = 1 W X W is the DFT coefficiet matrix, ad x ad X are colum vectors cotaiig x[] ad X [k], ad is the cojugate traspose ote that sice the colums ad rows of W are orthogoal, ad W W = W W = I where I is the idetity matrix The as we would expect x = 1 W X = 1 W W x = 1 (I) x = x
18 Properties of Discrete Fourier Trasform These are iherited from the discrete-time Fourier series (EE12) ad eed ot be proved (1) Liearity α 1 x 1 [] + α 2 x 2 [] α 1 X 1 [k] + α 2 X 2 [k] (2) Circular Time Shift x[(( m)) ] X [k]e j(2π/)km = X [k]w km
19 Properties of Discrete Fourier Trasform Cot This figure compares a shift of the periodic sequece, x[ m], to a circular shift of the oe-period sequece, x[(( m)) ] x~!" ~ x! # m" # 1 m # 1 x!" x! $ $ # m% % " # 1 m # 1
20 Properties of Discrete Fourier Trasform Cot (3) Circular Frequecy Shift x[]e j(2π/)l = x[]w l X [((k l)) ] (4) Complex Cojugatio x [] X [(( k)) ] (5) Time Reversal ad Complex Cojugatio x [(( )) ] X [k] (6) Cojugate Symmetry for Real Sigals x[] = x [] X [k] = X [(( k)) ]
21 Properties of Discrete Fourier Trasform Cot (7) Parseval s Idetity 1 = x[] 2 = 1 1 k= X [k] 2 Proof This is particularly easy usig the matrix otatio ( ) 1 ( ) 1 x x = W X W X = 1 2 X W W X = 1 }{{} X X I
22 Circular Covolutio Sum Let x 1 [] ad x 2 [] be of legth The circular covolutio betwee x 1 [] ad x 2 [] is defied as: x 1 [] x 2 [] = 1 m= x 1 [m]x 2 [(( m)) ] ote that circular covolutio is commutative: x 2 [] x 1 [] = x 1 [] x 2 []
23 Circular Covolutio Sum The circular covolutio betwee x 1 [] ad x 2 [] is same as oe period of the periodic covolutio betwee the correspodig periodic sequeces x 1 [] ad x 2 []: { 1 m= x 1 [] x 2 [] = x 1[m] x 2 [ m] 1 otherwise This is illustrated i below: ~! " % ~ x! " x1 2 $ 1 # $ 1 m% 1 2 ~ x! m" ~ x! $ m" $ 1! " x! " x % 1 2 $ 1 x! " x! " 1 O 2 $ 1
24 Properties of Discrete Fourier Trasform Cot (8) Circular Covolutio Let x 1 [] ad x 2 [] be of legth x 1 [] x 2 [] X 1 [k] X 2 [k] This property is very useful for DFT-based covolutio (9) Multiplicatio Let x 1 [] ad x 2 [] be of legth x 1 [] x 2 [] 1 X 1[k] X 2 [k]
25 Liear Covolutio usig the DFT We start with two operiodic sequeces: x[] L 1 h[] P 1 We ca thik of x[] as a sigal, ad h[] as a filter ipulse respose We wat to compute the liear covolutio: y[] = x[] h[] = L 1 m= x[m] h[ m] = P 1 m= x[ m]h[m] y[] = x[] h[] is ozero oly for L + P 2, ad is of legth L + P 1 = M
26 Liear Covolutio usig the DFT We will look at two approaches for computig y[]: (1) Direct Covolutio Evaluate the covolutio sum directly This requires L P multiplicatios (2) Usig Circular Covolutio
27 Liear Covolutio usig the DFT (2) Usig Circular Covolutio Zero-pad x[] by P 1 zeros: { x[] L 1 x zp [] = L L + P 2 Zero-pad h[] by L 1 zeros: { h[] P 1 h zp [] = P L + P 2 Both zero-padded sequeces x zp [] ad h zp [] are of legth M = L + P 1
28 Liear Covolutio usig the DFT Both zero-padded sequeces x zp [] ad h zp [] are of legth M = L + P 1 We ca compute the liear covolutio x[] h[] = y[] by computig circular covolutio x zp [] M h zp []: Liear covolutio via circular { x zp [] M h zp [] M 1 y[] = x[] y[] = otherwise
29 Liear Covolutio usig the DFT Example L = P = 4 M = L + P 1 = 7 1 x h x zp h zp For 6, x zp [] 7 h zp [] = x[] * h[]
30 Liear Covolutio usig the DFT I practice, the circular covolutio is implemeted usig the DFT circular covolutio property: x[] h[] = x zp [] M h zp [] = DFT 1 {DFT x zp [] DFT {h zp []}} for M 1, M = L + P 1 Advatage: This ca be more efficiet tha direct liear covolutio because the FFT ad iverse FFT are O(M log 2 M) Drawback: We must wait util we have all of the iput data This itroduces a large delay which is icompatible with real-time applicatios like commuicatios
31 Liear Covolutio usig the DFT I practice, the circular covolutio is implemeted usig the DFT circular covolutio property: x[] h[] = x zp [] M h zp [] = DFT 1 {DFT x zp [] DFT {h zp []}} for M 1, M = L + P 1 Advatage: This ca be more efficiet tha direct liear covolutio because the FFT ad iverse FFT are O(M log 2 M) Drawback: We must wait util we have all of the iput data This itroduces a large delay which is icompatible with real-time applicatios like commuicatios Approach: Break iput ito smaller blocks Combie the results usig 1 overlap ad save or 2 overlap ad add
32 Block Covolutio Problem A iput sigal x[] has very log legth, which ca be cosidered ifiite A impulse respose h[] has legth P We wat to compute the liear covolutio y[] = x[] h[] usig block legths shorter tha the iput sigal legth
33 Block Covolutio Example: Impulse Respose, Legth P = 6 5 h[] Iput Sigal, Legth 33 Liear Covolutio, Legth x[] y[]
34 Overlap-Add Method We decompose the iput sigal x[] ito o-overlappig segmets x r [] of legth L: { x[] rl (r + 1)L 1 x r [] = otherwise The iput sigal is the sum of these iput segmets: x[] = x r [] The output sigal is the sum of the output segmets x r [] h[]: r= y[] = x[] h[] = x r [] h[] (1) r= Each of the output segmets x r [] h[] is of legth = L + P 1
35 Overlap-Add Method We ca compute each output segmet x r [] h[] with liear covolutio DFT-based circular covolutio is usually more efficiet: Zero-pad iput segmet x r [] to obtai x r,zp [], of legth Zero-pad the impulse respose h[] to obtai h zp [], of legth (this eeds to be doe oly oce) Compute each output segmet usig: x r [] h[] = DFT 1 {DFT {x r,zp []} DFT {h zp []}} Sice output segmet x r [] h[] starts offset from its eighbor x r 1 [] h[] by L, eighborig output segmets overlap at P 1 poits Fially, we just add up the output segmets usig (1) to obtai the output
36 Overlap-Add Method Overlap-Add, Iput Segmets, Legth L = 11 Overlap-Add, Output Segmets, Legth L+P-1 = x [] y [] x 1 [] y 1 [] x 2 [] y 2 [] Overlap-Add, Sum of Iput Segmets Overlap-Add, Sum of Output Segmets 5 5 x[] y[]
37 Overlap-Save Method Basic Idea We split the iput sigal x[] ito overlappig segmets x r [] of legth L + P 1 Perform a circular covolutio of each iput segmet x r [] with the impulse respose h[], which is of legth P usig the DFT Idetify the L-sample portio of each circular covolutio that correspods to a liear covolutio, ad save it This is illustrated below where we have a block of L samples circularly covolved with a P sample filter
38 Overlap-Save Method Overlap-Save, Iput Segmets, Legth L = 16 Overlap-Save, Output Segmets, Usable Legth L - P Usable (y []) Uusable x [] y p [] Usable (y 1 []) Uusable x 1 [] y 1p [] Usable (y 2 []) Uusable x 2 [) y 2p [] Overlap-Save, Cocateatio of Usable Output Segmets 5 y[]
EE123 Digital Signal Processing
Aoucemets HW solutios posted -- self gradig due HW2 due Friday EE2 Digital Sigal Processig ham radio licesig lectures Tue 6:-8pm Cory 2 Lecture 6 based o slides by J.M. Kah SDR give after GSI Wedesday
More informationFinite-length Discrete Transforms. Chapter 5, Sections
Fiite-legth Discrete Trasforms Chapter 5, Sectios 5.2-50 5.0 Dr. Iyad djafar Outlie The Discrete Fourier Trasform (DFT) Matrix Represetatio of DFT Fiite-legth Sequeces Circular Covolutio DFT Symmetry Properties
More information2D DSP Basics: 2D Systems
- Digital Image Processig ad Compressio D DSP Basics: D Systems D Systems T[ ] y = T [ ] Liearity Additivity: If T y = T [ ] The + T y = y + y Homogeeity: If The T y = T [ ] a T y = ay = at [ ] Liearity
More informationChapter 8. DFT : The Discrete Fourier Transform
Chapter 8 DFT : The Discrete Fourier Trasform Roots of Uity Defiitio: A th root of uity is a complex umber x such that x The th roots of uity are: ω, ω,, ω - where ω e π /. Proof: (ω ) (e π / ) (e π )
More informationFrequency Domain Filtering
Frequecy Domai Filterig Raga Rodrigo October 19, 2010 Outlie Cotets 1 Itroductio 1 2 Fourier Represetatio of Fiite-Duratio Sequeces: The Discrete Fourier Trasform 1 3 The 2-D Discrete Fourier Trasform
More informationA. Basics of Discrete Fourier Transform
A. Basics of Discrete Fourier Trasform A.1. Defiitio of Discrete Fourier Trasform (8.5) A.2. Properties of Discrete Fourier Trasform (8.6) A.3. Spectral Aalysis of Cotiuous-Time Sigals Usig Discrete Fourier
More informationBlock-by Block Convolution, FFT/IFFT, Digital Spectral Analysis
Lecture 9 Outlie: Block-by Block Covolutio, FFT/IFFT, Digital Spectral Aalysis Aoucemets: Readig: 5: The Discrete Fourier Trasform pp. 3-5, 8, 9+block diagram at top of pg, pp. 7. HW 6 due today with free
More informationThe Discrete Fourier Transform
The iscrete Fourier Trasform The discrete-time Fourier trasform (TFT) of a sequece is a cotiuous fuctio of!, ad repeats with period. I practice we usually wat to obtai the Fourier compoets usig digital
More informationFrequency Response of FIR Filters
EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we itroduce the idea of the frequecy respose of LTI systems, ad focus specifically o the frequecy respose of FIR filters.. Steady-state
More informationLinear time invariant systems
Liear time ivariat systems Alejadro Ribeiro Dept. of Electrical ad Systems Egieerig Uiversity of Pesylvaia aribeiro@seas.upe.edu http://www.seas.upe.edu/users/~aribeiro/ February 25, 2016 Sigal ad Iformatio
More informationSignal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform
Sigal Processig i Mechatroics Summer semester, 1 Lecture 3, Covolutio, Fourier Series ad Fourier rasform Dr. Zhu K.P. AIS, UM 1 1. Covolutio Covolutio Descriptio of LI Systems he mai premise is that the
More informationx[0] x[1] x[2] Figure 2.1 Graphical representation of a discrete-time signal.
x[ ] x[ ] x[] x[] x[] x[] 9 8 7 6 5 4 3 3 4 5 6 7 8 9 Figure. Graphical represetatio of a discrete-time sigal. From Discrete-Time Sigal Processig, e by Oppeheim, Schafer, ad Buck 999- Pretice Hall, Ic.
More informationPractical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement
Practical Spectral Aaysis (cotiue) (from Boaz Porat s book) Frequecy Measuremet Oe of the most importat applicatios of the DFT is the measuremet of frequecies of periodic sigals (eg., siusoidal sigals),
More informationFFTs in Graphics and Vision. The Fast Fourier Transform
FFTs i Graphics ad Visio The Fast Fourier Trasform 1 Outlie The FFT Algorithm Applicatios i 1D Multi-Dimesioal FFTs More Applicatios Real FFTs 2 Computatioal Complexity To compute the movig dot-product
More informationThe 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
The -Trasform 7. Itroductio Geeralie the complex siusoidal represetatio offered by DTFT to a represetatio of complex expoetial sigals. Obtai more geeral characteristics for discrete-time LTI systems. 7.
More informationCh3 Discrete Time Fourier Transform
Ch3 Discrete Time Fourier Trasform 3. Show that the DTFT of [] is give by ( k). e k 3. Determie the DTFT of the two sided sigal y [ ],. 3.3 Determie the DTFT of the causal sequece x[ ] A cos( 0 ) [ ],
More informationEE422G Homework #13 (12 points)
EE422G Homework #1 (12 poits) 1. (5 poits) I this problem, you are asked to explore a importat applicatio of FFT: efficiet computatio of covolutio. The impulse respose of a system is give by h(t) (.9),1,2,,1
More informationDiscrete-Time Systems, LTI Systems, and Discrete-Time Convolution
EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [
More informationFIR Filter Design: Part II
EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we cosider how we might go about desigig FIR filters with arbitrary frequecy resposes, through compositio of multiple sigle-peak
More informationFilter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and
Filter bas Separately, the lowpass ad highpass filters are ot ivertible T removes the highest frequecy / ad removes the lowest frequecy Together these filters separate the sigal ito low-frequecy ad high-frequecy
More informationAdvanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis
265-25 Advaced Traiig Course o FPGA esig ad VHL for Hardware Simulatio ad Sythesis 26 October - 2 ovember, 29 igital Sigal Processig The iscrete Fourier Trasform Massimiliao olich EEI Facolta' di Igegeria
More informationZ - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.
Z - Trasform The -trasform is a very importat tool i describig ad aalyig digital systems. It offers the techiques for digital filter desig ad frequecy aalysis of digital sigals. Defiitio of -trasform:
More informationChapter 7: The z-transform. Chih-Wei Liu
Chapter 7: The -Trasform Chih-Wei Liu Outlie Itroductio The -Trasform Properties of the Regio of Covergece Properties of the -Trasform Iversio of the -Trasform The Trasfer Fuctio Causality ad Stability
More informationThe Discrete Fourier Transform
(7) The Discete Fouie Tasfom The Discete Fouie Tasfom hat is Discete Fouie Tasfom (DFT)? (ote: It s ot DTFT discete-time Fouie tasfom) A liea tasfomatio (mati) Samples of the Fouie tasfom (DTFT) of a apeiodic
More informationELEG3503 Introduction to Digital Signal Processing
ELEG3503 Itroductio to Digital Sigal Processig 1 Itroductio 2 Basics of Sigals ad Systems 3 Fourier aalysis 4 Samplig 5 Liear time-ivariat (LTI) systems 6 z-trasform 7 System Aalysis 8 System Realizatio
More informationADVANCED DIGITAL SIGNAL PROCESSING
ADVANCED DIGITAL SIGNAL PROCESSING PROF. S. C. CHAN (email : sccha@eee.hku.hk, Rm. CYC-702) DISCRETE-TIME SIGNALS AND SYSTEMS MULTI-DIMENSIONAL SIGNALS AND SYSTEMS RANDOM PROCESSES AND APPLICATIONS ADAPTIVE
More informationDefinition of z-transform.
- Trasforms Frequecy domai represetatios of discretetime sigals ad LTI discrete-time systems are made possible with the use of DTFT. However ot all discrete-time sigals e.g. uit step sequece are guarateed
More informationThe Z-Transform. (t-t 0 ) Figure 1: Simplified graph of an impulse function. For an impulse, it can be shown that (1)
The Z-Trasform Sampled Data The geeralied fuctio (t) (also kow as the impulse fuctio) is useful i the defiitio ad aalysis of sampled-data sigals. Figure below shows a simplified graph of a impulse. (t-t
More informationEE Midterm Test 1 - Solutions
EE35 - Midterm Test - Solutios Total Poits: 5+ 6 Bous Poits Time: hour. ( poits) Cosider the parallel itercoectio of the two causal systems, System ad System 2, show below. System x[] + y[] System 2 The
More informationLecture 3: Divide and Conquer: Fast Fourier Transform
Lecture 3: Divide ad Coquer: Fast Fourier Trasform Polyomial Operatios vs. Represetatios Divide ad Coquer Algorithm Collapsig Samples / Roots of Uity FFT, IFFT, ad Polyomial Multiplicatio Polyomial operatios
More information6.003 Homework #3 Solutions
6.00 Homework # Solutios Problems. Complex umbers a. Evaluate the real ad imagiary parts of j j. π/ Real part = Imagiary part = 0 e Euler s formula says that j = e jπ/, so jπ/ j π/ j j = e = e. Thus the
More informationComputing the output response of LTI Systems.
Computig the output respose of LTI Systems. By breaig or decomposig ad represetig the iput sigal to the LTI system ito terms of a liear combiatio of a set of basic sigals. Usig the superpositio property
More informationSolutions. Number of Problems: 4. None. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors.
Quiz November 4th, 23 Sigals & Systems (5-575-) P. Reist & Prof. R. D Adrea Solutios Exam Duratio: 4 miutes Number of Problems: 4 Permitted aids: Noe. Use oly the prepared sheets for your solutios. Additioal
More informationThe Discrete Fourier Transform
The Discrete Fourier Trasform Complex Fourier Series Represetatio Recall that a Fourier series has the form a 0 + a k cos(kt) + k=1 b k si(kt) This represetatio seems a bit awkward, sice it ivolves two
More informationEE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course
Sigal-EE Postal Correspodece Course 1 SAMPLE STUDY MATERIAL Electrical Egieerig EE / EEE Postal Correspodece Course GATE, IES & PSUs Sigal System Sigal-EE Postal Correspodece Course CONTENTS 1. SIGNAL
More informationCOMM 602: Digital Signal Processing
COMM 60: Digital Sigal Processig Lecture 4 -Properties of LTIS Usig Z-Trasform -Iverse Z-Trasform Properties of LTIS Usig Z-Trasform Properties of LTIS Usig Z-Trasform -ve +ve Properties of LTIS Usig Z-Trasform
More informationMAXIMALLY FLAT FIR FILTERS
MAXIMALLY FLAT FIR FILTERS This sectio describes a family of maximally flat symmetric FIR filters first itroduced by Herrma [2]. The desig of these filters is particularly simple due to the availability
More informationLecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016
Lecture 3 Digital Sigal Processig Chapter 3 z-trasforms Mikael Swartlig Nedelko Grbic Begt Madersso rev. 06 Departmet of Electrical ad Iformatio Techology Lud Uiversity z-trasforms We defie the z-trasform
More informationFIR Filter Design: Part I
EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I. Itroductio FIR Filter Desig: Part I I this set o otes, we cotiue our exploratio o the requecy respose o FIR ilters. First, we cosider some
More informationExam. Notes: A single A4 sheet of paper (double sided; hand-written or computer typed)
Exam February 8th, 8 Sigals & Systems (5-575-) Prof. R. D Adrea Exam Exam Duratio: 5 Mi Number of Problems: 5 Number of Poits: 5 Permitted aids: Importat: Notes: A sigle A sheet of paper (double sided;
More informationWarped, Chirp Z-Transform: Radar Signal Processing
arped, Chirp Z-Trasform: Radar Sigal Processig by Garimella Ramamurthy Report o: IIIT/TR// Cetre for Commuicatios Iteratioal Istitute of Iformatio Techology Hyderabad - 5 3, IDIA Jauary ARPED, CHIRP Z
More informationChapter 9 Computation of the Discrete. Fourier Transform
Chapter 9 Coputatio of the Discrete Fourier Trasfor Itroductio Efficiet Coputatio of the Discrete Fourier Trasfor Goertzel Algorith Deciatio-I-Tie FFT Algoriths Deciatio-I-Frequecy FFT Algoriths Ipleetatio
More informationM2.The Z-Transform and its Properties
M2.The Z-Trasform ad its Properties Readig Material: Page 94-126 of chapter 3 3/22/2011 I. Discrete-Time Sigals ad Systems 1 What did we talk about i MM1? MM1 - Discrete-Time Sigal ad System 3/22/2011
More informationECEN 644 HOMEWORK #5 SOLUTION SET
ECE 644 HOMEWORK #5 SOUTIO SET 7. x is a real valued sequece. The first five poits of its 8-poit DFT are: {0.5, 0.5 - j 0.308, 0, 0.5 - j 0.058, 0} To compute the 3 remaiig poits, we ca use the followig
More informationAlgorithms and Data Structures 2014 Exercises and Solutions Week 13
Algorithms ad Data Structures 204 Exercises ad Solutios Week 3 Toom-Cook (cotiued) Durig the last lecture, two polyomials A(x) a 0 + a x ad B(x) b 0 + b x both of degree were multiplied, first by evaluatig
More informationMAS160: Signals, Systems & Information for Media Technology. Problem Set 5. DUE: November 3, (a) Plot of u[n] (b) Plot of x[n]=(0.
MAS6: Sigals, Systems & Iformatio for Media Techology Problem Set 5 DUE: November 3, 3 Istructors: V. Michael Bove, Jr. ad Rosalid Picard T.A. Jim McBride Problem : Uit-step ad ruig average (DSP First
More informationTMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods
TMA4205 Numerical Liear Algebra The Poisso problem i R 2 : diagoalizatio methods September 3, 2007 c Eiar M Røquist Departmet of Mathematical Scieces NTNU, N-749 Trodheim, Norway All rights reserved A
More informationExponential Moving Average Pieter P
Expoetial Movig Average Pieter P Differece equatio The Differece equatio of a expoetial movig average lter is very simple: y[] x[] + (1 )y[ 1] I this equatio, y[] is the curret output, y[ 1] is the previous
More information2 Geometric interpretation of complex numbers
2 Geometric iterpretatio of complex umbers 2.1 Defiitio I will start fially with a precise defiitio, assumig that such mathematical object as vector space R 2 is well familiar to the studets. Recall that
More informationPolynomial Multiplication and Fast Fourier Transform
Polyomial Multiplicatio ad Fast Fourier Trasform Com S 477/577 Notes Ya-Bi Jia Sep 19, 2017 I this lecture we will describe the famous algorithm of fast Fourier trasform FFT, which has revolutioized digital
More information3. 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,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations
ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows
More informationIntroduction to Digital Signal Processing
Fakultät Iformatik Istitut für Systemarchitektur Professur Recheretze Itroductio to Digital Sigal Processig Walteegus Dargie Walteegus Dargie TU Dresde Chair of Computer Networks I 45 Miutes Refereces
More informationGEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING
GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING ECE 06 Summer 07 Problem Set #5 Assiged: Jue 3, 07 Due Date: Jue 30, 07 Readig: Chapter 5 o FIR Filters. PROBLEM 5..* (The
More informationQuestion1 Multiple choices (circle the most appropriate one):
Philadelphia Uiversity Studet Name: Faculty of Egieerig Studet Number: Dept. of Computer Egieerig Fial Exam, First Semester: 2014/2015 Course Title: Digital Sigal Aalysis ad Processig Date: 01/02/2015
More informationPrinciple Of Superposition
ecture 5: PREIMINRY CONCEP O RUCUR NYI Priciple Of uperpositio Mathematically, the priciple of superpositio is stated as ( a ) G( a ) G( ) G a a or for a liear structural system, the respose at a give
More informationChapter 7 z-transform
Chapter 7 -Trasform Itroductio Trasform Uilateral Trasform Properties Uilateral Trasform Iversio of Uilateral Trasform Determiig the Frequecy Respose from Poles ad Zeros Itroductio Role i Discrete-Time
More informationThe z-transform can be used to obtain compact transform-domain representations of signals and systems. It
3 4 5 6 7 8 9 10 CHAPTER 3 11 THE Z-TRANSFORM 31 INTRODUCTION The z-trasform ca be used to obtai compact trasform-domai represetatios of sigals ad systems It provides ituitio particularly i LTI system
More informationSignal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University.
Sigal Processig Lecture 02: Discrete Time Sigals ad Systems Ahmet Taha Koru, Ph. D. Yildiz Techical Uiversity 2017-2018 Fall ATK (YTU) Sigal Processig 2017-2018 Fall 1 / 51 Discrete Time Sigals Discrete
More informationEECE 301 Signals & Systems
EECE 301 Sigals & Systems Prof. Mark Fowler Note Set #8 D-T Covolutio: The Tool for Fidig the Zero-State Respose Readig Assigmet: Sectio 2.1-2.2 of Kame ad Heck 1/14 Course Flow Diagram The arrows here
More informationDigital signal processing: Lecture 5. z-transformation - I. Produced by Qiangfu Zhao (Since 1995), All rights reserved
Digital sigal processig: Lecture 5 -trasformatio - I Produced by Qiagfu Zhao Sice 995, All rights reserved DSP-Lec5/ Review of last lecture Fourier trasform & iverse Fourier trasform: Time domai & Frequecy
More informationSpring 2014, EE123 Digital Signal Processing
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
More informationChapter 3. z-transform
Chapter 3 -Trasform 3.0 Itroductio The -Trasform has the same role as that played by the Laplace Trasform i the cotiuous-time theorem. It is a liear operator that is useful for aalyig LTI systems such
More informationThe z transform is the discrete-time counterpart of the Laplace transform. Other description: see page 553, textbook.
The -Trasform 7. Itroductio The trasform is the discrete-time couterpart of the Laplace trasform. Other descriptio: see page 553, textbook. 7. The -trasform Derivatio of the -trasform: x[] re jω LTI system,
More informationFIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser
FIR Filters Lecture #7 Chapter 5 8 What Is this Course All About? To Gai a Appreciatio of the Various Types of Sigals ad Systems To Aalyze The Various Types of Systems To Lear the Skills ad Tools eeded
More informationChapter 2 Systems and Signals
Chapter 2 Systems ad Sigals 1 Itroductio Discrete-Time Sigals: Sequeces Discrete-Time Systems Properties of Liear Time-Ivariat Systems Liear Costat-Coefficiet Differece Equatios Frequecy-Domai Represetatio
More informationVibratory Motion. Prof. Zheng-yi Feng NCHU SWC. National CHung Hsing University, Department of Soil and Water Conservation
Vibratory Motio Prof. Zheg-yi Feg NCHU SWC 1 Types of vibratory motio Periodic motio Noperiodic motio See Fig. A1, p.58 Harmoic motio Periodic motio Trasiet motio impact Trasiet motio earthquake A powerful
More informationTime-Domain Representations of LTI Systems
2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable
More informationCALCULATING FIBONACCI VECTORS
THE GENERALIZED BINET FORMULA FOR CALCULATING FIBONACCI VECTORS Stuart D Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithacaedu ad Dai Novak Departmet
More information(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:
Math 50-004 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig
More informationChimica Inorganica 3
himica Iorgaica Irreducible Represetatios ad haracter Tables Rather tha usig geometrical operatios, it is ofte much more coveiet to employ a ew set of group elemets which are matrices ad to make the rule
More informationQuantum Computing Lecture 7. Quantum Factoring
Quatum Computig Lecture 7 Quatum Factorig Maris Ozols Quatum factorig A polyomial time quatum algorithm for factorig umbers was published by Peter Shor i 1994. Polyomial time meas that the umber of gates
More informationOlli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5
Sigals ad Systems Sigals ad Systems Sigals are variables that carry iformatio Systemstake sigals as iputs ad produce sigals as outputs The course deals with the passage of sigals through systems T-6.4
More informationDiscrete-time signals and systems See Oppenheim and Schafer, Second Edition pages 8 93, or First Edition pages 8 79.
Discrete-time sigals ad systems See Oppeheim ad Schafer, Secod Editio pages 93, or First Editio pages 79. Discrete-time sigals A discrete-time sigal is represeted as a sequece of umbers: x D fxœg; <
More informationAssignment 2 Solutions SOLUTION. ϕ 1 Â = 3 ϕ 1 4i ϕ 2. The other case can be dealt with in a similar way. { ϕ 2 Â} χ = { 4i ϕ 1 3 ϕ 2 } χ.
PHYSICS 34 QUANTUM PHYSICS II (25) Assigmet 2 Solutios 1. With respect to a pair of orthoormal vectors ϕ 1 ad ϕ 2 that spa the Hilbert space H of a certai system, the operator  is defied by its actio
More informationThe Discrete-Time Fourier Transform (DTFT)
EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) The Discrete-Time Fourier Trasorm (DTFT). Itroductio I these otes, we itroduce the discrete-time Fourier trasorm (DTFT) ad
More informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004.
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Departmet of Electrical Egieerig ad Computer Sciece 6.34 Discrete Time Sigal Processig Fall 24 BACKGROUND EXAM September 3, 24. Full Name: Note: This exam is closed
More informationIntroduction to Signals and Systems, Part V: Lecture Summary
EEL33: Discrete-Time Sigals ad Systems Itroductio to Sigals ad Systems, Part V: Lecture Summary Itroductio to Sigals ad Systems, Part V: Lecture Summary So far we have oly looked at examples of o-recursive
More informationSignal Processing in Mechatronics
Sigal Processig i Mechatroics Zhu K.P. AIS, UM. Lecture, Brief itroductio to Sigals ad Systems, Review of Liear Algebra ad Sigal Processig Related Mathematics . Brief Itroductio to Sigals What is sigal
More informationChapter 2. Simulation Techniques. References:
Simulatio Techiques Refereces: Chapter 2 S.M.Kay, Fudametals of Statistical Sigal Processig: Estimatio Theory, Pretice Hall, 993 C.L.Nikias ad M.Shao, Sigal Processig with Alpha-Stable Distributio ad Applicatios,
More informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Problem Set 11 Solutions.
Massachusetts Istitute of Techology Departmet of Electrical Egieerig ad Computer Sciece Issued: Thursday, December 8, 005 6.341: Discrete-Time Sigal Processig Fall 005 Problem Set 11 Solutios Problem 11.1
More informationModule 18 Discrete Time Signals and Z-Transforms Objective: Introduction : Description: Discrete Time Signal representation
Module 8 Discrete Time Sigals ad Z-Trasforms Objective:To uderstad represetig discrete time sigals, apply z trasform for aalyzigdiscrete time sigals ad to uderstad the relatio to Fourier trasform Itroductio
More informationNotes 20 largely plagiarized by %khc
1 Notes 20 largely plagiarized by %khc 1 Warig This set of otes covers discrete time. However, i probably wo t be able to talk about everythig here; istead i will highlight importat properties or give
More informationWritten exam Digital Signal Processing for BMT (8E070). Tuesday November 1, 2011, 09:00 12:00.
Techische Uiversiteit Eidhove Fac. Biomedical Egieerig Writte exam Digital Sigal Processig for BMT (8E070). Tuesday November, 0, 09:00 :00. (oe page) ( problems) Problem. s Cosider a aalog filter with
More informationDiscrete-Time Signals and Systems. Signals and Systems. Digital Signals. Discrete-Time Signals. Operations on Sequences: Basic Operations
-6.3 Digital Sigal Processig ad Filterig..8 Discrete-ime Sigals ad Systems ime-domai Represetatios of Discrete-ime Sigals ad Systems ime-domai represetatio of a discrete-time sigal as a sequece of umbers
More informationSolution of EECS 315 Final Examination F09
Solutio of EECS 315 Fial Examiatio F9 1. Fid the umerical value of δ ( t + 4ramp( tdt. δ ( t + 4ramp( tdt. Fid the umerical sigal eergy of x E x = x[ ] = δ 3 = 11 = ( = ramp( ( 4 = ramp( 8 = 8 [ ] = (
More informationFall 2011, EE123 Digital Signal Processing
Lecture 6 Miki Lustig, UCB September 11, 2012 Miki Lustig, UCB DFT and Sampling the DTFT X (e jω ) = e j4ω sin2 (5ω/2) sin 2 (ω/2) 5 x[n] 25 X(e jω ) 4 20 3 15 2 1 0 10 5 1 0 5 10 15 n 0 0 2 4 6 ω 5 reconstructed
More informationWavelet Transform and its relation to multirate filter banks
Wavelet Trasform ad its relatio to multirate filter bas Christia Walliger ASP Semiar th Jue 007 Graz Uiversity of Techology, Austria Professor Georg Holzma, Horst Cerja, Christia 9..005 Walliger.06.07
More informationSpring 2014, EE123 Digital Signal Processing
Aoucemets EE3 Digital Sigal Processig Lecture 9 Lab part I ad II posted will post III today or tomorrow Lab-bash uesday -3pm Cory hree shorter Midterms: / i class / i class /3 (or BD) i class / or / (BD)
More information5.1 Review of Singular Value Decomposition (SVD)
MGMT 69000: Topics i High-dimesioal Data Aalysis Falll 06 Lecture 5: Spectral Clusterig: Overview (cotd) ad Aalysis Lecturer: Jiamig Xu Scribe: Adarsh Barik, Taotao He, September 3, 06 Outlie Review of
More informationECE4270 Fundamentals of DSP. Lecture 2 Discrete-Time Signals and Systems & Difference Equations. Overview of Lecture 2. More Discrete-Time Systems
ECE4270 Fudametals of DSP Lecture 2 Discrete-Time Sigals ad Systems & Differece Equatios School of ECE Ceter for Sigal ad Iformatio Processig Georgia Istitute of Techology Overview of Lecture 2 Aoucemet
More informationDigital Signal Processing
Digital Sigal Processig Z-trasform dftwave -Trasform Backgroud-Defiitio - Fourier trasform j ω j ω e x e extracts the essece of x but is limited i the sese that it ca hadle stable systems oly. jω e coverges
More informationLet A(x) and B(x) be two polynomials of degree n 1:
MI-EVY (2011/2012) J. Holub: 4. DFT, FFT ad Patter Matchig p. 2/42 Operatios o polyomials MI-EVY (2011/2012) J. Holub: 4. DFT, FFT ad Patter Matchig p. 4/42 Efficiet Patter Matchig (MI-EVY) 4. DFT, FFT
More informationChapter 4 : Laplace Transform
4. Itroductio Laplace trasform is a alterative to solve the differetial equatio by the complex frequecy domai ( s = σ + jω), istead of the usual time domai. The DE ca be easily trasformed ito a algebraic
More informationRun-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE
Geeral e Image Coder Structure Motio Video (s 1,s 2,t) or (s 1,s 2 ) Natural Image Samplig A form of data compressio; usually lossless, but ca be lossy Redudacy Removal Lossless compressio: predictive
More informationInverse Matrix. A meaning that matrix B is an inverse of matrix A.
Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix
More informationSpectral Analysis. This week in lab. Next classes: 3/26 and 3/28. Your next experiment Homework is to prepare
Spectral Aalysis This week i lab Your ext experimet Homework is to prepare Next classes: 3/26 ad 3/28 Aero Testig, Fracture Toughess Testig Read the Experimets 5 ad 7 sectios of the course maual Spectral
More informationT Signal Processing Systems Exercise material for autumn Solutions start from Page 16.
T-6.40 P (Problems&olutios, autum 003) Page / 9 T-6.40 P (Problems&olutios, autum 003) Page / 9 T-6.40 igal Processig ystems Exercise material for autum 003 - olutios start from Page 6.. Basics of complex
More informationSignals & Systems Chapter3
Sigals & Systems Chapter3 1.2 Discrete-Time (D-T) Sigals Electroic systems do most of the processig of a sigal usig a computer. A computer ca t directly process a C-T sigal but istead eeds a stream of
More information