ECE-S Introduction to Digital Signal Processing Lecture 3C Properties of Autocorrelation and Correlation
|
|
- Shon Owens
- 6 years ago
- Views:
Transcription
1 ECE-S Introduction to Digital Signal Processing Lecture 3C Properties of Autocorrelation and Correlation Assuming we have two sequences x(n) and y(n) from which we form a linear combination: c(n) = ax(n) + by(n-l) a, b are arbitrary constants, l is some arbitrary shift Recall that the energy of a signal is: E x(n) 2 finite or infinite value n = - if 0 < E < then x(n) is an energy signal E x is the energy of signal x(n) Computing the energy of c(n) in expansion form yields: E c(n) 2 = [ax(n) + by(n-l) ] 2 = n = - n = - a 2 x 2 (n) + n = - b 2 y 2 (n-l) + n = - 2ab x(n)y(n-l) n = - the first two terms are easily identified as: a 2 r xx (0) and b 2 r yy (0) from the definition (repeated below), with l = 0. r xx (l) = x(n)x(n-l) l = 0, ±1, ±2, n= - Thus r xx (0) = E x and r yy (0) = E y the energies of x(n) and y(n) respectively. ECE-S DSP 1 of 6 July 9, 2001
2 Now the complete expression: E c = a 2 r xx (0) + b 2 r yy (0) + 2abr xy (l) must be greater than or equal to zero. a 2 r xx (0) + b 2 r yy (0) + 2abr xy (l) 0 With the assumption that b 0 we may write: (a/b) 2 r xx (0) + r yy (0) + 2(a/b)r xy (l) 0 Now viewing this as a quadratic in the variable (a/b), in order for a nonnegative answer the discriminant must be non-positive which yields the following relationships: r xy (l) [r xx (0) r yy (0)] 1/2 = [E x E y ] 1/2 This places an upper bound on cross correlation in terms of the energy of the two signals for the case where y(n) = x(n) r xx (l) r xx (0) = E x we see that the value l=0 corresponds to the maximum value of the autocorrelation function (which makes perfect sense) Normalizing correlation Scaling does not change the shape of the autocorrelation or crosscorrelation sequences hence we may normalize them producing values in the closed interval [-1, 1] as follows: ρ xx (l) = r xx (l) / r xx (0) ρ xy (l) = r xy (l) / [r xx (0)r yy (0)] 1/2 normalized autocorrelation normalized crosscorrelation Convolution Relationship r xy (l) = x(n) * y(-n) where n = l ECE-S352 DSP 2 of 6
3 Fold and symmetry relationship r xy (l) = r yx (-l) previously shown For the case of autocorrelation: r xx (l) = r xx (-l) which shows that autocorrelation is an even function and we only need to compute r xx (l) for l>=0 Periodic sequences If x(n) and y(n) are two power signals each with period N, the averages over the infinite interval are the same as over a single period and one may write: N-1 r xy (l) =1/N x(n)y(n-l) think of 1/N as a normalization factor N-1 r xx (l) =1/N x(n)x(n-l) Here the correlation sequences are also periodic with period N. One of the main uses of cross correlation is to identify periodicities in an observer signal generally corrupted by noise. where y(n) = x(n) + w(n) y(n) is the observed signal x(n) is the actual signal and has unknown period N w(n) is a random additive noise or interference. We observe M samples of y(n) with the constraints M>>N 0<=n<= ECE-S352 DSP 3 of 6
4 The autocorrelation of y(n) is: r yy (l) = 1/M y(n)y(n-l) r yy (l) = 1/M [x(n)+w(n)][x(n-l)+w(n-l)] = 1/M [x(n)x(n-l)] + ECE-S352 DSP 4 of 6 1/M [x(n)w(n-l) + w(n)x(n-l)] + 1/M [w(n)w(n-l)] Or more compactly: r yy (l) = r xx (l) + r xw (l) + r wx (l) + r ww (l) The cross correlations between the signal x(n) and the interference w(n) are expected to be small since x(n) and w(n) should be unrelated. The autocorrelation of the noise w(n) will have a peak at zero but should rapidly decay to zero. Hence we are left with r yy (l) looking like the autocorrelation of x(n) which should show peaks at 0, N, 2N etc. The caveats here are: (1) that the peak at zero for r yy (l) will be larger due to the autocorrelation of w(n); and (2)since we are using a finite amount of data (M) the values of the peaks will reduce as we move further from 0 due to the inclusion of zeros in the product terms. However we should clearly be able to determine the unknown period N. Look at example in the text for a good example with different SNR.
5 Input-Output Correlation Sequences x(n) h(n) y(n) For the above system r xx (l) is known as well as the impulse response h(n) and the corresponding output y(n). r yx (l) is given as: y(n) = h(n)*x(n) = x(n)* h(n) r yx (l) = y(l)*x(-l) from conv/corr definition r yx (l) = [h(l)*x(l)]*x(-l) = h(l)*[x(l)*x(-l)] r yx (l) =h(l) * r xx (l) The cross correlation between the input and output is the convolution of the impulse response with the autocorrelation of the input sequence! (Note this approach is used in network and modal analyzers to find transfer functions!!!) Alternatively r xx (l) h(n) we may think of the cross correlation to be the output of a LTI system when the input is the autocorrelation of x(n). Now let use consider the ac of the output: r yy (l) = y(l) * y(-l) r yy (l) = [h(l)*x(l)] * [h(-l)*x(-l)] r yy (l) = [h(l)*h(-l)] * [x(l)*x(-l)] r yy (l) = r hh (l) * r xx (l) ECE-S352 DSP 5 of 6 r yx (l)
6 r hh (l) exists if the system is stable, and this means that the type of signal which the input signal is (power or energy) does not change in the output. Finally r yy (0) = r hh (k)r xx (k) n = - which is the energy or power of the output signal in terms of autocorrelations. ECE-S352 DSP 6 of 6
Digital Signal Processing
Digital Signal Processing Discrete-Time Signals and Systems (2) Moslem Amiri, Václav Přenosil Embedded Systems Laboratory Faculty of Informatics, Masaryk University Brno, Czech Republic amiri@mail.muni.cz
More informationELEN E4810: Digital Signal Processing Topic 2: Time domain
ELEN E4810: Digital Signal Processing Topic 2: Time domain 1. Discrete-time systems 2. Convolution 3. Linear Constant-Coefficient Difference Equations (LCCDEs) 4. Correlation 1 1. Discrete-time systems
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 informationLecture 19 IIR Filters
Lecture 19 IIR Filters Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/5/10 1 General IIR Difference Equation IIR system: infinite-impulse response system The most general class
More informationModule 3. Convolution. Aim
Module Convolution Digital Signal Processing. Slide 4. Aim How to perform convolution in real-time systems efficiently? Is convolution in time domain equivalent to multiplication of the transformed sequence?
More informationProperties of LTI Systems
Properties of LTI Systems Properties of Continuous Time LTI Systems Systems with or without memory: A system is memory less if its output at any time depends only on the value of the input at that same
More informationZ - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.
Z - Transform The z-transform is a very important tool in describing and analyzing digital systems. It offers the techniques for digital filter design and frequency analysis of digital signals. Definition
More informationDigital Signal Processing Lecture 3 - Discrete-Time Systems
Digital Signal Processing - Discrete-Time Systems Electrical Engineering and Computer Science University of Tennessee, Knoxville August 25, 2015 Overview 1 2 3 4 5 6 7 8 Introduction Three components of
More informationDigital Signal Processing Lecture 4
Remote Sensing Laboratory Dept. of Information Engineering and Computer Science University of Trento Via Sommarive, 14, I-38123 Povo, Trento, Italy Digital Signal Processing Lecture 4 Begüm Demir E-mail:
More informationProbability Space. J. McNames Portland State University ECE 538/638 Stochastic Signals Ver
Stochastic Signals Overview Definitions Second order statistics Stationarity and ergodicity Random signal variability Power spectral density Linear systems with stationary inputs Random signal memory Correlation
More informationELC 4351: Digital Signal Processing
ELC 4351: Digital Signal Processing Liang Dong Electrical and Computer Engineering Baylor University liang dong@baylor.edu October 18, 2016 Liang Dong (Baylor University) Frequency-domain Analysis of LTI
More informationDiscrete-Time Signals & Systems
Chapter 2 Discrete-Time Signals & Systems 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 2-1-1 Discrete-Time Signals: Time-Domain Representation (1/10) Signals
More informationChapter 7: The z-transform
Chapter 7: The -Transform ECE352 1 The -Transform - definition Continuous-time systems: e st H(s) y(t) = e st H(s) e st is an eigenfunction of the LTI system h(t), and H(s) is the corresponding eigenvalue.
More informationINTRODUCTION Noise is present in many situations of daily life for ex: Microphones will record noise and speech. Goal: Reconstruct original signal Wie
WIENER FILTERING Presented by N.Srikanth(Y8104060), M.Manikanta PhaniKumar(Y8104031). INDIAN INSTITUTE OF TECHNOLOGY KANPUR Electrical Engineering dept. INTRODUCTION Noise is present in many situations
More informationECE4270 Fundamentals of DSP Lecture 20. Fixed-Point Arithmetic in FIR and IIR Filters (part I) Overview of Lecture. Overflow. FIR Digital Filter
ECE4270 Fundamentals of DSP Lecture 20 Fixed-Point Arithmetic in FIR and IIR Filters (part I) School of ECE Center for Signal and Information Processing Georgia Institute of Technology Overview of Lecture
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 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 informationENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin
ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM Dr. Lim Chee Chin Outline Introduction Discrete Fourier Series Properties of Discrete Fourier Series Time domain aliasing due to frequency
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 informationEE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley
EE123 Digital Signal Processing Today Last time: DTFT - Ch 2 Today: Continue DTFT Z-Transform Ch. 3 Properties of the DTFT cont. Time-Freq Shifting/modulation: M. Lustig, EE123 UCB M. Lustig, EE123 UCB
More informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture 1: Course Overview; Discrete-Time Signals & Systems Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 2008 K. E.
More informationDIGITAL SIGNAL PROCESSING UNIT 1 SIGNALS AND SYSTEMS 1. What is a continuous and discrete time signal? Continuous time signal: A signal x(t) is said to be continuous if it is defined for all time t. Continuous
More informationDiscrete-time signals and systems
Discrete-time signals and systems 1 DISCRETE-TIME DYNAMICAL SYSTEMS x(t) G y(t) Linear system: Output y(n) is a linear function of the inputs sequence: y(n) = k= h(k)x(n k) h(k): impulse response of the
More informationAnalog vs. discrete signals
Analog vs. discrete signals Continuous-time signals are also known as analog signals because their amplitude is analogous (i.e., proportional) to the physical quantity they represent. Discrete-time signals
More informationEEM 409. Random Signals. Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Problem 2:
EEM 409 Random Signals Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Consider a random process of the form = + Problem 2: X(t) = b cos(2π t + ), where b is a constant,
More informationUniversiti Malaysia Perlis EKT430: DIGITAL SIGNAL PROCESSING LAB ASSIGNMENT 3: DISCRETE TIME SYSTEM IN TIME DOMAIN
Universiti Malaysia Perlis EKT430: DIGITAL SIGNAL PROCESSING LAB ASSIGNMENT 3: DISCRETE TIME SYSTEM IN TIME DOMAIN Pusat Pengajian Kejuruteraan Komputer Dan Perhubungan Universiti Malaysia Perlis Discrete-Time
More informationFlash File. Module 3 : Sampling and Reconstruction Lecture 28 : Discrete time Fourier transform and its Properties. Objectives: Scope of this Lecture:
Module 3 : Sampling and Reconstruction Lecture 28 : Discrete time Fourier transform and its Properties Objectives: Scope of this Lecture: In the previous lecture we defined digital signal processing and
More information7.17. Determine the z-transform and ROC for the following time signals: Sketch the ROC, poles, and zeros in the z-plane. X(z) = x[n]z n.
Solutions to Additional Problems 7.7. Determine the -transform and ROC for the following time signals: Sketch the ROC, poles, and eros in the -plane. (a) x[n] δ[n k], k > 0 X() x[n] n n k, 0 Im k multiple
More informationLecture 18: Stability
Lecture 18: Stability ECE 401: Signal and Image Analysis University of Illinois 4/18/2017 1 Stability 2 Impulse Response 3 Z Transform Outline 1 Stability 2 Impulse Response 3 Z Transform BIBO Stability
More informationUNIT-II Z-TRANSFORM. This expression is also called a one sided z-transform. This non causal sequence produces positive powers of z in X (z).
Page no: 1 UNIT-II Z-TRANSFORM The Z-Transform The direct -transform, properties of the -transform, rational -transforms, inversion of the transform, analysis of linear time-invariant systems in the -
More informationDIGITAL SIGNAL PROCESSING LECTURE 1
DIGITAL SIGNAL PROCESSING LECTURE 1 Fall 2010 2K8-5 th Semester Tahir Muhammad tmuhammad_07@yahoo.com Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, 1999-2000
More informationDigital Signal Processing I Final Exam Fall 2008 ECE Dec Cover Sheet
Digital Signal Processing I Final Exam Fall 8 ECE538 7 Dec.. 8 Cover Sheet Test Duration: minutes. Open Book but Closed Notes. Calculators NOT allowed. This test contains FIVE problems. All work should
More informationMAHALAKSHMI ENGINEERING COLLEGE-TRICHY
DIGITAL SIGNAL PROCESSING DEPT./SEM.: ECE&EEE /V DISCRETE FOURIER TRANFORM AND FFT PART-A 1. Define DFT of a discrete time sequence? AUC MAY 06 The DFT is used to convert a finite discrete time sequence
More informationProjection Theorem 1
Projection Theorem 1 Cauchy-Schwarz Inequality Lemma. (Cauchy-Schwarz Inequality) For all x, y in an inner product space, [ xy, ] x y. Equality holds if and only if x y or y θ. Proof. If y θ, the inequality
More informationChapter 3 Convolution Representation
Chapter 3 Convolution Representation DT Unit-Impulse Response Consider the DT SISO system: xn [ ] System yn [ ] xn [ ] = δ[ n] If the input signal is and the system has no energy at n = 0, the output yn
More informationCOURSE OUTLINE. Introduction Signals and Noise Filtering Noise Sensors and associated electronics. Sensors, Signals and Noise 1
Sensors, Signals and Noise 1 COURSE OUTLINE Introduction Signals and Noise Filtering Noise Sensors and associated electronics Processing Noise with Linear Filters 2 Mathematical Foundations Filtering Stationary
More informationDigital Signal Processing Lecture 5
Remote Sensing Laboratory Dept. of Information Engineering and Computer Science University of Trento Via Sommarive, 14, I-38123 Povo, Trento, Italy Digital Signal Processing Lecture 5 Begüm Demir E-mail:
More informationEE538 Final Exam Fall 2007 Mon, Dec 10, 8-10 am RHPH 127 Dec. 10, Cover Sheet
EE538 Final Exam Fall 2007 Mon, Dec 10, 8-10 am RHPH 127 Dec. 10, 2007 Cover Sheet Test Duration: 120 minutes. Open Book but Closed Notes. Calculators allowed!! This test contains five problems. Each of
More informationDSP Laboratory (EELE 4110) Lab#3 Discrete Time Signals
Islamic University of Gaza Faculty of Engineering Electrical Engineering Department Spring- ENG.MOHAMMED ELASMER DSP Laboratory (EELE 4) Lab#3 Discrete Time Signals DISCRETE-TIME SIGNALS Signals are broadly
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 informationDigital Filter Structures. Basic IIR Digital Filter Structures. of an LTI digital filter is given by the convolution sum or, by the linear constant
Digital Filter Chapter 8 Digital Filter Block Diagram Representation Equivalent Basic FIR Digital Filter Basic IIR Digital Filter. Block Diagram Representation In the time domain, the input-output relations
More informationProperties of the Autocorrelation Function
Properties of the Autocorrelation Function I The autocorrelation function of a (real-valued) random process satisfies the following properties: 1. R X (t, t) 0 2. R X (t, u) =R X (u, t) (symmetry) 3. R
More informationLECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)
LECTURE NOTES ON DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13) FACULTY : B.V.S.RENUKA DEVI (Asst.Prof) / Dr. K. SRINIVASA RAO (Assoc. Prof) DEPARTMENT OF ELECTRONICS AND COMMUNICATIONS
More informationEE123 Digital Signal Processing
EE123 Digital Signal Processing Lecture 2B D. T. Fourier Transform M. Lustig, EECS UC Berkeley Something Fun gotenna http://www.gotenna.com/# Text messaging radio Bluetooth phone interface MURS VHF radio
More informationDSP-I DSP-I DSP-I DSP-I
DSP-I DSP-I DSP-I DSP-I Digital Signal Processing I (8-79) Fall Semester, 005 OTES FOR 8-79 LECTURE 9: PROPERTIES AD EXAPLES OF Z-TRASFORS Distributed: September 7, 005 otes: This handout contains in outline
More informationUNIT 1. SIGNALS AND SYSTEM
Page no: 1 UNIT 1. SIGNALS AND SYSTEM INTRODUCTION A SIGNAL is defined as any physical quantity that changes with time, distance, speed, position, pressure, temperature or some other quantity. A SIGNAL
More information6.02 Fall 2012 Lecture #10
6.02 Fall 2012 Lecture #10 Linear time-invariant (LTI) models Convolution 6.02 Fall 2012 Lecture 10, Slide #1 Modeling Channel Behavior codeword bits in generate x[n] 1001110101 digitized modulate DAC
More informationECE 438 Exam 2 Solutions, 11/08/2006.
NAME: ECE 438 Exam Solutions, /08/006. This is a closed-book exam, but you are allowed one standard (8.5-by-) sheet of notes. No calculators are allowed. Total number of points: 50. This exam counts for
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 informationDETECTION theory deals primarily with techniques for
ADVANCED SIGNAL PROCESSING SE Optimum Detection of Deterministic and Random Signals Stefan Tertinek Graz University of Technology turtle@sbox.tugraz.at Abstract This paper introduces various methods for
More informationLAB # 3 HANDOUT. y(n)=t[x(n)] Discrete systems have different classifications based on the input and output relation:
LAB # HANDOUT. DISCRETE SYSTEMS Mathematically, a discrete-time system (or discrete system for short ) is described as an operator T[.] that takes a sequence x(n) and transforms it into another sequence
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 informationEEL3135: Homework #4
EEL335: Homework #4 Problem : For each of the systems below, determine whether or not the system is () linear, () time-invariant, and (3) causal: (a) (b) (c) xn [ ] cos( 04πn) (d) xn [ ] xn [ ] xn [ 5]
More informationLecture 11 FIR Filters
Lecture 11 FIR Filters Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/4/12 1 The Unit Impulse Sequence Any sequence can be represented in this way. The equation is true if k ranges
More informationQuadratic Equations 6 QUESTIONS. Relatively Easy: Questions 1 to 2 Moderately Difficult: Questions 3 to 4 Difficult: Questions 5 to 6
Quadratic Equations 6 QUESTIONS Relatively Easy: Questions 1 to 2 Moderately Difficult: Questions 3 to 4 Difficult: Questions 5 to 6 Questions www.tutornext.com Page 2 of 11 Q1. The factors of 2x² - 7x
More informationUCSD ECE153 Handout #40 Prof. Young-Han Kim Thursday, May 29, Homework Set #8 Due: Thursday, June 5, 2011
UCSD ECE53 Handout #40 Prof. Young-Han Kim Thursday, May 9, 04 Homework Set #8 Due: Thursday, June 5, 0. Discrete-time Wiener process. Let Z n, n 0 be a discrete time white Gaussian noise (WGN) process,
More informationMMSE System Identification, Gradient Descent, and the Least Mean Squares Algorithm
MMSE System Identification, Gradient Descent, and the Least Mean Squares Algorithm D.R. Brown III WPI WPI D.R. Brown III 1 / 19 Problem Statement and Assumptions known input x[n] unknown system (assumed
More informationELEG 305: Digital Signal Processing
ELEG 5: Digital Signal Processing Lecture 6: The Fast Fourier Transform; Radix Decimatation in Time Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 8 K.
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 informationEE482: Digital Signal Processing Applications
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:30-15:45 CBC C222 Lecture 11 Adaptive Filtering 14/03/04 http://www.ee.unlv.edu/~b1morris/ee482/
More informationIII.B Linear Transformations: Matched filter
III.B Linear Transformations: Matched filter [p. ] Definition [p. 3] Deterministic signal case [p. 5] White noise [p. 19] Colored noise [p. 4] Random signal case [p. 4] White noise [p. 4] Colored noise
More informationSolution 10 July 2015 ECE301 Signals and Systems: Midterm. Cover Sheet
Solution 10 July 2015 ECE301 Signals and Systems: Midterm Cover Sheet Test Duration: 60 minutes Coverage: Chap. 1,2,3,4 One 8.5" x 11" crib sheet is allowed. Calculators, textbooks, notes are not allowed.
More informationDiscrete-Time Systems
FIR Filters With this chapter we turn to systems as opposed to signals. The systems discussed in this chapter are finite impulse response (FIR) digital filters. The term digital filter arises because these
More informationParametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes (cont d)
Parametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes (cont d) Electrical & Computer Engineering North Carolina State University Acknowledgment: ECE792-41 slides
More informationParametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes
Parametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes Electrical & Computer Engineering North Carolina State University Acknowledgment: ECE792-41 slides were adapted
More informationStability Condition in Terms of the Pole Locations
Stability Condition in Terms of the Pole Locations A causal LTI digital filter is BIBO stable if and only if its impulse response h[n] is absolutely summable, i.e., 1 = S h [ n] < n= We now develop a stability
More informationHow to manipulate Frequencies in Discrete-time Domain? Two Main Approaches
How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches Difference Equations (an LTI system) x[n]: input, y[n]: output That is, building a system that maes use of the current and previous
More informationFinal Exam ECE301 Signals and Systems Friday, May 3, Cover Sheet
Name: Final Exam ECE3 Signals and Systems Friday, May 3, 3 Cover Sheet Write your name on this page and every page to be safe. Test Duration: minutes. Coverage: Comprehensive Open Book but Closed Notes.
More informationECE 308 Discrete-Time Signals and Systems
ECE 38-6 ECE 38 Discrete-Time Signals and Systems Z. Aliyazicioglu Electrical and Computer Engineering Department Cal Poly Pomona ECE 38-6 1 Intoduction Two basic methods for analyzing the response of
More informationECE 636: Systems identification
ECE 636: Systems identification Lectures 3 4 Random variables/signals (continued) Random/stochastic vectors Random signals and linear systems Random signals in the frequency domain υ ε x S z + y Experimental
More informationZ-Transform. The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = g(t)e st dt. Z : G(z) =
Z-Transform The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = Z : G(z) = It is Used in Digital Signal Processing n= g(t)e st dt g[n]z n Used to Define Frequency
More informationEE123 Digital Signal Processing
EE123 Digital Signal Processing Lecture 2A D.T Systems D. T. Fourier Transform A couple of things Read Ch 2 2.0-2.9 It s OK to use 2nd edition My office hours: posted on-line W 4-5pm Cory 506 ham radio
More informationy[n] = = h[k]x[n k] h[k]z n k k= 0 h[k]z k ) = H(z)z n h[k]z h (7.1)
7. The Z-transform 7. Definition of the Z-transform We saw earlier that complex exponential of the from {e jwn } is an eigen function of for a LTI System. We can generalize this for signals of the form
More informationA DARK GREY P O N T, with a Switch Tail, and a small Star on the Forehead. Any
Y Y Y X X «/ YY Y Y ««Y x ) & \ & & } # Y \#$& / Y Y X» \\ / X X X x & Y Y X «q «z \x» = q Y # % \ & [ & Z \ & { + % ) / / «q zy» / & / / / & x x X / % % ) Y x X Y $ Z % Y Y x x } / % «] «] # z» & Y X»
More informationTwo Posts to Fill On School Board
Y Y 9 86 4 4 qz 86 x : ( ) z 7 854 Y x 4 z z x x 4 87 88 Y 5 x q x 8 Y 8 x x : 6 ; : 5 x ; 4 ( z ; ( ) ) x ; z 94 ; x 3 3 3 5 94 ; ; ; ; 3 x : 5 89 q ; ; x ; x ; ; x : ; ; ; ; ; ; 87 47% : () : / : 83
More informationz-transforms Definition of the z-transform Chapter
z-transforms Chapter 7 In the study of discrete-time signal and systems, we have thus far considered the time-domain and the frequency domain. The z- domain gives us a third representation. All three domains
More informationLecture Schedule: Week Date Lecture Title
http://elec34.org Sampling and CONVOLUTION 24 School of Information Technology and Electrical Engineering at The University of Queensland Lecture Schedule: Week Date Lecture Title 2-Mar Introduction 3-Mar
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 informationThe z-transform Part 2
http://faculty.kfupm.edu.sa/ee/muqaibel/ The z-transform Part 2 Dr. Ali Hussein Muqaibel The material to be covered in this lecture is as follows: Properties of the z-transform Linearity Initial and final
More informationEE123 Digital Signal Processing
EE123 Digital Signal Processing Discrete Time Fourier Transform M. Lustig, EECS UC Berkeley A couple of things Read Ch 2 2.0-2.9 It s OK to use 2nd edition Class webcast in bcourses.berkeley.edu or linked
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 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 informationSRI VIDYA COLLEGE OF ENGINEERING AND TECHNOLOGY UNIT 3 RANDOM PROCESS TWO MARK QUESTIONS
UNIT 3 RANDOM PROCESS TWO MARK QUESTIONS 1. Define random process? The sample space composed of functions of time is called a random process. 2. Define Stationary process? If a random process is divided
More informationNumbers. 2.1 Integers. P(n) = n(n 4 5n 2 + 4) = n(n 2 1)(n 2 4) = (n 2)(n 1)n(n + 1)(n + 2); 120 =
2 Numbers 2.1 Integers You remember the definition of a prime number. On p. 7, we defined a prime number and formulated the Fundamental Theorem of Arithmetic. Numerous beautiful results can be presented
More informationChapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27
Chapter 11 Taylor Series Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27 First-Order Approximation We want to approximate function f by some simple function. Best possible approximation
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 informationShift Property of z-transform. Lecture 16. More z-transform (Lathi 5.2, ) More Properties of z-transform. Convolution property of z-transform
Shift Property of -Transform If Lecture 6 More -Transform (Lathi 5.2,5.4-5.5) then which is delay causal signal by sample period. If we delay x[n] first: Peter Cheung Department of Electrical & Electronic
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 6: January 30, 2018 Inverse z-transform Lecture Outline! z-transform " Tie up loose ends " Regions of convergence properties! Inverse z-transform " Inspection " Partial
More informationSOLUTIONS FOR PROBLEMS 1-30
. Answer: 5 Evaluate x x + 9 for x SOLUTIONS FOR PROBLEMS - 0 When substituting x in x be sure to do the exponent before the multiplication by to get (). + 9 5 + When multiplying ( ) so that ( 7) ( ).
More informationECE503: Digital Signal Processing Lecture 6
ECE503: Digital Signal Processing Lecture 6 D. Richard Brown III WPI 20-February-2012 WPI D. Richard Brown III 20-February-2012 1 / 28 Lecture 6 Topics 1. Filter structures overview 2. FIR filter structures
More informationUCSD ECE 153 Handout #46 Prof. Young-Han Kim Thursday, June 5, Solutions to Homework Set #8 (Prepared by TA Fatemeh Arbabjolfaei)
UCSD ECE 53 Handout #46 Prof. Young-Han Kim Thursday, June 5, 04 Solutions to Homework Set #8 (Prepared by TA Fatemeh Arbabjolfaei). Discrete-time Wiener process. Let Z n, n 0 be a discrete time white
More informationThe Z-Transform. Fall 2012, EE123 Digital Signal Processing. Eigen Functions of LTI System. Eigen Functions of LTI System
The Z-Transform Fall 202, EE2 Digital Signal Processing Lecture 4 September 4, 202 Used for: Analysis of LTI systems Solving di erence equations Determining system stability Finding frequency response
More informationIntroduction to Statistical Inference
Structural Health Monitoring Using Statistical Pattern Recognition Introduction to Statistical Inference Presented by Charles R. Farrar, Ph.D., P.E. Outline Introduce statistical decision making for Structural
More informationIntroduction to DSP Time Domain Representation of Signals and Systems
Introduction to DSP Time Domain Representation of Signals and Systems Dr. Waleed Al-Hanafy waleed alhanafy@yahoo.com Faculty of Electronic Engineering, Menoufia Univ., Egypt Digital Signal Processing (ECE407)
More informationExamples. 2-input, 1-output discrete-time systems: 1-input, 1-output discrete-time systems:
Discrete-Time s - I Time-Domain Representation CHAPTER 4 These lecture slides are based on "Digital Signal Processing: A Computer-Based Approach, 4th ed." textbook by S.K. Mitra and its instructor materials.
More informationLecture 7 - IIR Filters
Lecture 7 - IIR Filters James Barnes (James.Barnes@colostate.edu) Spring 204 Colorado State University Dept of Electrical and Computer Engineering ECE423 / 2 Outline. IIR Filter Representations Difference
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 informationSeries Solutions. 8.1 Taylor Polynomials
8 Series Solutions 8.1 Taylor Polynomials Polynomial functions, as we have seen, are well behaved. They are continuous everywhere, and have continuous derivatives of all orders everywhere. It also turns
More informationLecture 19: Bayesian Linear Estimators
ECE 830 Fall 2010 Statistical Signal Processing instructor: R Nowa, scribe: I Rosado-Mendez Lecture 19: Bayesian Linear Estimators 1 Linear Minimum Mean-Square Estimator Suppose our data is set X R n,
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 information