EE 438 Essential Definitions and Relations
|
|
- Georgiana Wilkerson
- 5 years ago
- Views:
Transcription
1 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 value T / 2 x avg = T lim x(t ) 2T dt T / 2 6. Magnitude M x = max x(t) <t < DT Metrics. Energy E x = 2 n = 2. Power P x = lim N 2N + N n = N 2 3. root mean squared value x rms = P x 4. Area A x = n = 5. Average x avg = lim N 2N + 6. Magnitude M x = max <n < CT Signals and Operators, t < / 2. rect (t) = 0, t > / 2 2. sinc(t) = sin(πt) πt 3. δ(t ) = lim Δ 0 Δ rect t Δ N n = N 4. x(t) y(t) = x(t τ)y( τ)dτ 5. rep T [x(t)] = x(t kt ) k = 6. comb T [x(t)] = x(kt) δ(t kt) k = Properties of the CT Impulse. δ(t) dt = and δ(t) = 0, t 0 2. δ(t t 0 ) x(t)dt = x(t 0 ), provided x(t) is continuous at t = t 0 3. x(t)δ(t t 0 ) x(t 0 )δ(t t 0 ) 4. δ(t t 0 ) x(t) = x(t t 0 ) 5. δ(at t 0) a δ(t t 0 / a) CTFT Sufficient conditions for existence x(t ) dt < or x(t) 2 dt Inverse transform X( f ) = x(t)e j 2πft dt x(t) = X( f )e j 2πft df
2 May EE 438 Essential Definitions.... Linearity a x (t) + a 2 x 2 (t) CTFT a X ( f ) + a 2 X 2 ( f ) 2. Scaling and shifting x t t 0 CTFT a a X(af )e j2πft 0 x(t)e j2 πf 0 t CTFT X( f f 0 ) 4. Reciprocity X(t) CTFT x( f ) 5. Parseval x(t ) 2 dt = X( f ) 2 df 6. Initial Value X(0) = x(t) dt x(0) = X( f ) df 7. Convolution x(t) y(t) CTFT X( f )Y( f ) 8. Product x(t)y(t) CTFT X ( f ) Y( f ) 9. Transform of periodic signal CTFT rep T [x(t)] T comb [X( f )] T 0. Transform of sampled signal CTFT comb T [x(t)] T rep [X( f )] T. rect (t) CTFT sinc(f) 2. δ(t ) CTFT and CTFT δ( f ) 3. e j2πf t CTFT 0 δ( f f 0 ) 4. cos(2πf 0 t) CTFT 2 {δ( f f 0 ) DT Signals and Operators. u[n] =, n 0 0, n < 0 2. δ[n] =, n = 0 0, n 0 + δ( f + f 0 )} 3. y[n] = x[n k]y[k] k = D 4. Downsampling y[n] = x[dn] y[n] y[n] D 5. Upsampling x[n / D], n / D integer - valued y[n] = 0, else Properties of the DT Impulse. δ[n] = and δ[n] = 0, n 0 n= 2. δ[n n 0 ] = x[n 0 ] n = 3. δ[n n 0 ] = x[n n 0 ] DTFT Sufficient conditions for existence
3 May EE 438 Essential Definitions... < or 2 < n = X(ω) = Inverse transform = 2π n= π π n = e jωn X(ω)e jωn dω. Linearity a x [n] + a 2 x 2 [n] DTFT a X (ω) + a 2 X 2 (ω) 2. Shifting x[n n 0 ] DTFT X(ω)e jωn 0 4. Parseval e jω 0 n DTFT X(ω ω 0 ) 2 = 2π n = 5. Initial Value X(0) = n= x[0] = 2π π π π π X(ω) 2 dω X(ω)d ω 6. Convolution y[n] DTFT X(ω)Y(ω) 7. Product y[n] DTFT 2π π X (ω µ)y(µ)d µ π 8. Downsampling Y(ω) = D D k= 0 D y[n] X ω 2πk D y[n] D 0. Upsampling Y(ω) = X(Dω). δ[n] DTFT 2. DTFT 2π rep 2π [δ(ω)] 3. e jω n DTFT 0 2π rep 2 π [δ(ω ω 0 )] 4. cos(ω 0 n) DTFT π rep 2π [δ(ω ω 0 ) + δ(ω + ω 0 )] 5. =, n = 0,,..., N 0, else X(ω) = DTFT sin(ωn / 2) sin(ω / 2) e jω ( N ) / 2 Relation between CT and DT. Time Domain x d [n] = x a (nt) 2. Frequency Domain ZT [ ] f a = ω d f s 2π X d (ω d ) = f s rep f s X a ( f a ) X(z) = where f s = T n = z n,
4 May EE 438 Essential Definitions.... Linearity a x [n] + a 2 x 2 [n] ZT a X (z) + a 2 X 2 (z) 2. Shifting x[n n 0 ] ZT X(ω )z n 0 z 0 n ZT X(z / z 0 ) 4. Multiplication by time index 6. Convolution n ZT z d dz [ X(z) ] y[n] ZT X(z)Y(z) 7. Relation to DTFT If X ZT (z) converges for z =, then the DTFT of exists and X DTFT (ω ) = X ZT (z) z=e jω. δ[n] ZT, all z 2. a n u[n] ZT, z > a az 3. a n u[ n ] ZT az, z < a 4. n a n u[n] ZT az ( az 2, z > a ) 5. na n u[ n ] ZT az ( az ) 2, z < a DFT X[k] = N n=0 Inverse transform = N N k =0. Linearity j2 πkn/ N e j2 πkn /N X[k]e a x [n] + a 2 x 2 [n] DFT a X [k] + a 2 X 2 [k] 2. Shifting 4. Reciprocity 5. Parseval x[n n 0 ] DFT X[k ]e j2πn 0 k / N e j2πnk 0 / N DFT X[k k 0 ] N n=0 6. Initial Value 7. Periodicity X[n] DFT N x[ k] 2 = N X[0] = N n =0 x[0] = N x[n + mn] = X[k + ln ] = X[k] N k= 0 N k = 0 X[k] X[k ] 2 for all integers m for all integers l 8. Relation to DTFT of a finite length sequence Let x 0 [n] 0 only for 0 n N
5 May EE 438 Essential Definitions... Define = x 0 [n] DTFT X 0 (ω). x 0 [n + mn], m= DFT X[k], ( ). j2 πk /N then X[k] = X 0 e 6. Periodic convolution 7. Product y[n] DFT X[k]Y[k] y[n] DFT X[k ] Y[k] δ[n], 0 n N DFT., 0 k N, 0 n N DFT 2. Nδ[k], 0 k N e j2 πk 0 n/n, 0 n N DFT 3. Nδ[k - k 0 ], 0 k N cos(2πk 0 n / N ), 0 n N DFT N { 2 δ[k - k 0 ] + δ[k - (N- k 0 )] }, 0 k N e jω 0 n,n = 0,,..., N DFT [ ] sin [(2πk / N ω 0 ) / 2] sin (2πk / N ω 0 )(N / 2) Random Signals j( 2 πk / N ω 0 )( N ) /2 e. Probability density function f X (x) P{a < X b} = b a f X (x)dx f X (x)dx = f X (x) 0 2. Probability distribution function F X (x) F X (x) = x f X (ξ )dξ f X (x) = df X (x) dx F X ( ) = 0 F X () = F X (x) is a nondecreasing function of x Expectation Operator E{g(X)} =. Mean g(x) = x 2. 2nd moment g(x) = x 2 g(x) f X (x)dx 3. Variance g(x) = (x E{X}) 2 4. Relation between mean, 2nd moment, and variance σ X 2 = E{X 2 } (E{X}) 2 Two Random Variables. Bivariate probability density function f XY (x, y) P{a < X b, c < Y d} = b d a c f XY (x,y)dxdy f XY (x,y)dxdy = f XY (x, y) 0 2. Marginal probability density functions f X (x) and f Y (y) f X (x) = f XY (x, y)dy
6 May EE 438 Essential Definitions... f Y (y) = f XY (x, y)dx 3. Linearity of expectation E{ag(X,Y) + bh(x,y)} = ae{g(x,y)}+ be{h(x,y)} 4. Correlation of X and Y E{XY} = 5. Covariance of X and Y 2 σ XY xyf XY (x, y)dxdy = E{(X E{X})(Y E{Y})} = E{XY} E{X}E{Y} 6. Correlation coefficient of X and Y ρ XY = σ 2 XY σ X σ Y 0 ρ XY 7. X and Y are independent if and only if f XY (x, y) = f X (x) f Y (y) 8. X and Y are uncorrelated if and only if E{XY} = E{X}E{Y} Independence implies uncorrelatedness. The converse is not true. Discrete-time random signals. Autocorrelation function r XX [m, m + n] = E{X[m]X[m + n]} X[m]is wide-sense stationary if and only if mean is constant, and autocorrelation depends only on difference between arguments, i.e. E{X[n]}= µ X r XX [n] = E{X[m]X[m + n]} 2. Cross-correlation function r XY [m, m + n] = E{X[m]Y[m + n]} X[m] and Y[m] are jointly wide-sense stationary if and only if they are individually wide-sense stationary and their cross-correlation depends only on difference between arguments, i.e. r XY [n] = E{X[m]Y[m + n]} 3. Wide-sense stationary processes and linear systems. Let X[n] be wide-sense stationary, and suppose that Y[n] = h[n] X[n] = h[n m]x[m], then X[n] and Y[n] are jointly widesense stationary, and m µ X = µ Y h[m] m r XY [n] = h[n] r XX [n] r YY [n] = h[n] r XY [ n] 2D CS Signals and Operators, x, y < / 2. rect(x, y) = 0, x, y > / 2 2. sinc(x,y) = sin(πx ) πx sin(πy) πy 3. circ( x,y) =, x2 + y 2 < / 2 0 x 2 + y 2 > / 2 4. jinc(x,y) = J ( π x 2 + y ) 2 2 x 2 + y 2 5. δ(x, y) = lim Δ 0 Δ 2 rect x Δ, y Δ 6. f (x, y) g(x, y) = f (x ξ, y η)g( ξ, η)dξdη
7 May EE 438 Essential Definitions rep XY [ f (x, y)] = k = l= comb XY [ f (x, y)] = k = l= 9. Separability f (x kx,y ly) f (kx,ly )δ(x kx,y ly) f (x, y) = g(x) h(y) Properties of the CS Impulse. 2. δ (x, y) dxdy = and δ(x, y) = 0, (x, y) (0,0) δ (x x 0, y y 0 ) f (x,y)dxdy = f (x 0, y 0 ), provided f (x, y) is continuous at (x,y) = (x 0, y 0 ) δ(x x 0, y y 0 ) f (x,y) = 3. f (x x 0, y y 0 ) CSFT Sufficient conditions for existence or f (x, y) dxdy < F(u, v) = f (x, y) 2 dxdy < f (x, y)e j2π (ux+ vy) dxdy Inverse transform f (x, y) = F(u, v)e j2 π (ux+ vy). Linearity a f (x,y) + a 2 f 2 (x, y) CSFT a F (u, v) + a 2 F 2 (u, v) 2. Scaling and shifting x x f 0, y y 0 CSFT a b dudv ab F(au, bv)e j2π (ux 0 +vy 0 ) f (x, y)e j 2π (u 0 x+ v 0 y) CSFT F(u u 0, v v 0 ) 4. Reciprocity F(x, y) CSFT f ( u, v) 5. Parseval f (x, y) 2 dxdy = F(u, v) 2 dudv 6. Initial Value F(0, 0) = f (x, y) dxdy x(0,0) = F(u, v) dudv 7. Convolution f (x, y) g(x, y) CSFT F(u, v)g(u, v) 8. Product f (x, y)g(x,y) CSFT F(u, v) G(u, v)
8 May EE 438 Essential Definitions Transform of doubly periodic signal rep XY [ f (x, y)] CSFT XY comb XY 0. Transform of sampled signal CSFT comb XY [ f (x, y)] XY rep XY [F(u, v)] [F(u, v)] 2. N roots z k, k = 0,K, N, of a complex constant u 0, i.e. N solutions to z N u 0 = 0 / N = u 0 e j ( 2 πk+ u 0) / N, k = 0,K,N z k. Transform of separable signal g(x) h(y) CSFT G(u) H(v). rect(x, y) CSFT sinc(u,v) 2. circ( x,y) CSFT jinc( u, v) 3. δ(x, y) CSFT and CSFT δ (u, v) 4. e j2π(u 0 x +v 0 y) CSFT δ (u u 0,v v 0 ) 5. cos[ 2π(u 0 x + v 0 y) ] CTFT 2 {δ(u u 0,v v 0 ) + δ(u + u 0,v + v 0 )} Computed Tomography. Radon Transform (Projection) p θ (t) = f (x, y)δ(x cosθ + y sinθ t)dxdy 2. Fourier Slice Theorem P θ (ρ) = p θ (t) e j 2πρ t dt = F(ρ cosθ, ρsinθ) Miscellaneous. Geometric Series N z n n= 0 = z N z
EE 637 Final April 30, Spring Each problem is worth 20 points for a total score of 100 points
EE 637 Final April 30, Spring 2018 Name: Instructions: This is a 120 minute exam containing five problems. Each problem is worth 20 points for a total score of 100 points You may only use your brain and
More informationGood Luck. EE 637 Final May 4, Spring Name: Instructions: This is a 120 minute exam containing five problems.
EE 637 Final May 4, Spring 200 Name: Instructions: This is a 20 minute exam containing five problems. Each problem is worth 20 points for a total score of 00 points You may only use your brain and a pencil
More informationconditional cdf, conditional pdf, total probability theorem?
6 Multiple Random Variables 6.0 INTRODUCTION scalar vs. random variable cdf, pdf transformation of a random variable conditional cdf, conditional pdf, total probability theorem expectation of a random
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 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 informationSignals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions
8-90 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 08 Midterm Solutions Name: Andrew ID: Problem Score Max 8 5 3 6 4 7 5 8 6 7 6 8 6 9 0 0 Total 00 Midterm Solutions. (8 points) Indicate whether
More information5 Operations on Multiple Random Variables
EE360 Random Signal analysis Chapter 5: Operations on Multiple Random Variables 5 Operations on Multiple Random Variables Expected value of a function of r.v. s Two r.v. s: ḡ = E[g(X, Y )] = g(x, y)f X,Y
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 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 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 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 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 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 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 informationECE 301 Division 1, Fall 2006 Instructor: Mimi Boutin Final Examination
ECE 30 Division, all 2006 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 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 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 informationx[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
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
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 informationContents. Signals as functions (1D, 2D)
Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component
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 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 informationContents. Signals as functions (1D, 2D)
Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component
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 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 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 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 informationEE 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 informationLecture 7 ELE 301: Signals and Systems
Lecture 7 ELE 30: Signals and Systems Prof. Paul Cuff Princeton University Fall 20-2 Cuff (Lecture 7) ELE 30: Signals and Systems Fall 20-2 / 22 Introduction to Fourier Transforms Fourier transform as
More informationInterchange of Filtering and Downsampling/Upsampling
Interchange of Filtering and Downsampling/Upsampling Downsampling and upsampling are linear systems, but not LTI systems. They cannot be implemented by difference equations, and so we cannot apply z-transform
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 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 informationSignal Processing Signal and System Classifications. Chapter 13
Chapter 3 Signal Processing 3.. Signal and System Classifications In general, electrical signals can represent either current or voltage, and may be classified into two main categories: energy signals
More informationBackprojection. Projections. Projections " $ & cosθ & Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2014 CT/Fourier Lecture 2
Backprojection Bioengineering 280A Principles of Biomedical Imaging 3 0 0 0 0 3 0 0 0 0 0 3 0 0 3 0 3 Fall Quarter 2014 CT/Fourier Lecture 2 0 0 0 1 1 1 0 0 0 1 0 0 1 2 1 0 0 1 1 1 0 1 3 1 0 1 1 1 1 1
More informationVer 3808 E1.10 Fourier Series and Transforms (2014) E1.10 Fourier Series and Transforms. Problem Sheet 1 (Lecture 1)
Ver 88 E. Fourier Series and Transforms 4 Key: [A] easy... [E]hard Questions from RBH textbook: 4., 4.8. E. Fourier Series and Transforms Problem Sheet Lecture. [B] Using the geometric progression formula,
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 informationOverview. Signals as functions (1D, 2D) 1D Fourier Transform. 2D Fourier Transforms. Discrete Fourier Transform (DFT) Discrete Cosine Transform (DCT)
Fourier Transform Overview Signals as functions (1D, 2D) Tools 1D Fourier Transform Summary of definition and properties in the different cases CTFT, CTFS, DTFS, DTFT DFT 2D Fourier Transforms Generalities
More information1 Signals and systems
978--52-5688-4 - Introduction to Orthogonal Transforms: With Applications in Data Processing and Analysis Signals and systems In the first two chapters we will consider some basic concepts and ideas as
More informationContents. Signals as functions (1D, 2D)
Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component
More informationContinuous Random Variables
1 / 24 Continuous Random Variables Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay February 27, 2013 2 / 24 Continuous Random Variables
More information8 The Discrete Fourier Transform (DFT)
8 The Discrete Fourier Transform (DFT) ² Discrete-Time Fourier Transform and Z-transform are de ned over in niteduration sequence. Both transforms are functions of continuous variables (ω and z). For nite-duration
More informationEach problem is worth 25 points, and you may solve the problems in any order.
EE 120: Signals & Systems Department of Electrical Engineering and Computer Sciences University of California, Berkeley Midterm Exam #2 April 11, 2016, 2:10-4:00pm Instructions: There are four questions
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 informationChap 2. Discrete-Time Signals and Systems
Digital Signal Processing Chap 2. Discrete-Time Signals and Systems Chang-Su Kim Discrete-Time Signals CT Signal DT Signal Representation 0 4 1 1 1 2 3 Functional representation 1, n 1,3 x[ n] 4, n 2 0,
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 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 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 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 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 informationDigital Signal Processing. Lecture Notes and Exam Questions DRAFT
Digital Signal Processing Lecture Notes and Exam Questions Convolution Sum January 31, 2006 Convolution Sum of Two Finite Sequences Consider convolution of h(n) and g(n) (M>N); y(n) = h(n), n =0... M 1
More informationFourier series for continuous and discrete time signals
8-9 Signals and Systems Fall 5 Fourier series for continuous and discrete time signals The road to Fourier : Two weeks ago you saw that if we give a complex exponential as an input to a system, the output
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 informationRandom Signals and Systems. Chapter 3. Jitendra K Tugnait. Department of Electrical & Computer Engineering. Auburn University.
Random Signals and Systems Chapter 3 Jitendra K Tugnait Professor Department of Electrical & Computer Engineering Auburn University Two Random Variables Previously, we only dealt with one random variable
More informationAtmospheric Flight Dynamics Example Exam 1 Solutions
Atmospheric Flight Dynamics Example Exam 1 Solutions 1 Question Figure 1: Product function Rūū (τ) In figure 1 the product function Rūū (τ) of the stationary stochastic process ū is given. What can be
More informationDISCRETE FOURIER TRANSFORM
DISCRETE FOURIER TRANSFORM 1. Introduction The sampled discrete-time fourier transform (DTFT) of a finite length, discrete-time signal is known as the discrete Fourier transform (DFT). The DFT contains
More informationECE534, Spring 2018: Solutions for Problem Set #5
ECE534, Spring 08: s for Problem Set #5 Mean Value and Autocorrelation Functions Consider a random process X(t) such that (i) X(t) ± (ii) The number of zero crossings, N(t), in the interval (0, t) is described
More informationSpin-Warp Pulse Sequence
Bioengineering 28A Principles of Biomedical Imaging Fall Quarter 25 Linear Systems Lecture Spin-Warp Pulse Sequence RF G x (t G y (t k y k x K-space trajectories EPI Spiral k y k y k x k x Credit: Larry
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 informationQUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)
QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE) 1. For the signal shown in Fig. 1, find x(2t + 3). i. Fig. 1 2. What is the classification of the systems? 3. What are the Dirichlet s conditions of Fourier
More informationDiscrete-time Signals and Systems in
Discrete-time Signals and Systems in the Frequency Domain Chapter 3, Sections 3.1-39 3.9 Chapter 4, Sections 4.8-4.9 Dr. Iyad Jafar Outline Introduction The Continuous-Time FourierTransform (CTFT) The
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 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 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 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 informationBASICS OF PROBABILITY
October 10, 2018 BASICS OF PROBABILITY Randomness, sample space and probability Probability is concerned with random experiments. That is, an experiment, the outcome of which cannot be predicted with certainty,
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 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 informationMultiple Random Variables
Multiple Random Variables Joint Probability Density Let X and Y be two random variables. Their joint distribution function is F ( XY x, y) P X x Y y. F XY ( ) 1, < x
More informationPerhaps the simplest way of modeling two (discrete) random variables is by means of a joint PMF, defined as follows.
Chapter 5 Two Random Variables In a practical engineering problem, there is almost always causal relationship between different events. Some relationships are determined by physical laws, e.g., voltage
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 informationFormulas for probability theory and linear models SF2941
Formulas for probability theory and linear models SF2941 These pages + Appendix 2 of Gut) are permitted as assistance at the exam. 11 maj 2008 Selected formulae of probability Bivariate probability Transforms
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 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 informationFoundations of Signal Processing Tables
Foundations of Signal Processing Tables Martin Vetterli École Polytechnique Fédérale de Lausanne and University of California, Berkeley Jelena Kovačević Carnegie Mellon University Vivek K Goyal Massachusetts
More informationLecture 4: FT Pairs, Random Signals and z-transform
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 4: T Pairs, Rom Signals z-transform Wed., Oct. 10, 2001 Prof: J. Bilmes
More informationFrequency-Domain C/S of LTI Systems
Frequency-Domain C/S of LTI Systems x(n) LTI y(n) LTI: Linear Time-Invariant system h(n), the impulse response of an LTI systems describes the time domain c/s. H(ω), the frequency response describes the
More informationFundamentals of Digital Commun. Ch. 4: Random Variables and Random Processes
Fundamentals of Digital Commun. Ch. 4: Random Variables and Random Processes Klaus Witrisal witrisal@tugraz.at Signal Processing and Speech Communication Laboratory www.spsc.tugraz.at Graz University of
More informationChap 4. Sampling of Continuous-Time Signals
Digital Signal Processing Chap 4. Sampling of Continuous-Time Signals Chang-Su Kim Digital Processing of Continuous-Time Signals Digital processing of a CT signal involves three basic steps 1. Conversion
More informationHomework 7 Solution EE235, Spring Find the Fourier transform of the following signals using tables: te t u(t) h(t) = sin(2πt)e t u(t) (2)
Homework 7 Solution EE35, Spring. Find the Fourier transform of the following signals using tables: (a) te t u(t) h(t) H(jω) te t u(t) ( + jω) (b) sin(πt)e t u(t) h(t) sin(πt)e t u(t) () h(t) ( ejπt e
More informationTopics: Discrete transforms; 1 and 2D Filters, sampling, and scanning
EE 637 Study Solutions - Assignment 3 Topics: Discrete transforms; and D Filters, sampling, and scanning Spring 00 Exam : Problem 3 (sampling Consider a sampling system were the input, s(t = sinc(t, is
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 informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 9: February 13th, 2018 Downsampling/Upsampling and Practical Interpolation Lecture Outline! CT processing of DT signals! Downsampling! Upsampling 2 Continuous-Time
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 informationHomework 8 Solutions
EE264 Dec 3, 2004 Fall 04 05 HO#27 Problem Interpolation (5 points) Homework 8 Solutions 30 points total Ω = 2π/T f(t) = sin( Ω 0 t) T f (t) DAC ˆf(t) interpolated output In this problem I ll use the notation
More informationLecture 8 ELE 301: Signals and Systems
Lecture 8 ELE 30: Signals and Systems Prof. Paul Cuff Princeton University Fall 20-2 Cuff (Lecture 7) ELE 30: Signals and Systems Fall 20-2 / 37 Properties of the Fourier Transform Properties of the Fourier
More informationP (x). all other X j =x j. If X is a continuous random vector (see p.172), then the marginal distributions of X i are: f(x)dx 1 dx n
JOINT DENSITIES - RANDOM VECTORS - REVIEW Joint densities describe probability distributions of a random vector X: an n-dimensional vector of random variables, ie, X = (X 1,, X n ), where all X is are
More informationEE538 Final Exam Fall :20 pm -5:20 pm PHYS 223 Dec. 17, Cover Sheet
EE538 Final Exam Fall 005 3:0 pm -5:0 pm PHYS 3 Dec. 17, 005 Cover Sheet Test Duration: 10 minutes. Open Book but Closed Notes. Calculators ARE allowed!! This test contains five problems. Each of the five
More informationReview of Fundamentals of Digital Signal Processing
Chapter 2 Review of Fundamentals of Digital Signal Processing 2.1 (a) This system is not linear (the constant term makes it non linear) but is shift-invariant (b) This system is linear but not shift-invariant
More informationSolutions. Number of Problems: 10
Final Exam February 9th, 2 Signals & Systems (5-575-) Prof. R. D Andrea Solutions Exam Duration: 5 minutes Number of Problems: Permitted aids: One double-sided A4 sheet. Questions can be answered in English
More informationIntroduction to the Calculus of Variations
236861 Numerical Geometry of Images Tutorial 1 Introduction to the Calculus of Variations Alex Bronstein c 2005 1 Calculus Calculus of variations 1. Function Functional f : R n R Example: f(x, y) =x 2
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 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 informationThis examination consists of 10 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS
THE UNIVERSITY OF BRITISH COLUMBIA Department of Electrical and Computer Engineering EECE 564 Detection and Estimation of Signals in Noise Final Examination 08 December 2009 This examination consists of
More informationProblem Sheet 1 Examples of Random Processes
RANDOM'PROCESSES'AND'TIME'SERIES'ANALYSIS.'PART'II:'RANDOM'PROCESSES' '''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''Problem'Sheets' Problem Sheet 1 Examples of Random Processes 1. Give
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 informationSTA 256: Statistics and Probability I
Al Nosedal. University of Toronto. Fall 2017 My momma always said: Life was like a box of chocolates. You never know what you re gonna get. Forrest Gump. There are situations where one might be interested
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 informationRepresenting a Signal
The Fourier Series Representing a Signal The convolution method for finding the response of a system to an excitation takes advantage of the linearity and timeinvariance of the system and represents the
More informationEEE4001F EXAM DIGITAL SIGNAL PROCESSING. University of Cape Town Department of Electrical Engineering PART A. June hours.
EEE400F EXAM DIGITAL SIGNAL PROCESSING PART A Basic digital signal processing theory.. A sequencex[n] has a zero-phase DTFT X(e jω ) given below: X(e jω ) University of Cape Town Department of Electrical
More information