General Synthesis Model. Time Domain Methods in Speech Processing. General Analysis Model. Overview. Basics. Fundamental Assumptions

Size: px
Start display at page:

Download "General Synthesis Model. Time Domain Methods in Speech Processing. General Analysis Model. Overview. Basics. Fundamental Assumptions"

Transcription

1 Geeral ythesis Model Digital peech Processig Lectures 7-8 T T voiced soud amplitude Log Areas, Reflectio Coefficiets, Formats, Vocal Tract Polyomial, Articulatory Parameters, Time Domai Methods i peech Processig uvoiced soud amplitude Rz ( ) = α z Pitch Detectio, Voiced/Uvoiced/ilece Detectio, Gai Estimatio, Vocal Tract Parameter Estimatio, Glottal Pulse hape, Radiatio Model s[] Geeral Aalysis Model peech Aalysis Model Pitch Period, T[] Glottal Pulse hape, g[] Voiced Amplitude, A V [] V/U/[] witch Uvoiced Amplitude, A U [] Vocal Tract IR, v[] Radiatio Characteristic, r[] All aalysis parameters are time-varyig at rates commesurate with iformatio i the parameters; speech, x[] Overview igal Processig represetatio of speech speech or music A(x,t) formats reflectio coefficiets voiced-uvoiced-silece pitch souds of laguage speaker idetificatio emotios time domai processig => direct operatios o the speech waveform frequecy domai processig => direct operatios o a spectral represetatio of the sigal We eed algorithms for estimatig the aalysis simple processig parameters ad their variatios over time 3 eables various types of feature estimatio 4 x[] system zero crossig rate level crossig rate eergy autocorrelatio P P V U/ Basics 8 khz sampled speech (badwidth < 4 khz) properties of speech chage with time excitatio goes from voiced to uvoiced peak amplitude varies with the soud beig produced pitch varies withi ad across voiced souds periods of silece where backgroud sigals are see the key issue is whether we ca create simple time-domai processig methods that eable us to measure/estimate speech represetatios reliably ad accurately5 Fudametal Assumptios properties of the speech sigal chage relatively slowly with time (5- souds per secod) over very short (5- msec) itervals => ucertaity due to small amout of data, varyig pitch, varyig amplitude over medium legth (- msec) itervals => ucertaity due to chages i soud quality, trasitios betwee souds, rapid trasiets i speech over log (-5 msec) itervals => ucertaity due to large amout of soud chages there is always ucertaity i short time measuremets ad estimates from speech 6 sigals

2 Compromise olutio short-time processig methods => short segmets of the speech sigal are isolated ad processed as if they were short segmets from a sustaied soud with fixed (o-time-varyig) properties this short-time processig is periodically repeated for the duratio of the waveform these short aalysis segmets, or aalysis frames almost always overlap oe aother the results of short-time processig ca be a sigle umber (e.g., a estimate of the pitch period withi the frame), or a set of umbers (a estimate of the format frequecies for the aalysis frame) the ed result of the processig is a ew, time-varyig sequece that serves as a ew represetatio of the speech sigal 7 Frame-by-Frame Processig i uccessive Widows Frame Frame Frame 3 Frame 4 Frame 5 75% frame overlap => frame legth=l, frame shift=r=l/4 Frame={x[],x[],,x[L-]} Frame={x[R],x[R+],,x[R+L-]} Frame3={x[R],x[R+],,x[R+L-]} 8 Frame : samples,,..., L Frame-by-Frame Processig i uccessive Widows Frame : samples RR, +,..., R+ L Frame 3: samples R, R+,..., R+ L Frame Frame Frame 3 Frame 4 5% frame overlap Frame 4: samples 3 R,3R+,...,3R+ L peech is processed frame-by-frame i overlappig itervals util etire regio of speech is covered by at least oe such frame Results of aalysis of idividual frames used to derive model parameters i some maer Represetatio goes from time sample x[ ], = L,,,,L to parameter vector f[ m], m =,,,L where is the time idex ad m is the frame idex. Frames ad Widows hort-time Processig speech waveform, x[] short-time processig speech represetatio, f[m] F = 6, samples/secod L = 64 samples (equivalet to 4 msec frame (widow) legth) R = 4 samples (equivalet to 5 msec frame (widow) shift) Frame rate of 66.7 frames/secod x [ ] = samples at 8/sec rate; (e.g. secods of 4 khz badlimited speech, x [ ], 6) r f[ m] = f [ m], f [ m],..., f [ m] = vectors at /sec rate, m, { L } L is the size of the aalysis vector (e.g., for pitch period estimate, for autocorrelatio estimates, etc)

