x[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn
|
|
- Alexandra Floyd
- 5 years ago
- Views:
Transcription
1 Sampling Let x a (t) be a continuous time signal. The signal is sampled by taking the signal value at intervals of time T to get The signal x(t) has a Fourier transform x[n] = x a (nt ) X a (Ω) = x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform X[ω] = n= x[n]e jωn The question is: what is the relationship between these two Fourier transforms? The following theorem gives the answer Theorem. Let x[n] = x a (nt ) be a sampled version of the continuous time signal x a (t). Then the relationship between the Fourier transforms is (assuming that all signals have nice Fourier transforms) X[ω] = 1 ( ) ω + k2π X a (1) T T k= Proof. First notice that X[ω] is periodic with period 2π. It is therefore the Discrete Time Fourier Transform (DTFT) of some sequence x[n], and we can calculate the inverse Fourier transform as follows x[n] = 1 2π 2π = 1 2π = 1 1 2π T = 1 1 2π T 0 2π 0 = 1 1 2π T = 1 1 2π T X[ω]e jωn dω 1 T k= 2π k= 0 (k+1)2π k= k2π X a ( ω T = x a (nt ) = x[n] ( ω + k2π X a T X a ( ω + k2π T ( ω X a T ) e jωn dω X a (ω) e jωt n d(ωt ) ) e jωn dω ) e jωn dω ) e jωn dω Since the inverse Fourier transform of X[ω] is x[n], X[ω] is indeed the Fourier transform of x[n]. 1
2 It is often more convenient to use the continuous time frequency Ω instead of the discrete time frequency ω. Define Then (1) becomes X p (Ω) = X[ω] ω=ωt X p (Ω) = 1 T Ω s = 2π T k= X a (Ω kω s ) (2) Let x[n] be a discrete time signal, and y(t) a continuous time signal. Then we define the convolution between x[n] and y(t) with period T by z(t) = x[n] T y(t) def = n= Theorem. The Fourier transform Z( Ω) of z(t) is given by x[n]y(t nt ) Z(Ω) = X p (Ω)Y (Ω), X p (Ω) = X[ω] ω=ωt X[ω] = x[n]e jωn Y (Ω) = n= y(t)e jωt dt (3) Proof. Exercise. 1 X(ω) 1/Τ X Τ (ω) Τ Η(ω) X(ω)=Η(ω)X Τ (ω) Figure 1: Sampling Reconstruction 2
3 This result can be used for perfect reconstruction of a bandlimited signal. Suppose that x a (t) has maximum frequency Ω m, that is X a (Ω) = 0 for Ω > Ω m. In that case (see figure), X(Ω) = H(Ω)X a (Ω) with Then according to the above we get H(Ω) = { T Ω Ωs 2 0 otherwise Here (from a CTFT table) So, x(t) can be reconstructed from x(t) = x[n] T h(t) = x(t) = n= ( ) t h(t) = sinc T sinc(x) = sin(πx) πx n= x[n]h(t nt ) ( ) t x[n]sinc T n 3
4
5 Impulse Response for Finite Difference Equations Consider the finite difference equation N M d k y[n k] = p j x[n j]; y[ 1] = y[ 2] = y[ N] = 0 k=0 j=0 The procedure for finding the impulse response is 1. Find the homogenous solution. For simplicity of notation, assume that all roots are different y h [n] = N α i λ n i 2. Find the particular (transient) solution by manual calculation, using initial conditions, y[n] = p n d 0 N k=1 d k d 0 y[n k], n = 0, 1,... M 3. Find the coefficients α i by using y[m], y[m 1],... y[m N + 1] as initial conditions 4. The impulse response is α 1 λ1 M N+1 + α 2 λ M N α N λ M N+1 N = y[m N + 1] α 1 λ1 M N+2 + α 2 λ M N α N λ M N+2 N = y[m N + 2] α 1 λ M 1 + α 2 λ M α N λ M N = y[m] h[n] = y[n], n = 0, 1,..., M N (from step 2) N h[n] = α i λ n i, n = M N + 1,..., (α i found in step 3). 5
6 Frequency Analysis of Continuous Time signals Consider a continuous-time signal x(t), which is a superposition of sinusoidal signals x(t) = K A i cos(ω i t + θ i ) We would like to use the DFT (or, rather, the FFT) to determine the frequencies ω i of this signal. The Fourier transform of x(t) is X c (ω) = x(t)e jωt dt = K K πa i e jθ i δ(ω ω i ) + πa i e jθ i δ(ω + ω i ) So that the frequencies ω i can be found from the peaks of the Fourier transform. The signal is sampled with a sampling interval T to give x[n], x[n] = K A i cos(ω i T n + θ i ) π Provided the sampling frequency is high enough to avoid aliasing, i.e., T < max i {ω i }, the DTFT of x[n] is given by K K X(ω) = πa i e jθ i δ(ω ω i T ) + πa i e jθ i δ(ω + ω i T ) Thus, the frequencies ω i can be found from the sampled signal by performing a DTFT, and the relationship between the DTFT and the Fourier transform is X c (ω) = X(ω/T ) In praxis we only have a finite number of samples, x[n], 0 n N 1, and the DFT is used to find the spectrum. Define { x[n] 0 n N 1 x N [n] = 0 otherwise Then we can write The DFT of x N [n] is then given by where X N (ω) is the DTFT ofx N [n] x N [n] = x[n]w N [n] { 1 0 n N 1 w N [n] = 0 otherwise X[k] = DF T (x N [n]) = X N (ω) ω=2πk/n, 0 k N 1 π X N (ω) = DT F T (x[n]w N [n]) = 1 X(ψ)W N (ω ψ)dψ 2π π K K 1 = 2 A ie jθ i 1 W N (ω ω i T ) + 2 A ie jθ i W N (ω + ω i T ) 6
7 and W N (ω) is the DTFT of w N [n]: W N (ω) = N 1 n=0 { N ω = 0 1 e jωn = otherwise 1 exp( jωn) 1 exp( jω) Thus, the DFT does not directly give the peaks of the DTFT, but instead the function W N (ω). Figure 2: Frequency analysis of the signal x(t) = cos(2π395t) However, this can usually be used for frequency analysis if N is large enough, as will be seen from some examples. To be able to interpret a plot we need to have the right frequency range. The DFT gives X N (ω) at the frequencies 0, 2π 1/N, 2π 2/N,..., 2π (N 1)/N, i.e., in a frequency range of approximately 0 2π. However, we are interested in the frequencies in the range π π. This can be fixed using the periodicity of X N (ω) by setting X N (ω) ω=2πk/n = X[k + N], N 2 k 1 X N (ω) ω=2πk/n = X[k], 0 k N 2 1 The easiest way to implement this is through the Matlab function fftshift. There is still the problem that we only have a frequency resolution of 2π 1/N, i.e., the step size in the frequency domain. If we are interested in a frequency that is not a multiple of 2π 1/N, the DFT does not give us this. The frequency resolution can be increased by zero-padding x N [n]. Define the length M > N signal x N,M [n], 0 n M 1 by { x[n] 0 n N 1 x N,M [n] = 0 N n M 1 7
8 Then the DFT of x N,M [n] is X N,M [k] = DF T (x N,M [n]) = X N (ω) ω=2πk/m, 0 k M 1 So now the output frequencies are 0, 2π 1/M, 2π 2/M,..., 2π (M 1)/M, i.e., the frequency resolution is 2π 1/M < 2π 1/N. The following Matlab program integrates this approach to frequency analysis Nf=zp length ( x ) ; % zp i s the zero padding f a c t o r ( an i n t e g e r ) y=f f t ( x, Nf ) ; % appends a u t o m a t i c a l l y Nf length ( x ) z e r o s y=f f t s h i f t ( y ) ; %s h i f t the two h a l v e s o f the FFT f r e q =(0: Nf 1)/Nf/T f s / 2 ; % c a l c u l a t e frequency range stem ( freq, abs ( y ) ) ; % p l o t the magnitude Example 1. Let x(t) = cos(2π395t) and let the sampling frequency be 1000Hz. We use N = 64 samples of the signal for the DFT. The result can be seen in Figure. The reason the plot is not a single peak is due to the convolution with the function W N (ω). Figure 3: Frequency analysis of the signalx(t) = cos(2π388t) + cos(2π400t) Example 2. Let x(t) = cos(2π388t) + cos(2π400t) and let the sampling frequency be 1000Hz. We use N=64 samples of the signal for the DFT. The result can be seen in Figure. As can be seen, without zeropadding, the two sinusoids cannot be distinguished it seems like there is only one peak. With zeropadding it can be seen that there are two peaks. However, it is not always possible to distinguish the peaks, and DFT (or FFT) is therefore not the best tool for frequency analysis of 8
9 signals with multiple frequencies. For more detail and advanced methods, see chapter 11.2 in the textbook and [1][2]. References 1. S.M. Kay, Modern Spectral Estimation: Theory and application, Prentice-Hall, S.M. Kay and S.M. Marple, Jr., Spectrum analysis-a modern perspective, Proceedings of the IEEE, vol.69, no.11, p ,
10
11
12 Inversion of the Z-transform G(z) = P (z) D(z) = p 0 + p 1 z p M z M d 0 + d 1 z d N z N 1. If M N rewrite as G(z) = M N = p 0 + p 1 z p M z M N n=1 (1 λ nz 1 ) η i z i + P 1(z) D(z) }{{} G 1 (z) where order(p 1 (z)) <order(d(z)). P 1 (z) and η 1,..., η M N is found by long division (see section 6.4.5). 2. Do a partial fraction expansion of G 1 (z). There are several cases a) Only simple real poles (all λ i different). Write G 1 (z) as G 1 (z) = N ρ i 1 λ i z 1 The coefficients ρ i can be found by ρ i = (1 λ i z 1 )G 1 (z) z=λi b) One or more (simple) complex poles. If the z transform has real coefficients, complex poles come in complex conjugate pairs. For example, suppose λ 1 is complex. Then there is some other pole λ i so that λ i = λ 1. For simplicity, let i = 2. Then also ρ 2 = ρ 1, and G 1 (z) = ρ 1 1 λ 1 z 1 + ρ 1 1 λ 1 z 1 + c) Poles with multiplicity. As an example, suppose that λ 1 = λ 2 λ 3. The partial fraction expansion is ρ 1 G 1 (z) = 1 λ 1 z 1 + ρ 2 (1 λ 1 z 1 ) 2 + ρ 3 1 λ 3 z 1 The coefficients can be found by ρ 1 = 1 d λ 1 dz 1 (1 λ 1z 1 ) 2 G 1 (z) z=λ3 ρ 2 = (1 λ 1 z 1 ) 2 G 1 (z) z=λ3 ρ 3 = (1 λ 3 z 1 )G 1 (z) z=λ3 3. Calculate the inverse Z-transform for each of the terms in the partial fraction expansion. The inverse Z-transform is the sum of these (linearity). Some cases (when ROC is a region z > λ i ) a) Simple real pole ρ i 1 λ i z 1 ρ iλ n i µ[n] b) Simple complex pole (combine the conjugate complex poles in pairs) ρ i 1 λ i z 1 + ρ i 1 λ i z 1 ρ iλ n i µ[n] + ρ i (λ i ) n µ[n] 12
13 This can also be written on real form as follows. Write ρ i = ρ i e jθ i λ i = r i e jω i Then (ρ 1 λ n 1 + ρ 1(λ 1) n )µ[n] = 2 ρ 1 r n 1 cos(nω 1 + θ 1 )µ[n] c) Poles with multiplicity. Use tables, in particular Z {α n nµ[n]} = αz 1 (1 αz 1 ) 2 13
14 Algebraic Stability Test The following is equivalent to the method of section 7.9 in Mitra s textbook. Define m D m (z) = d m,k z k (NB: d m,0 = 1) k=0 D m (z) = z m D m (z 1 ) = m d m,m k z k Consider a transfer function H(z) with denominator polynomial D(z) of order M. following procedure can be used to test if all poles are inside the unit circle 1. Put D M (z) = D(z) k=0 Then the 2. Calculate the following recursively for m = N, N 1,..., 1 k m = d m,m D m 1 (z) = D m(z) k m Dm (z) 1 k 2 m 3. If for some m, k m 1. STOP. There is at least one pole not inside the unit circle. 4. If all k m < 1 all poles are inside the unit circle. Algebraic Stability Test for Complex Coefficients The procedure still works with a few modifications m D m (z) = d m,k z k k=0 D m (z) = z m D m (z 1 ) = m k=0 d m,m k z k Consider a transfer function H(z) with denominator polynomial D(z) of order M. following procedure can be used to test if all poles are inside the unit circle 1. Put D M (z) = D(z) Then the 2. Calculate the following recursively for m = N, N 1,..., 1 k m = d m,m D m 1 (z) = D m(z) k m Dm (z) 1 k m 2 3. If for some m, k m 1. STOP. There is at least one pole not inside the unit circle. 4. If all k m < 1 all poles are inside the unit circle. 14
15 Linear Phase FIR Filter H(z) = N h[n]z n : order N, length N + 1 i=0 H(z) = 0 H(1/z) = 0 Type N Relation zero at 1 zero at -1 1 even h[n] = h[n n] Possible Possible 2 odd h[n] = h[n n] Possible Y 3 even h[n] = h[n n] Y Y 4 odd h[n] = h[n n] Y Possible Type N Relation Frequency Response [ ] N/2 N [ ] N 1 even h[n] = h[n n] e jωn/2 h + 2 h 2 2 n cos(ωn) n=1 (N+1)/2 [ ] N odd h[n] = h[n n] e jωn/2 2 h n cos(ω(n )) n=1 N/2 [ ] N 3 even h[n] = h[n n] je jωn/2 2 h 2 n sin(ωn) n=1 (N+1)/2 [ ] N odd h[n] = h[n n] je jωn/2 2 h n sin(ω(n )) n=1 15
16
17
18 Alias-free Filterbank Butterworth Any odd-order Butterworth filter with 3dB cutoff ω c = π 2 will work. Eliptic filter Any odd-order Elliptic filter with ω p + ω s = π and δ 2 s = 2δ p (1 δ p ). The method in section of the textbook can be used. FIR perfect reconstruction 1. Design Q(z) as a zero-phase, halfband filter (Nyquist) N Q(z) = q[n]z n ; n= N N must be odd 2. Let δ s = min Q(ω) 3. Find H 0 (z)h 0 (z 1 ) = F (z) as follows F (z) = Q(z) + δ s ω : F (ω) 0 { q[n] + δ s n = 0 f[n] = q[n] n 0 F (z) = δ s F (z) a) Let λ 1,..., λ 2N be the roots of F (z). b) Divide into two groups { λ 1,..., λ N } and {ˇλ 1,..., ˇλ N } so that λ i = ˇλ 1 i c) Then H 0 (z) = C N (1 λ 1 i z 1 ) 4. H 1 (z) = z N H 0 ( z 1 ) h 1 [n] = ( 1) N n h 0 [N n] 18
EE 224 Signals and Systems I Review 1/10
EE 224 Signals and Systems I Review 1/10 Class Contents Signals and Systems Continuous-Time and Discrete-Time Time-Domain and Frequency Domain (all these dimensions are tightly coupled) SIGNALS SYSTEMS
More informationReview of Discrete-Time System
Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.
More informationDiscrete Time Systems
1 Discrete Time Systems {x[0], x[1], x[2], } H {y[0], y[1], y[2], } Example: y[n] = 2x[n] + 3x[n-1] + 4x[n-2] 2 FIR and IIR Systems FIR: Finite Impulse Response -- non-recursive y[n] = 2x[n] + 3x[n-1]
More informationECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n.
ECE 3 Fall Division Homework Solutions Problem. Reconstruction of a continuous-time signal from its samples. Consider the following periodic signal, depicted below: {, if n t < n +, for any integer n,
More informationECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3
ECE 30 Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3 Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out
More informationMultimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2
Multimedia Signals and Systems - Audio and Video Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2 Kunio Takaya Electrical and Computer Engineering University of Saskatchewan December
More informationDiscrete-Time Fourier Transform (DTFT)
Discrete-Time Fourier Transform (DTFT) 1 Preliminaries Definition: The Discrete-Time Fourier Transform (DTFT) of a signal x[n] is defined to be X(e jω ) x[n]e jωn. (1) In other words, the DTFT of x[n]
More informationUNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.
UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 9th, 011 Examination hours: 14.30 18.30 This problem set
More informationNAME: 11 December 2013 Digital Signal Processing I Final Exam Fall Cover Sheet
NAME: December Digital Signal Processing I Final Exam Fall Cover Sheet Test Duration: minutes. Open Book but Closed Notes. Three 8.5 x crib sheets allowed Calculators NOT allowed. This test contains four
More informationLecture 13: Discrete Time Fourier Transform (DTFT)
Lecture 13: Discrete Time Fourier Transform (DTFT) ECE 401: Signal and Image Analysis University of Illinois 3/9/2017 1 Sampled Systems Review 2 DTFT and Convolution 3 Inverse DTFT 4 Ideal Lowpass Filter
More informationVery useful for designing and analyzing signal processing systems
z-transform z-transform The z-transform generalizes the Discrete-Time Fourier Transform (DTFT) for analyzing infinite-length signals and systems Very useful for designing and analyzing signal processing
More informationDiscrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is
Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section 5. 3 The (DT) Fourier transform (or spectrum) of x[n] is X ( e jω) = n= x[n]e jωn x[n] can be reconstructed from its
More informationChapter 5 Frequency Domain Analysis of Systems
Chapter 5 Frequency Domain Analysis of Systems CT, LTI Systems Consider the following CT LTI system: xt () ht () yt () Assumption: the impulse response h(t) is absolutely integrable, i.e., ht ( ) dt< (this
More informationDiscrete Time Fourier Transform
Discrete Time Fourier Transform Recall that we wrote the sampled signal x s (t) = x(kt)δ(t kt). We calculate its Fourier Transform. We do the following: Ex. Find the Continuous Time Fourier Transform of
More informationECE 301 Fall 2011 Division 1 Homework 10 Solutions. { 1, for 0.5 t 0.5 x(t) = 0, for 0.5 < t 1
ECE 3 Fall Division Homework Solutions Problem. Reconstruction of a continuous-time signal from its samples. Let x be a periodic continuous-time signal with period, such that {, for.5 t.5 x(t) =, for.5
More informationChapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter
Chapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter Objec@ves 1. Learn techniques for represen3ng discrete-)me periodic signals using orthogonal sets of periodic basis func3ons. 2.
More informationLecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.
Lecture 10 Digital Signal Processing Chapter 7 Discrete Fourier transform DFT Mikael Swartling Nedelko Grbic Bengt Mandersson rev. 016 Department of Electrical and Information Technology Lund University
More informationEC Signals and Systems
UNIT I CLASSIFICATION OF SIGNALS AND SYSTEMS Continuous time signals (CT signals), discrete time signals (DT signals) Step, Ramp, Pulse, Impulse, Exponential 1. Define Unit Impulse Signal [M/J 1], [M/J
More informationDiscrete Fourier Transform
Discrete Fourier Transform Virtually all practical signals have finite length (e.g., sensor data, audio records, digital images, stock values, etc). Rather than considering such signals to be zero-padded
More informationECE 301. Division 3, Fall 2007 Instructor: Mimi Boutin Midterm Examination 3
ECE 30 Division 3, all 2007 Instructor: Mimi Boutin Midterm Examination 3 Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out
More informationELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization
ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals 1. Sampling and Reconstruction 2. Quantization 1 1. Sampling & Reconstruction DSP must interact with an analog world: A to D D to A x(t)
More informationECE-314 Fall 2012 Review Questions for Midterm Examination II
ECE-314 Fall 2012 Review Questions for Midterm Examination II First, make sure you study all the problems and their solutions from homework sets 4-7. Then work on the following additional problems. Problem
More informationsummable Necessary and sufficient for BIBO stability of an LTI system. Also see poles.
EECS 206 DSP GLOSSARY c Andrew E. Yagle Fall 2005 absolutely impulse response: h[n] is finite. EX: n=0 ( 3 4 )n = 1 = 4 but 1 3 n=1 1 n. 4 summable Necessary and sufficient for BIBO stability of an LI
More informationBME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY
1 Lucas Parra, CCNY BME 50500: Image and Signal Processing in Biomedicine Lecture 2: Discrete Fourier Transform Lucas C. Parra Biomedical Engineering Department CCNY http://bme.ccny.cuny.edu/faculty/parra/teaching/signal-and-image/
More informationDiscrete Fourier Transform
Discrete Fourier Transform Valentina Hubeika, Jan Černocký DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz Diskrete Fourier transform (DFT) We have just one problem with DFS that needs to be solved.
More informationDigital Signal Processing. Midterm 1 Solution
EE 123 University of California, Berkeley Anant Sahai February 15, 27 Digital Signal Processing Instructions Midterm 1 Solution Total time allowed for the exam is 8 minutes Some useful formulas: Discrete
More information! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals
ESE 531: Digital Signal Processing Lec 25: April 24, 2018 Review Course Content! Introduction! Discrete Time Signals & Systems! Discrete Time Fourier Transform! Z-Transform! Inverse Z-Transform! Sampling
More informationSignals and Systems Spring 2004 Lecture #9
Signals and Systems Spring 2004 Lecture #9 (3/4/04). The convolution Property of the CTFT 2. Frequency Response and LTI Systems Revisited 3. Multiplication Property and Parseval s Relation 4. The DT Fourier
More information2.161 Signal Processing: Continuous and Discrete Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 2.161 Signal Processing: Continuous and Discrete Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Massachusetts
More informationX. Chen More on Sampling
X. Chen More on Sampling 9 More on Sampling 9.1 Notations denotes the sampling time in second. Ω s = 2π/ and Ω s /2 are, respectively, the sampling frequency and Nyquist frequency in rad/sec. Ω and ω denote,
More informationDigital Signal Processing Lecture 10 - Discrete Fourier Transform
Digital Signal Processing - Discrete Fourier Transform Electrical Engineering and Computer Science University of Tennessee, Knoxville November 12, 2015 Overview 1 2 3 4 Review - 1 Introduction Discrete-time
More informationChapter 5 Frequency Domain Analysis of Systems
Chapter 5 Frequency Domain Analysis of Systems CT, LTI Systems Consider the following CT LTI system: xt () ht () yt () Assumption: the impulse response h(t) is absolutely integrable, i.e., ht ( ) dt< (this
More informationYour solutions for time-domain waveforms should all be expressed as real-valued functions.
ECE-486 Test 2, Feb 23, 2017 2 Hours; Closed book; Allowed calculator models: (a) Casio fx-115 models (b) HP33s and HP 35s (c) TI-30X and TI-36X models. Calculators not included in this list are not permitted.
More informationAspects of Continuous- and Discrete-Time Signals and Systems
Aspects of Continuous- and Discrete-Time Signals and Systems C.S. Ramalingam Department of Electrical Engineering IIT Madras C.S. Ramalingam (EE Dept., IIT Madras) Networks and Systems 1 / 45 Scaling the
More informationLecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE
OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE EEE 43 DIGITAL SIGNAL PROCESSING (DSP) 2 DIFFERENCE EQUATIONS AND THE Z- TRANSFORM FALL 22 Yrd. Doç. Dr. Didem Kivanc Tureli didemk@ieee.org didem.kivanc@okan.edu.tr
More informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Solutions for Problem Set 2
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science Issued: Tuesday, September 5. 6.: Discrete-Time Signal Processing Fall 5 Solutions for Problem Set Problem.
More informationFinal Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105.
Final Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, e-mail address,
More informationECGR4124 Digital Signal Processing Midterm Spring 2010
ECGR4124 Digital Signal Processing Midterm Spring 2010 Name: LAST 4 DIGITS of Student Number: Do NOT begin until told to do so Make sure that you have all pages before starting Open book, 1 sheet front/back
More informationDiscrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz
Discrete Time Signals and Systems Time-frequency Analysis Gloria Menegaz Time-frequency Analysis Fourier transform (1D and 2D) Reference textbook: Discrete time signal processing, A.W. Oppenheim and R.W.
More informationOverview of Sampling Topics
Overview of Sampling Topics (Shannon) sampling theorem Impulse-train sampling Interpolation (continuous-time signal reconstruction) Aliasing Relationship of CTFT to DTFT DT processing of CT signals DT
More informationECE-700 Review. Phil Schniter. January 5, x c (t)e jωt dt, x[n]z n, Denoting a transform pair by x[n] X(z), some useful properties are
ECE-7 Review Phil Schniter January 5, 7 ransforms Using x c (t) to denote a continuous-time signal at time t R, Laplace ransform: X c (s) x c (t)e st dt, s C Continuous-ime Fourier ransform (CF): ote that:
More informationZ-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1.
84 5. Z-TRANSFORMS 5 z-transforms Solution: Using the definition (5..2), we find: for case (a), and H(z) h 0 + h z + h 2 z 2 + h 3 z 3 2 + 3z + 5z 2 + 2z 3 H(z) h 0 + h z + h 2 z 2 + h 3 z 3 + h 4 z 4
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 8: February 7th, 2017 Sampling and Reconstruction Lecture Outline! Review " Ideal sampling " Frequency response of sampled signal " Reconstruction " Anti-aliasing
More informationSignals and Systems Lecture 8: Z Transform
Signals and Systems Lecture 8: Z Transform Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Winter 2012 Farzaneh Abdollahi Signal and Systems Lecture 8 1/29 Introduction
More informationUNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems.
UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 1th, 016 Examination hours: 14:30 18.30 This problem set
More informationFinal Exam of ECE301, Section 3 (CRN ) 8 10am, Wednesday, December 13, 2017, Hiler Thtr.
Final Exam of ECE301, Section 3 (CRN 17101-003) 8 10am, Wednesday, December 13, 2017, Hiler Thtr. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, and
More informationTransform Analysis of Linear Time-Invariant Systems
Transform Analysis of Linear Time-Invariant Systems Discrete-Time Signal Processing Chia-Ping Chen Department of Computer Science and Engineering National Sun Yat-Sen University Kaohsiung, Taiwan ROC Transform
More informationHomework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt
Homework 4 May 2017 1. An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt Determine the impulse response of the system. Rewriting as y(t) = t e (t
More informationJ. McNames Portland State University ECE 223 Sampling Ver
Overview of Sampling Topics (Shannon) sampling theorem Impulse-train sampling Interpolation (continuous-time signal reconstruction) Aliasing Relationship of CTFT to DTFT DT processing of CT signals DT
More informationEE-210. Signals and Systems Homework 7 Solutions
EE-20. Signals and Systems Homework 7 Solutions Spring 200 Exercise Due Date th May. Problems Q Let H be the causal system described by the difference equation w[n] = 7 w[n ] 2 2 w[n 2] + x[n ] x[n 2]
More informationEE 3054: Signals, Systems, and Transforms Summer It is observed of some continuous-time LTI system that the input signal.
EE 34: Signals, Systems, and Transforms Summer 7 Test No notes, closed book. Show your work. Simplify your answers. 3. It is observed of some continuous-time LTI system that the input signal = 3 u(t) produces
More informationDiscrete Time Fourier Transform (DTFT)
Discrete Time Fourier Transform (DTFT) 1 Discrete Time Fourier Transform (DTFT) The DTFT is the Fourier transform of choice for analyzing infinite-length signals and systems Useful for conceptual, pencil-and-paper
More informationFinal Exam January 31, Solutions
Final Exam January 31, 014 Signals & Systems (151-0575-01) Prof. R. D Andrea & P. Reist Solutions Exam Duration: Number of Problems: Total Points: Permitted aids: Important: 150 minutes 7 problems 50 points
More informationLecture Notes on Fundamentals of Audio-Video Signal Processing
Marco Tagliasacchi Lecture Notes on Fundamentals of Audio-Video Signal Processing November 12, 2007 Politecnico di Milano Contents Part I Fundamentals of Digital Signal Processing 1 Introduction to the
More informationELEN 4810 Midterm Exam
ELEN 4810 Midterm Exam Wednesday, October 26, 2016, 10:10-11:25 AM. One sheet of handwritten notes is allowed. No electronics of any kind are allowed. Please record your answers in the exam booklet. Raise
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 8: February 12th, 2019 Sampling and Reconstruction Lecture Outline! Review " Ideal sampling " Frequency response of sampled signal " Reconstruction " Anti-aliasing
More informationSignals & Systems Handout #4
Signals & Systems Handout #4 H-4. Elementary Discrete-Domain Functions (Sequences): Discrete-domain functions are defined for n Z. H-4.. Sequence Notation: We use the following notation to indicate the
More informationECE503: Digital Signal Processing Lecture 4
ECE503: Digital Signal Processing Lecture 4 D. Richard Brown III WPI 06-February-2012 WPI D. Richard Brown III 06-February-2012 1 / 29 Lecture 4 Topics 1. Motivation for the z-transform. 2. Definition
More informationTopic 4: The Z Transform
ELEN E480: Digital Signal Processing Topic 4: The Z Transform. The Z Transform 2. Inverse Z Transform . The Z Transform Powerful tool for analyzing & designing DT systems Generalization of the DTFT: G(z)
More informationECE 308 SIGNALS AND SYSTEMS SPRING 2013 Examination #2 14 March 2013
ECE 308 SIGNALS AND SYSTEMS SPRING 2013 Examination #2 14 March 2013 Name: Instructions: The examination lasts for 75 minutes and is closed book, closed notes. No electronic devices are permitted, including
More informationEE 438 Essential Definitions and Relations
May 2004 EE 438 Essential Definitions and Relations CT Metrics. Energy E x = x(t) 2 dt 2. Power P x = lim T 2T T / 2 T / 2 x(t) 2 dt 3. root mean squared value x rms = P x 4. Area A x = x(t) dt 5. Average
More informationThe Johns Hopkins University Department of Electrical and Computer Engineering Introduction to Linear Systems Fall 2002.
The Johns Hopkins University Department of Electrical and Computer Engineering 505.460 Introduction to Linear Systems Fall 2002 Final exam Name: You are allowed to use: 1. Table 3.1 (page 206) & Table
More informationEE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, Cover Sheet
EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, 2012 Cover Sheet Test Duration: 75 minutes. Coverage: Chaps. 5,7 Open Book but Closed Notes. One 8.5 in. x 11 in. crib sheet Calculators
More informationHomework: 4.50 & 4.51 of the attachment Tutorial Problems: 7.41, 7.44, 7.47, Signals & Systems Sampling P1
Homework: 4.50 & 4.51 of the attachment Tutorial Problems: 7.41, 7.44, 7.47, 7.49 Signals & Systems Sampling P1 Undersampling & Aliasing Undersampling: insufficient sampling frequency ω s < 2ω M Perfect
More informationDiscrete-Time David Johns and Ken Martin University of Toronto
Discrete-Time David Johns and Ken Martin University of Toronto (johns@eecg.toronto.edu) (martin@eecg.toronto.edu) University of Toronto 1 of 40 Overview of Some Signal Spectra x c () t st () x s () t xn
More informationDigital Signal Processing: Signal Transforms
Digital Signal Processing: Signal Transforms Aishy Amer, Mohammed Ghazal January 19, 1 Instructions: 1. This tutorial introduces frequency analysis in Matlab using the Fourier and z transforms.. More Matlab
More informationA.1 THE SAMPLED TIME DOMAIN AND THE Z TRANSFORM. 0 δ(t)dt = 1, (A.1) δ(t)dt =
APPENDIX A THE Z TRANSFORM One of the most useful techniques in engineering or scientific analysis is transforming a problem from the time domain to the frequency domain ( 3). Using a Fourier or Laplace
More informationLecture 19: Discrete Fourier Series
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 19: Discrete Fourier Series Dec 5, 2001 Prof: J. Bilmes TA: Mingzhou
More informationE : Lecture 1 Introduction
E85.2607: Lecture 1 Introduction 1 Administrivia 2 DSP review 3 Fun with Matlab E85.2607: Lecture 1 Introduction 2010-01-21 1 / 24 Course overview Advanced Digital Signal Theory Design, analysis, and implementation
More informationA system that is both linear and time-invariant is called linear time-invariant (LTI).
The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Lecture Notes: Time, Frequency & Transform Domains February 28, 2012 Signals & Systems Signals are mapped
More informationSinc Functions. Continuous-Time Rectangular Pulse
Sinc Functions The Cooper Union Department of Electrical Engineering ECE114 Digital Signal Processing Lecture Notes: Sinc Functions and Sampling Theory October 7, 2011 A rectangular pulse in time/frequency
More information6.003 Signal Processing
6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal
More informationFinal Exam of ECE301, Prof. Wang s section 8 10am Tuesday, May 6, 2014, EE 129.
Final Exam of ECE301, Prof. Wang s section 8 10am Tuesday, May 6, 2014, EE 129. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, e-mail address, and signature
More informationECE503: Digital Signal Processing Lecture 5
ECE53: Digital Signal Processing Lecture 5 D. Richard Brown III WPI 3-February-22 WPI D. Richard Brown III 3-February-22 / 32 Lecture 5 Topics. Magnitude and phase characterization of transfer functions
More informationMultidimensional digital signal processing
PSfrag replacements Two-dimensional discrete signals N 1 A 2-D discrete signal (also N called a sequence or array) is a function 2 defined over thex(n set 1 of, n 2 ordered ) pairs of integers: y(nx 1,
More informationExercises in Digital Signal Processing
Exercises in Digital Signal Processing Ivan W. Selesnick September, 5 Contents The Discrete Fourier Transform The Fast Fourier Transform 8 3 Filters and Review 4 Linear-Phase FIR Digital Filters 5 5 Windows
More informationFinal Exam 14 May LAST Name FIRST Name Lab Time
EECS 20n: Structure and Interpretation of Signals and Systems Department of Electrical Engineering and Computer Sciences UNIVERSITY OF CALIFORNIA BERKELEY Final Exam 14 May 2005 LAST Name FIRST Name Lab
More informationECE 301 Division 1, Fall 2008 Instructor: Mimi Boutin Final Examination Instructions:
ECE 30 Division, all 2008 Instructor: Mimi Boutin inal Examination Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out the requested
More informationTable 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients
able : Properties of the Continuous-ime Fourier Series x(t = a k e jkω0t = a k = x(te jkω0t dt = a k e jk(/t x(te jk(/t dt Property Periodic Signal Fourier Series Coefficients x(t y(t } Periodic with period
More information6.003 Signal Processing
6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal
More informationLike bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform.
Inversion of the z-transform Focus on rational z-transform of z 1. Apply partial fraction expansion. Like bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform. Let X(z)
More informationTTT4120 Digital Signal Processing Suggested Solutions for Problem Set 2
Norwegian University of Science and Technology Department of Electronics and Telecommunications TTT42 Digital Signal Processing Suggested Solutions for Problem Set 2 Problem (a) The spectrum X(ω) can be
More informationFourier transform representation of CT aperiodic signals Section 4.1
Fourier transform representation of CT aperiodic signals Section 4. A large class of aperiodic CT signals can be represented by the CT Fourier transform (CTFT). The (CT) Fourier transform (or spectrum)
More informationSolutions. Number of Problems: 10
Final Exam February 4th, 01 Signals & Systems (151-0575-01) Prof. R. D Andrea Solutions Exam Duration: 150 minutes Number of Problems: 10 Permitted aids: One double-sided A4 sheet. Questions can be answered
More informationSignals and Systems. Problem Set: The z-transform and DT Fourier Transform
Signals and Systems Problem Set: The z-transform and DT Fourier Transform Updated: October 9, 7 Problem Set Problem - Transfer functions in MATLAB A discrete-time, causal LTI system is described by the
More informationUniversity of Illinois at Urbana-Champaign ECE 310: Digital Signal Processing
University of Illinois at Urbana-Champaign ECE 3: Digital Signal Processing Chandra Radhakrishnan PROBLEM SE 5: SOLUIONS Peter Kairouz Problem o derive x a (t (X a (Ω from X d (ω, we first need to get
More informationECGR4124 Digital Signal Processing Final Spring 2009
ECGR4124 Digital Signal Processing Final Spring 2009 Name: LAST 4 NUMBERS of Student Number: Do NOT begin until told to do so Make sure that you have all pages before starting Open book, 2 sheet front/back
More information/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by
Code No: RR320402 Set No. 1 III B.Tech II Semester Regular Examinations, Apr/May 2006 DIGITAL SIGNAL PROCESSING ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering,
More informationTable 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients
able : Properties of the Continuous-ime Fourier Series x(t = e jkω0t = = x(te jkω0t dt = e jk(/t x(te jk(/t dt Property Periodic Signal Fourier Series Coefficients x(t y(t } Periodic with period and fundamental
More informationQuestion Paper Code : AEC11T02
Hall Ticket No Question Paper Code : AEC11T02 VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad Four Year B. Tech III Semester Tutorial Question Bank 2013-14 (Regulations: VCE-R11)
More informationECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION
FINAL EXAMINATION 9:00 am 12:00 pm, December 20, 2010 Duration: 180 minutes Examiner: Prof. M. Vu Assoc. Examiner: Prof. B. Champagne There are 6 questions for a total of 120 points. This is a closed book
More information2A1H Time-Frequency Analysis II Bugs/queries to HT 2011 For hints and answers visit dwm/courses/2tf
Time-Frequency Analysis II (HT 20) 2AH 2AH Time-Frequency Analysis II Bugs/queries to david.murray@eng.ox.ac.uk HT 20 For hints and answers visit www.robots.ox.ac.uk/ dwm/courses/2tf David Murray. A periodic
More informationDHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A
DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A Classification of systems : Continuous and Discrete
More informationDefinition. A signal is a sequence of numbers. sequence is also referred to as being in l 1 (Z), or just in l 1. A sequence {x(n)} satisfying
Signals and Systems. Definition. A signal is a sequence of numbers {x(n)} n Z satisfying n Z x(n)
More informationVoiced Speech. Unvoiced Speech
Digital Speech Processing Lecture 2 Homomorphic Speech Processing General Discrete-Time Model of Speech Production p [ n] = p[ n] h [ n] Voiced Speech L h [ n] = A g[ n] v[ n] r[ n] V V V p [ n ] = u [
More informationECGR4124 Digital Signal Processing Exam 2 Spring 2017
ECGR4124 Digital Signal Processing Exam 2 Spring 2017 Name: LAST 4 NUMBERS of Student Number: Do NOT begin until told to do so Make sure that you have all pages before starting NO TEXTBOOK, NO CALCULATOR,
More informationAPPLIED SIGNAL PROCESSING
APPLIED SIGNAL PROCESSING DIGITAL FILTERS Digital filters are discrete-time linear systems { x[n] } G { y[n] } Impulse response: y[n] = h[0]x[n] + h[1]x[n 1] + 2 DIGITAL FILTER TYPES FIR (Finite Impulse
More informationEE 521: Instrumentation and Measurements
Aly El-Osery Electrical Engineering Department, New Mexico Tech Socorro, New Mexico, USA November 1, 2009 1 / 27 1 The z-transform 2 Linear Time-Invariant System 3 Filter Design IIR Filters FIR Filters
More informationDigital Signal Processing Lecture 9 - Design of Digital Filters - FIR
Digital Signal Processing - Design of Digital Filters - FIR Electrical Engineering and Computer Science University of Tennessee, Knoxville November 3, 2015 Overview 1 2 3 4 Roadmap Introduction Discrete-time
More informationDigital Signal Processing Lecture 8 - Filter Design - IIR
Digital Signal Processing - Filter Design - IIR Electrical Engineering and Computer Science University of Tennessee, Knoxville October 20, 2015 Overview 1 2 3 4 5 6 Roadmap Discrete-time signals and systems
More information