3 Geeric hort-time Processig hort-time Eergy x[] Q = T([ x m]) w% [ m] T(x[]) ~ T( ) w[] liear or o-liear trasformatio m= = widow sequece (usually fiite legth) Q Q is a sequece of local weighted average values of the sequece T(x[]) at time = 3 E = m= x m [ ] -- this is the log term defiitio of sigal eergy -- there is little or o utility of this defiitio for time-varyig sigals E = x m m= L+ [ ] = x [ L+ ] x [ ] -- short-time eergy i viciity of time T( x) = x w % [ ] = L = otherwise 4 Computatio of hort-time Eergy L+ w %[ m] widow jumps/slides across sequece of squared values, selectig iterval for processig what happes to E as sequece jumps by,4,8,...,l samples ( E is a lowpass fuctio so it ca be decimated without lost of iformatio; why is E lowpass?) effects of decimatio deped o L; if L is small, the E is a lot more variable tha if L is large (widow badwidth chages with L!) 5 Effects of Widow Q = ( [ ]) % T x w[ ] = x [ ] w% [ ] = = w %[ ] serves as a lowpass filter o T([]) x which ofte has a lot of high frequecies (most o-liearities itroduce sigificat high frequecy eergy thik of what ( x[ ] x[ ] ) does i frequecy) ofte we exted the defiitio of Q to iclude a pre-filterig term so that x[ ] itself is filtered to a regio of iterest x[ ] x[ ] T([]) x Q = Q Liear = T ( ) w %[ ] Filter 6 hort-time Eergy serves to differetiate voiced ad uvoiced souds i speech from silece (backgroud sigal) atural defiitio of eergy of weighted sigal is: E = x[ m] w% [ m] (sum or squares of portio of sigal) m= -- cocetrates measuremet at sample, usig weightig w% [ -m ] x[] F E = x [ m] w% [ m] = x [ m] h[ m] m= m= h [ ] = w% [ ] short time eergy ( ) x [] E = E = h[] F F / R 7 hort-time Eergy Properties depeds o choice of h[], or equivaletly, ~ widow w[] if w[] duratio very log ad costat amplitude ~ (w[]=, =,,...,L-), E would ot chage much over time, ad would ot reflect the short-time amplitudes of the souds of the speech very log duratio widows correspod to arrowbad lowpass filters wat E to chage at a rate comparable to the chagig souds of the speech => this is the essetial coflict i all speech processig, amely we eed short duratio widow to be resposive to rapid soud chages, but short widows will ot provide sufficiet averagig to give smooth ad reliable eergy fuctio 8 3

4 Widows ~ cosider two widows, w[] rectagular widow: h[]=, L- ad otherwise Hammig widow (raised cosie widow): h[]= cos(π/(l-)), L- ad otherwise rectagular widow gives equal weight to all L samples i the widow (,...,-L+) Hammig widow gives most weight to middle samples ad tapers off strogly at the begiig ad the ed of the widow Rectagular ad Hammig Widows L = samples 9 Widow Frequecy Resposes rectagular widow si( ΩLT / ) He ( ) = e si( ΩT / ) jωt jωt( L )/ first zero occurs at f=f s /L=/(LT) (or Ω=(π)/(LT)) => omial cutoff frequecy of the equivalet lowpass filter Hammig widow w% [ ] =.54 % [ ].46*cos( π / ( )) % H wr L wr[ ] ca decompose Hammig Widow FR ito combiatio of three terms RW ad HW Frequecy Resposes log magitude respose of RW ad HW badwidth of HW is approximately twice the badwidth of RW atteuatio of more tha 4 db for HW outside passbad, versus 4 db for RW stopbad atteuatio is essetially idepedet of L, the widow duratio => icreasig L simply decreases widow badwidth L eeds to be larger tha a pitch period (or severe fluctuatios will occur i E ), but smaller tha a soud duratio (or E will ot adequately reflect the chages i the speech sigal) There is o perfect value of L, sice a pitch period ca be as short as samples (5 Hz at a khz samplig rate) for a high pitch child or female, ad up to 5 samples (4 Hz pitch at a khz samplig rate) for a low pitch male; a compromise value of L o the order of - samples for a khz samplig rate is ofte used i practice Widow Frequecy Resposes hort-time Eergy hort-time eergy computatio: Rectagular Widows, L=,4,6,8, Hammig Widows, L=,4,6,8, 3 E = ([ x m][ w m]) m= = xm w % m m= m= L+ ([ ]) [ ] For L-poit rectagular widow, wm %[ ] =, m=,,..., L givig E = ([ x m]) 4 4

5 hort-time Eergy usig RW/HW E L=5 L= L= L=4 L=5 L= L= L=4 as L icreases, the plots ted to coverge (however you are smoothig soud eergies) short-time eergy provides the basis for distiguishig voiced from uvoiced speech regios, ad for medium-to-high NR recordigs, ca eve be used to fid regios of 5 silece/backgroud sigal E hort-time Eergy for AGC Ca use a IIR filter to defie short-time eergy, e.g., time-depedet eergy defiitio = m= m= σ [ ] x [ m] h[ m]/ h[ m] cosider impulse respose of filter of form h [ ] = α u [ ] = α = < m m= σ [ ] = ( α) x [ m] α u[ m ] 6 Recursive hort-time Eergy u [ m ] implies the coditio m or m givig m σ [ ] = ( α) x [ m] α = ( α)( x [ ] + αx [ ] +...) m= for the idex we have m σ [ ] = ( α) x [ m] α = ( α)( x [ ] + αx [ 3] +...) m= thus givig the relatioship [ ] [ ] [ ]( ) σ = α σ + x α ad defies a Automatic Gai Cotrol (AGC) of the form G G [ ] = σ [ ] 7 Recursive hort-time Eergy σ [ ] = x [ ] h[ ] h [ ] = ( αα ) u [ ] σ ( z) = X ( z) H( z) ( ) = [ ] = ( αα ) [ ] Hz hz u z = m = = = = ( αα ) z ( + ) m m m m Hz ( ) = ( αα ) z = ( α) z α z m= m= = = = ( α) z m α z m= ( α) z αz σ ( z)/ X ( z) m σ [ ] = ασ [ ] + ( α) x ( ) 8 Recursive hort-time Eergy Recursive hort-time Eergy x [] σ ( ) x [ ] [ ] z + ( α) σ [ ] z α σ [ ] = α σ [ ] + x [ ]( α) 9 3 5

6 Use of hort-time Eergy for AGC Use of hort-time Eergy for AGC α =.9 α = hort-time Magitude short-time eergy is very sesitive to large sigal levels due to x [] terms cosider a ew defiitio of pseudo-eergy based o average sigal magitude (rather tha eergy) M = [ ] %[ xm w m] m= weighted sum of magitudes, rather tha weighted sum of squares x[] x[] M = M = F w %[ ] F F / R computatio avoids multiplicatios of sigal with itself (the squared term) 33 hort-time Magitudes M M L=5 L=5 L= L= L= L= L=4 L=4 differeces betwee E ad M oticeable i uvoiced regios dyamic rage of M ~ square root (dyamic rage of E ) => level differeces betwee voiced ad uvoiced segmets are smaller E ad M ca be sampled at a rate of /sec for widow duratios of msec or so => efficiet 34 represetatio of sigal eergy/magitude hort Time Eergy ad Magitude Rectagular Widow E M L=5 L=5 hort Time Eergy ad Magitude Hammig Widow E M L=5 L=5 L= L= L= L= L= L= L= L= L=4 L=4 L=4 L=

7 Other Lowpass Widows ca replace RW or HW with ay lowpass filer widow should be positive sice this guaratees E ad M will be positive FIR widows are efficiet computatioally sice they ca slide by R samples for efficiecy with o loss of iformatio (what should R be?) ca eve use a ifiite duratio widow if its z-trasform is a ratioal fuctio, i.e., h [ ] = a,, < a< = < Hz ( ) = z > a az 37 Other Lowpass Widows this simple lowpass filter ca be used to implemet E ad M recursively as: E = ae + ( a) x [ ] short-time eergy M = am + ( a) x[ ] short-time magitude eed to compute E or M every sample ad the dow-sample to /sec rate recursive computatio has a o-liear phase, so delay caot be compesated exactly 38 hort-time Average ZC Rate zero crossigs zero crossig => successive samples have differet algebraic sigs iusoid Zero Crossig Rates Assume the samplig rate is F =, Hz. F = Hz siusoid has F / F =, / = samples/cycle; or z = / crossigs/sample, or z = / * = crossigs/ msec iterval zero crossig rate is a simple measure of the frequecy cotet of a sigal especially true for arrowbad sigals (e.g., siusoids) siusoid at frequecy F with samplig rate F has F /F samples per cycle with two zero crossigs per cycle, givig a average zero crossig rate of z =() crossigs/cycle x (F / F ) cycles/sample z =F / F crossigs/sample (i.e., z proportioal to F ). F = Hz siusoid has F / F =, / = samples/cycle; or z = / crossigs/sample, or z = / * = crossigs/ msec iterval 3. F = 5 Hz siusoid has F / F =, / 5 = samples/cycle; or z = / crossigs/sample, or z = / * = crossigs/ msec iterval z 39 M =M (F /F ) crossigs/(m samples) 4 Zero Crossig for iusoids Zero Crossigs for Noise offset:.75, Hz siewave, ZC:9, offset siewave, ZC:8 Hz siewave 3 offseet:.75, radom oise, ZC:5, offset oise, ZC: radom gaussia oise.5 ZC=9 ZC= Offset=.75 Hz siewave with dc offset 6 Offset=.75 radom gaussia oise with dc offset ZC=8 4 ZC=

8 ZC Rate Defiitios Z = L sg( x[ m]) sg( x[ m ]) w% [ m] eff m= L+ sg( x [ ]) = x [ ] = x [ ] < simple rectagular widow: w % [ ] = L = otherwise L eff = L ame form for Z as for E or M 43 The formal defiitio of Z is: ZC Normalizatio Z = z = sg( xm [ ]) sg( xm [ ]) L m= L+ is iterpreted as the umber of zero crossigs per sample. For most practical applicatios, we eed the rate of zero crossigs per fixed iterval of M samples, which is z = z M = rate of zero crossigs per M sample iterval M Thus, for a iterval of τ sec., correspodig to M samples we get z = z M; M = τ F = τ / T M F =, Hz; T = μsec; τ= msec; M = samples F = 8, Hz; T = 5 μsec; τ= msec; M = 8 samples F = 6, Hz; T = 6. 5 μsec; τ= msec; M = 6 samples 44 Zero crossigs/ msec iterval as a fuctio of samplig rate ZC Normalizatio For a Hz siewave as iput, usig a 4 msec widow legth ( L), with various values of samplig rate ( F ), we get the followig: F L z M z 8 3 / / / 8 6 M ZC ad Eergy Computatio Hammig widow with duratio L= samples (.5 msec at Fs=6 khz) Thus we see that the ormalized (per iterval) zero crossig rate, z M, is idepedet of the samplig rate ad ca be used as a measure of the domiat eergy i a bad. Hammig widow with duratio L=4 samples (5 msec at Fs=6 khz) ZC Rate Distributios ZC Rates for peech Uvoiced peech: the domiat eergy compoet is at about.5 khz KHz KHz 3KHz 4KHz Voiced peech: the domiat eergy compoet is at about 7 Hz for voiced speech, eergy is maily below.5 khz for uvoiced speech, eergy is maily above.5 khz mea ZC rate for uvoiced speech is 49 per msec iterval mea ZC rate for voiced speech is 4 per msec iterval 47 5 msec widows /sec samplig rate o ZC computatio 48 8

9 hort-time Eergy, Magitude, ZC Issues i ZC Rate Computatio for zero crossig rate to be accurate, eed zero DC i sigal => eed to remove offsets, hum, oise => use badpass filter to elimiate DC ad hum ca quatize the sigal to -bit for computatio of ZC rate ca apply the cocept of ZC rate to badpass filtered speech to give a crude spectral estimate i arrow bads of speech (kid of gives a estimate of the strogest frequecy i each arrow bad of speech) 49 5 ummary of imple Time Domai Measures s( ) Liear Filter x( ) Q = T( x[ m]) w% [ m] m=. Eergy: E = x [ m] w% [ m] m= L+ E T[ ] T( x[ ]) w %[ ] ca dowsample at rate commesurate with widow badwidth. Magitude: M = x[ m] w% [ m] m= L+ 3. Zero Crossig Rate: Z = z = L = L sg( xm [ ]) sg( xm [ ]) w % [ m] m + where sg( xm [ ]) = xm [ ] = xm [ ] < Q 5 hort-time Autocorrelatio -for a determiistic sigal, the autocorrelatio fuctio is defied as: Φ[ k] = x[ m] x[ m+ k] m= -for a radom or periodic sigal, the autocorrelatio fuctio is: L Φ[ k] = lim x[ m] x[ m+ k] L ( L + ) m= L - if x[ ] = x[ + P], the Φ[ k] = Φ[ k + P], => the autocorrelatio fuctio preserves periodicity -properties of Φ[ k] :. Φ[ k] is eve, Φ[ k] = Φ[ k]. Φ[ k] is maximum at k =, Φ[ k] Φ[ ], k 3. Φ[ ] is the sigal eergy or power (for radom sigals) 5 Periodic igals for a periodic sigal we have (at least i theory) Φ[P]=Φ[] so the period of a periodic sigal ca be estimated as the first o-zero maximum of Φ[k] this meas that the autocorrelatio fuctio is a good cadidate for speech pitch detectio algorithms it also meas that we eed a good way of measurig the short-time autocorrelatio fuctio for speech sigals hort-time Autocorrelatio - a reasoable defiitio for the short-time autocorrelatio is: R [ ] = [ ] %[ ] [ + ] % k x m w m x m k w[ k m] m=. select a segmet of speech by widowig. compute determiistic autocorrelatio of the widowed speech R[ k] = R[ k] - symmetry = xmxm [ ] [ k] w %[ mw ] %[ + k m] m= - defie filter of the form w% [ ] = %[ ] %[ k w w+ k] - this eables us to write the short-time autocorrelatio i the form: R [ ] = [ ] [ ] % k xmxm kwk [ m] m= th - the value of w% [ k] at time for the k lag is obtaied by filterig the sequece x [ ] x [ k] with a filter with impulse respose w% k [ ]

10 hort-time Autocorrelatio hort-time Autocorrelatio R [ k] = xmw [ ] [ m] xm [ + kw ] [ + k m] % % m= ~ ~ -L+ +k-l+ L poits used to compute R [ ]; L k poits used to compute R [ k]; Examples of Autocorrelatios Voiced (female) L=4 (magitude) T T = NT t = T autocorrelatio peaks occur at k=7, 44,... => 4 Hz pitch Φ(P)<Φ() sice widowed speech is ot perfectly periodic over a 4 sample widow (4 msec of sigal), pitch period chages occur, so P is ot perfectly defied much less clear estimates of periodicity sice HW tapers sigal so strogly, makig it look like a o-periodic sigal 57 o strog peak for uvoiced speech F = T F / F s 58 Voiced (female) L=4 (log mag) Voiced (male) L=4 T t = T T T T F = T 3 3F = T F / F s 59 6

11 Uvoiced L=4 Uvoiced L=4 6 6 Effects of Widow ize L=4 L=5 L=5 choice of L, widow duratio small L so pitch period almost costat i widow large L so clear periodicity see i widow as k icreases, the umber of widow poits decrease, reducig the accuracy ad size of R (k) for large k => have a taper of the type R(k)=-k/L, k <L shapig of autocorrelatio (this is the autocorrelatio of size L rectagular widow) allow L to vary with detected pitch periods (so that at least full periods are icluded) 63 Modified Autocorrelatio wat to solve problem of differig umber of samples for each differet k term i R[ k], so modify defiitio as follows: R [ ] = [ ] % [ ] [ + ] % k x m w m x m k w[ m k] m= - where w% is stadard L-poit widow, ad w% is exteded widow of duratio L+ K samples, where K is the largest lag of iterest - we ca rewrite modified autocorrelatio as: R [ k] = x[ + m] w[ m] x[ + m+ k] w[ m+ k] m= - where w [ m] = w% [ m] ad w[ m] = w% [ m] - for rectagular widows we choose the followig: w [ m] =, m L w [ m] =, m L + K -givig R [ ] = L k x[ + m] x[ + m+ k], k K m= - always use L samples i computatio of R [ k] k 64 Examples of Modified Autocorrelatio Examples of Modified Autocorrelatio L- L+K- - R [ k] is a cross-correlatio, ot a auto-correlatio - R [ ] k R[ k] - R [ k] will have a strog peak at k = P for periodic sigals ad will ot fall off for large k 65 66

12 Examples of Modified AC Waterfall Examples L=4 L=4 L=4 L=5 L=4 L=5 Modified Autocorrelatios fixed value of L=4 Modified Autocorrelatios values of L=4,5, Waterfall Examples Waterfall Examples 69 7 hort-time AMDF AMDF for peech egmets - belief that for periodic sigals of period P, the differece fuctio d [ ] = x [ ] x [ k] - will be approximately zero for k =, ± P, ± P,... For realistic speech sigals, d [ ] will be small at k= P--but ot zero. Based o this reasoig. the short-time Average Magitude Differece Fuctio (AMDF) is defied as: γ [ ] = [ + ] % [ ] [ + ] % k x m w m x m k w[ m k] m= - with w% [ m] ad w% [ m] beig rectagular widows. If both are the same legth, the γ [ k] is similar to the short-time autocorrelatio, whereas if w% [ m] is loger tha w% [ m], the γ [ k] is similar to the modified short-time autocorrelatio (or covariace) fuctio. I fact it ca be show that γ[ k] β[ k] [ ] [ ] R R k / - where β[ k] varies betwee.6 ad. for differet segmets of speech. 7 7

13 ummary hort-time parameters i the time domai: short-time eergy short-time average magitude short-time zero crossig rate short-time autocorrelatio modified short-time autocorrelatio hort-time average magitude differece fuctio 73 3

representation of speech

representation of speech Digital Speech Processing Lectures 7-8 Time Domain Methods in Speech Processing 1 General Synthesis Model voiced sound amplitude Log Areas, Reflection Coefficients, Formants, Vocal Tract Polynomial, l

More information

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

Filter 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 information

A. Basics of Discrete Fourier Transform

A. 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 information

Frequency Response of FIR Filters

Frequency 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 information

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

Module 11: Applications : Linear prediction, Speech Analysis and Speech Enhancement Prof. Eliathamby Ambikairajah Dr. Tharmarajah Thiruvaran School Module : Applicatios : Liear predictio, Speech Aalysis ad Speech Ehacemet Prof. Eliathamby Ambiairajah Dr. Tharmarajah Thiruvara School of Electrical Egieerig & Telecommuicatios The Uiversity of New South

More information

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

Run-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 information

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

Chapter 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 information

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

Olli 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 information

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

Practical 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 information

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

Discrete-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 information

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

EE / 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 information

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

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 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 information

FIR Filter Design: Part I

FIR 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 information

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

Signal 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 information

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

Discrete-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 information

The Discrete Fourier Transform

The 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 information

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

Spectral 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 information

Linear time invariant systems

Linear 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 information

Chapter 2 Systems and Signals

Chapter 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 information

EE123 Digital Signal Processing

EE123 Digital Signal Processing EE123 Digital Sigal Processig Lecture 20 Filter Desig Liear Filter Desig Used to be a art Now, lots of tools to desig optimal filters For DSP there are two commo classes Ifiite impulse respose IIR Fiite

More information

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

MASSACHUSETTS 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 information

Introduction to Signals and Systems, Part V: Lecture Summary

Introduction 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 information

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

Review of Discrete-time Signals. ELEC 635 Prof. Siripong Potisuk Review of Discrete-time Sigals ELEC 635 Prof. Siripog Potisuk 1 Discrete-time Sigals Discrete-time, cotiuous-valued amplitude (sampled-data sigal) Discrete-time, discrete-valued amplitude (digital sigal)

More information

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

FIR 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 information

Fall 2011, EE123 Digital Signal Processing

Fall 2011, EE123 Digital Signal Processing Lecture 5 Miki Lustig, UCB September 14, 211 Miki Lustig, UCB Motivatios for Discrete Fourier Trasform Sampled represetatio i time ad frequecy umerical Fourier aalysis requires a Fourier represetatio that

More information

ADVANCED DIGITAL SIGNAL PROCESSING

ADVANCED 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 information

Chapter 10 Advanced Topics in Random Processes

Chapter 10 Advanced Topics in Random Processes ery Stark ad Joh W. Woods, Probability, Statistics, ad Radom Variables for Egieers, 4th ed., Pearso Educatio Ic.,. ISBN 978--3-33-6 Chapter Advaced opics i Radom Processes Sectios. Mea-Square (m.s.) Calculus

More information

Chapter 8. DFT : The Discrete Fourier Transform

Chapter 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 information

FIR Filter Design by Windowing

FIR Filter Design by Windowing FIR Filter Desig by Widowig Take the low-pass filter as a eample of filter desig. FIR filters are almost etirely restricted to discretetime implemetatios. Passbad ad stopbad Magitude respose of a ideal

More information

FIR Filter Design: Part II

FIR 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 information

Signals & Systems Chapter3

Signals & 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

Wavelet Transform and its relation to multirate filter banks

Wavelet 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 information

Chapter 7 z-transform

Chapter 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 information

Question1 Multiple choices (circle the most appropriate one):

Question1 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 information

EE 505. Lecture 29. ADC Design. Oversampled

EE 505. Lecture 29. ADC Design. Oversampled EE 505 Lecture 29 ADC Desig Oversampled Review from Last Lecture SAR ADC V IN Sample Hold C LK V REF DAC DAC Cotroller DAC Cotroller stores estimates of iput i Successive Approximatio Register (SAR) At

More information

Lecture 19: Convergence

Lecture 19: Convergence Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may

More information

Spring 2014, EE123 Digital Signal Processing

Spring 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 information

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

Solutions. 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 information

Orthogonal Gaussian Filters for Signal Processing

Orthogonal Gaussian Filters for Signal Processing Orthogoal Gaussia Filters for Sigal Processig Mark Mackezie ad Kiet Tieu Mechaical Egieerig Uiversity of Wollogog.S.W. Australia Abstract A Gaussia filter usig the Hermite orthoormal series of fuctios

More information

Time-Domain Representations of LTI Systems

Time-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 information

Fig. 2. Block Diagram of a DCS

Fig. 2. Block Diagram of a DCS Iformatio source Optioal Essetial From other sources Spread code ge. Format A/D Source ecode Ecrypt Auth. Chael ecode Pulse modu. Multiplex Badpass modu. Spread spectrum modu. X M m i Digital iput Digital

More information

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

x[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 information

Statistical Noise Models and Diagnostics

Statistical Noise Models and Diagnostics L. Yaroslavsky: Advaced Image Processig Lab: A Tutorial, EUSIPCO2 LECTURE 2 Statistical oise Models ad Diagostics 2. Statistical models of radom iterfereces: (i) Additive sigal idepedet oise model: r =

More information

Frequency Domain Filtering

Frequency 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 information

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio

More information

Complex Algorithms for Lattice Adaptive IIR Notch Filter

Complex Algorithms for Lattice Adaptive IIR Notch Filter 4th Iteratioal Coferece o Sigal Processig Systems (ICSPS ) IPCSIT vol. 58 () () IACSIT Press, Sigapore DOI:.7763/IPCSIT..V58. Complex Algorithms for Lattice Adaptive IIR Notch Filter Hog Liag +, Nig Jia

More information

Optimum LMSE Discrete Transform

Optimum LMSE Discrete Transform Image Trasformatio Two-dimesioal image trasforms are extremely importat areas of study i image processig. The image output i the trasformed space may be aalyzed, iterpreted, ad further processed for implemetig

More information

Mechatronics. Time Response & Frequency Response 2 nd -Order Dynamic System 2-Pole, Low-Pass, Active Filter

Mechatronics. Time Response & Frequency Response 2 nd -Order Dynamic System 2-Pole, Low-Pass, Active Filter Time Respose & Frequecy Respose d -Order Dyamic System -Pole, Low-Pass, Active Filter R 4 R 7 C 5 e i R 1 C R 3 - + R 6 - + e out Assigmet: Perform a Complete Dyamic System Ivestigatio of the Two-Pole,

More information

Signal Processing in Mechatronics

Signal 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 information

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

Analog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals Itroductio to Digital Sigal Processig Chapter : Itroductio Aalog ad Digital Sigals aalog = cotiuous-time cotiuous amplitude digital = discrete-time discrete amplitude cotiuous amplitude discrete amplitude

More information

Microscopic Theory of Transport (Fall 2003) Lecture 6 (9/19/03) Static and Short Time Properties of Time Correlation Functions

Microscopic Theory of Transport (Fall 2003) Lecture 6 (9/19/03) Static and Short Time Properties of Time Correlation Functions .03 Microscopic Theory of Trasport (Fall 003) Lecture 6 (9/9/03) Static ad Short Time Properties of Time Correlatio Fuctios Refereces -- Boo ad Yip, Chap There are a umber of properties of time correlatio

More information

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

Lecture 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 information

Voltage controlled oscillator (VCO)

Voltage controlled oscillator (VCO) Voltage cotrolled oscillator (VO) Oscillatio frequecy jl Z L(V) jl[ L(V)] [L L (V)] L L (V) T VO gai / Logf Log 4 L (V) f f 4 L(V) Logf / L(V) f 4 L (V) f (V) 3 Lf 3 VO gai / (V) j V / V Bi (V) / V Bi

More information

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.

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. .3 Covergece Theorems of Fourier Series I this sectio, we preset the covergece of Fourier series. A ifiite sum is, by defiitio, a limit of partial sums, that is, a cos( kx) b si( kx) lim a cos( kx) b si(

More information

Computing Confidence Intervals for Sample Data

Computing Confidence Intervals for Sample Data Computig Cofidece Itervals for Sample Data Topics Use of Statistics Sources of errors Accuracy, precisio, resolutio A mathematical model of errors Cofidece itervals For meas For variaces For proportios

More information

Statistics 511 Additional Materials

Statistics 511 Additional Materials Cofidece Itervals o mu Statistics 511 Additioal Materials This topic officially moves us from probability to statistics. We begi to discuss makig ifereces about the populatio. Oe way to differetiate probability

More information

The Growth of Functions. Theoretical Supplement

The Growth of Functions. Theoretical Supplement The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that

More information

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

Exam. 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 information

Discrete Mathematics for CS Spring 2008 David Wagner Note 22

Discrete Mathematics for CS Spring 2008 David Wagner Note 22 CS 70 Discrete Mathematics for CS Sprig 2008 David Wager Note 22 I.I.D. Radom Variables Estimatig the bias of a coi Questio: We wat to estimate the proportio p of Democrats i the US populatio, by takig

More information

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

Advanced 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 information

ANALYSIS OF EXPERIMENTAL ERRORS

ANALYSIS OF EXPERIMENTAL ERRORS ANALYSIS OF EXPERIMENTAL ERRORS All physical measuremets ecoutered i the verificatio of physics theories ad cocepts are subject to ucertaities that deped o the measurig istrumets used ad the coditios uder

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Statistical inference: example 1. Inferential Statistics

Statistical inference: example 1. Inferential Statistics Statistical iferece: example 1 Iferetial Statistics POPULATION SAMPLE A clothig store chai regularly buys from a supplier large quatities of a certai piece of clothig. Each item ca be classified either

More information

2D DSP Basics: 2D Systems

2D 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 information

M2.The Z-Transform and its Properties

M2.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 information

The z-transform can be used to obtain compact transform-domain representations of signals and systems. It

The 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 information

Stat 421-SP2012 Interval Estimation Section

Stat 421-SP2012 Interval Estimation Section Stat 41-SP01 Iterval Estimatio Sectio 11.1-11. We ow uderstad (Chapter 10) how to fid poit estimators of a ukow parameter. o However, a poit estimate does ot provide ay iformatio about the ucertaity (possible

More information

Lecture 22: Review for Exam 2. 1 Basic Model Assumptions (without Gaussian Noise)

Lecture 22: Review for Exam 2. 1 Basic Model Assumptions (without Gaussian Noise) Lecture 22: Review for Exam 2 Basic Model Assumptios (without Gaussia Noise) We model oe cotiuous respose variable Y, as a liear fuctio of p umerical predictors, plus oise: Y = β 0 + β X +... β p X p +

More information

Discrete-Time Signals and Systems. Discrete-Time Signals and Systems. Signal Symmetry. Elementary Discrete-Time Signals.

Discrete-Time Signals and Systems. Discrete-Time Signals and Systems. Signal Symmetry. Elementary Discrete-Time Signals. Discrete-ime Sigals ad Systems Discrete-ime Sigals ad Systems Dr. Deepa Kudur Uiversity of oroto Referece: Sectios. -.5 of Joh G. Proakis ad Dimitris G. Maolakis, Digital Sigal Processig: Priciples, Algorithms,

More information

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

ECE-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 information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

2(25) Mean / average / expected value of a stochastic variable X: Variance of a stochastic variable X: 1(25)

2(25) Mean / average / expected value of a stochastic variable X: Variance of a stochastic variable X: 1(25) Lecture 5: Codig of Aalog Sources Samplig ad Quatizatio Images ad souds are ot origially digital! The are cotiuous sigals i space/time as well as amplitude Typical model of a aalog source: A statioary

More information

Solution of EECS 315 Final Examination F09

Solution 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 information

ENGI Series Page 6-01

ENGI Series Page 6-01 ENGI 3425 6 Series Page 6-01 6. Series Cotets: 6.01 Sequeces; geeral term, limits, covergece 6.02 Series; summatio otatio, covergece, divergece test 6.03 Stadard Series; telescopig series, geometric series,

More information

Sequences. Notation. Convergence of a Sequence

Sequences. Notation. Convergence of a Sequence Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it

More information

Finite-length Discrete Transforms. Chapter 5, Sections

Finite-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 information

Lecture 11: Pseudorandom functions

Lecture 11: Pseudorandom functions COM S 6830 Cryptography Oct 1, 2009 Istructor: Rafael Pass 1 Recap Lecture 11: Pseudoradom fuctios Scribe: Stefao Ermo Defiitio 1 (Ge, Ec, Dec) is a sigle message secure ecryptio scheme if for all uppt

More information

EE422G Homework #13 (12 points)

EE422G 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 information

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)

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) DIGITAL SIGNAL PROCESSING UNIT-I 1. The uit ramp sequece is Eergy sigal b) Power sigal c) Either Eergy or Power sigal d) Neither a Power sigal or a eergy sigal As: d) 2. A real valued sequece x() is ati

More information

DISTRIBUTION LAW Okunev I.V.

DISTRIBUTION LAW Okunev I.V. 1 DISTRIBUTION LAW Okuev I.V. Distributio law belogs to a umber of the most complicated theoretical laws of mathematics. But it is also a very importat practical law. Nothig ca help uderstad complicated

More information

ELEC1200: A System View of Communications: from Signals to Packets Lecture 3

ELEC1200: A System View of Communications: from Signals to Packets Lecture 3 ELEC2: A System View of Commuicatios: from Sigals to Packets Lecture 3 Commuicatio chaels Discrete time Chael Modelig the chael Liear Time Ivariat Systems Step Respose Respose to sigle bit Respose to geeral

More information

Chapter 10: Power Series

Chapter 10: Power Series Chapter : Power Series 57 Chapter Overview: Power Series The reaso series are part of a Calculus course is that there are fuctios which caot be itegrated. All power series, though, ca be itegrated because

More information

x a x a Lecture 2 Series (See Chapter 1 in Boas)

x a x a Lecture 2 Series (See Chapter 1 in Boas) Lecture Series (See Chapter i Boas) A basic ad very powerful (if pedestria, recall we are lazy AD smart) way to solve ay differetial (or itegral) equatio is via a series expasio of the correspodig solutio

More information

Chapter 6 Sampling Distributions

Chapter 6 Sampling Distributions Chapter 6 Samplig Distributios 1 I most experimets, we have more tha oe measuremet for ay give variable, each measuremet beig associated with oe radomly selected a member of a populatio. Hece we eed to

More information

Random Variables, Sampling and Estimation

Random Variables, Sampling and Estimation Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig

More information

Chapter 2. Simulation Techniques. References:

Chapter 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 information

Jitter Transfer Functions For The Reference Clock Jitter In A Serial Link: Theory And Applications

Jitter Transfer Functions For The Reference Clock Jitter In A Serial Link: Theory And Applications Jitter Trasfer Fuctios For The Referece Clock Jitter I A Serial Lik: Theory Ad Applicatios Mike Li, Wavecrest Ady Martwick, Itel Gerry Talbot, AMD Ja Wilstrup, Teradye Purposes Uderstad various jitter

More information

The Z-Transform. (t-t 0 ) Figure 1: Simplified graph of an impulse function. For an impulse, it can be shown that (1)

The 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 information

Signal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University.

Signal 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 information

Ch3 Discrete Time Fourier Transform

Ch3 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 information

1 Introduction to reducing variance in Monte Carlo simulations

1 Introduction to reducing variance in Monte Carlo simulations Copyright c 010 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a ukow mea µ = E(X) of a distributio by

More information

MCT242: Electronic Instrumentation Lecture 2: Instrumentation Definitions

MCT242: Electronic Instrumentation Lecture 2: Instrumentation Definitions Faculty of Egieerig MCT242: Electroic Istrumetatio Lecture 2: Istrumetatio Defiitios Overview Measuremet Error Accuracy Precisio ad Mea Resolutio Mea Variace ad Stadard deviatio Fiesse Sesitivity Rage

More information

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

Mathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1 Mathematical Descriptio of Discrete-Time Sigals 9/10/16 M. J. Roberts - All Rights Reserved 1 Samplig ad Discrete Time Samplig is the acquisitio of the values of a cotiuous-time sigal at discrete poits

More information

6.003 Homework #3 Solutions

6.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 information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

Measurement uncertainty of the sound absorption

Measurement uncertainty of the sound absorption Measuremet ucertaity of the soud absorptio coefficiet Aa Izewska Buildig Research Istitute, Filtrowa Str., 00-6 Warsaw, Polad a.izewska@itb.pl 6887 The stadard ISO/IEC 705:005 o the competece of testig

More information

6.003 Homework #12 Solutions

6.003 Homework #12 Solutions 6.003 Homework # Solutios Problems. Which are rue? For each of the D sigals x [] through x 4 [] below), determie whether the coditios listed i the followig table are satisfied, ad aswer for true or F for

More information

The starting phase of each symbol is determined by past bits. This memory can improve detection by giving additional hints about past symbol values.

The starting phase of each symbol is determined by past bits. This memory can improve detection by giving additional hints about past symbol values. 8.2 Start With CPFSK 8.2-1 8.2.1 CPFSK Sigals Three pictures of the same CPFSK sigal: istataeous frequecy istataeous phase trajectory Trajectory is a circle with radius A = P. CPFSK moves at a steady speed

More information

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4 MATH 30: Probability ad Statistics 9. Estimatio ad Testig of Parameters Estimatio ad Testig of Parameters We have bee dealig situatios i which we have full kowledge of the distributio of a radom variable.

More information

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,

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, 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 information