ADSP ADSP ADSP ADSP. Advanced Digital Signal Processing (18-792) Spring Fall Semester, Department of Electrical and Computer Engineering
|
|
- Hilary Atkins
- 5 years ago
- Views:
Transcription
1 Advanced Digital Signal rocessing (18-792) Spring Fall Semester, Department of Electrical and Computer Engineering ROBLEM SET 8 Issued: 10/26/18 Due: 11/2/18 Note: This problem set is due Friday, in part because of the holiday weekend, the lack of recitations for the past two weeks, and the fact that we are a little behind the syllabus (thanks in part to my multiple absences). I encourage you to work on roblem 8.1 and C8.1 over the weekend. You may want to wait until the Monday lecture for the remaining problems, during which time I will introduce the topic of linear prediction, including solutions using Levinson-Durbin recursion. You can get a heads up on these topics by reviewing the class notes online on linear prediction. Reading: This problem set is centered on parametric spectral estimation techniques, as we begin to look at maximum entropy spectral estimation and linear prediction. As you know, our discussion of power spectral analysis has been drawn from several sources. Our discussion of classical nonparametric spectral estimation techniques based on the periodogram, periodogram smoothing, periodogram windowing, and periodogram averaging is based on the material in Secs and 11.4 in OS1 and Secs and 10.6 in OSY. Although this material was not discussed in class, I also recommend looking over Secs and 11.6 in OS1. We also highly recommend Kay and Marple s very comprehensive tutorial papers that compares many spectral estimation techniques: Kay, S. M., and Marple, L. M. (1981), Spectrum analysis a modern perspective, roceedings of the IEEE, vol. 69, no. 11, pp This review also spawned two good books published by rentice-hall of very different styles: the more accessible and tutorial book Digital Spectral Analysts with Applications by Marple in 1987, and the more thorough and scholarly Modern Spectral Estimation: Theory and Application by Kay in Much of this material is also covered in Kay s chapter in Lim and Oppenheim (LO), and LO Sec. 2.4 is especially relevant to our in-class discussions. (Reprints of the LO chapter are also available online.) We have also introduced the philosophy of maximum entropy spectral estimation following the discussion in the review/tutorial article Robinson, E.A. (1982), A historical perspective of spectrum estimation, roceedings of the IEEE, vol.70, no.9, pp Class notes from the MEM lecture are also available online. The material on MEM spectral estimation leads into our discussion of linear prediction that will be largely covered by class notes, along with Chapter 8 of Rabiner and Schafer (1978), both of which are available on the Web.
2 roblem Set 8-2- Fall, 2018 roblem 8.1: A bandlimited continuous-time signal has a bandlimited power spectrum that is zero for rad/s. The signal is sampled at a rate of 16,000 samples/s over a time interval of 30 s. The power spectrum of the signal is estimated by the Bartlett method of averaging periodograms. (a) What is the length Q (number of samples) of the data record? (b) If a radix-2 FFT program is used to compute the periodograms, what is the minimum length N if we wish to obtain estimates of the power spectrum at equally spaced frequencies no more than 10 Hz apart? (c) If the segment length L is equal to the FFT length N in part (b), how many segments K are available if the segments do not overlap? (d) Suppose we wish to reduce the variance of the spectral estimates by a factor of 10 while maintaining the frequency spacing of part (b). Give two methods of doing this, one using the Bartlett method and the other using windowing of the original random process. Do these two methods give the same results? If not, explain how they differ. roblem 8.2: An all-zero filter has a transfer function of Xz = = z 1 Wz A white noise WSS random process wn with variance equal to 1 is input to the filter. (a) Using random process properties and your knowledge of the filter s response, obtain the values of xx m, the autocorrelation function of xn, the system s output for lags m 3. (b) Using the Levinson-Durbin recursion technique, and the autocorrelation function for xn that you calculated in part (a), obtain the and the k coefficients for the first-, second-, and third-order LC model of the filter. lease obtain this result by hand (using a calculator or its computer equivalent), rather than using routines in MATLAB. For each order of the model, sketch the locations of the poles of the z-transform of the system. Using MATLAB, sketch the magnitude of the DTFT in decibels (db) for each of the three models. roblem 8.3: (a former quiz problem) In class we developed the basic LC equations that minimized the forward mean square error Ee pn E xn k xn k = =
3 roblem Set 8-3- Fall, 2018 and we will introduce the concept of backward error in our discussion of lattice filters. It is also possible to consider a non-causal operation that predicts the current sample of past and future samples in a two-sided fashion: xˆ n = k xn k + xn + k The corresponding mean-square error for such a system would be xn from both 2 2 Exn xˆ n 2 2 E xn k xn k + xn + k = = (a) Obtain a set of matrix-vector equations that will specify the set of coefficients k when solved. Your equations should be similar to (but not identical to) the standard LC equations that are solved, for example, by Levinson-Durbin recursion. The matrices and vectors in the equations should be expressed in terms of the coefficients k and m xx m = Exnxn + m, the auto-correlation function of xn. You may assume that xn is a real wide-sense stationary random process. (b) Can your answer to part (a) be solved using Levinson-Durbin recursion? Why or why not? (c) Can your answer to part (a) be solved using Cholesky decomposition? Why or why not? roblem 8.4: The impulse response of a causal all-pole model of the form G = k z k with system parameters G and k hn = k hn k + Gn satisfies the difference equation (a) The autocorrelation function of the impulse response of the system is hh m = hn hn + m n =
4 roblem Set 8-4- Fall, 2018 By substituting the equation above for hn into the equation for hh m, and using the fact that hh m = hh m show that k hh m k = hh m, m = 123 (b) Using the same approach as in (a), now show that hh 0 k hh k = G 2 MATLAB roblems Note: In working the problems, turn in a printout of your results, a copy of the MATLAB code you developed to work the problem, as well as any additional comments you'd like to add. WARNING!! The texts by Oppenheim and Schafer, and the book by Rabiner and Schafer have all consistently used the filter notation convention = M b k z k k = N 1 a k z k We have used this notation in class with some variants (such as using the coefficients k instead of a k ). Unfortunately, MATLAB uses the convention used in a classic review article on linear prediction and lattice filtering by John Makhoul some years ago: = M b k z k k = N 1 + a k z k This means that the coefficients of the denominator polynomial a k and the reflection coefficients k i produced by MATLAB are opposite in sign to what we have seen in Rabiner and Schafer and used in class discussions. In turning in your homework beginning with roblem C8.1 you must use the OSB/RS/ conventions! lease save yourself and us a lot of aggravation by being careful about this annoying inconsistency! (Thanks!)
5 roblem Set 8-5- Fall, 2018 Note: You may wish to create helper functions so you don t have to repeat writing the same code. roblem C8.1: In roblem C7.1 last week you examined traditional estimates of the power spectral density of the random process described above. In this problem we will explore the effects of various means to reduce the variance, as described in OS , which is available on the Web. You will be provided with a main file called main_8_1.m that you must complete. Consider again estimates of SD drawn from 500, 1000, and 4000 samples of noise from noisgen. You can either use the same samples as in roblem C7.1 or you can create new ones. (a) In this part of the problem we look into the effects of periodogram averaging using the Bartlett method. For each of the three lengths of data, subdivide the data into abutting subsegments of length N 4, and N 50, where N is the number of data points. As described in OS1 Sec , form periodograms for each of the segments using rectangular windows, and obtain power spectral density estimates by averaging the periodograms obtained from the subsegments. Repeat the whole process four times, as in roblem C7.1, so we can obtain estimates of the global mean and variance of the estimated SDs. In each case, 1. lot the first of the four resulting SD functions from the averaged periodograms. 2. Calculate the expected value of the SD estimate for = 0.25 and 0.75 by averaging the values of the four samples at those frequencies. Also calculate the corresponding bias of the estimates. 3. Calculate the variance of the SD estimate for = 0.25 and (b) Now repeat part (a), but instead of obtaining abutting subsegments of the original data, obtain a series of subsegments with 50-percent overlap as in certain aspects of the Welch method.. (For example, if the lengths of the subsegments were 10 samples, the first one would be samples 0-9, the second would be 5-14, the third would be 10-19, etc.) This will approximately double the total number of periodograms to be averaged for each SD estimate. What are the advantages and disadvantages that you observe with abutting the segments in the fashion described? (c) Now repeat part (a) for SDs drawn from 500 and 4000 samples of noise only, but using a Hamming window instead of the rectangular window that is implied by doing no windowing in particular. What are the advantages and disadvantages that you observe with the windowing? This is an example of the, well, the windowing method. (d) As in roblem C7.1, comment on the general success or failure that this approach has in describing the periodic components of the input data. roblem C8.2: You will be provided with a main file called main_8_2.m that you must complete for this problem. Consider again the all-zero filter you examined in roblem 8.2, = 1 0.9z 1 Using the MATLAB routines lpc or levinson, along with freqz, sketch the magnitude of the DTFT
6 roblem Set 8-6- Fall, 2018 of the best-fit all-pole approximation to with 5 poles, 10 poles, 15 poles, and 20 poles. How many poles do you think are needed for an adequate all-pole approximation to the original transfer function with a single zero? roblem C8.3: *log10(SD) Figure C8.3. True power spectral density function of noise process to be used in roblem C8.3. / You will be provided with a main file called main_8_3.m that you must complete. In this and the following problem we will be modeling the colored noise samples examined last week using maximum entropy techniques. The true power spectral density function for this noise is given in the figure above. Note that it contains aperiodic noise components (which are represented by the smooth curve in the SD function) and periodic components (which are represented by the three spikes in the SD function). (a) We will begin by considering various ways of estimating the power spectral density function of a random process that is very similar but that does not include the periodic components of the process shown in Figure C8.3 above. Use the MATLAB function noisegen2.m to generate a sample function of this process that is 1000 samples long. The function noisegen2.m, as well as the original function noisegen.m, is available on the course Website. 1. lot the periodogram of this process using any method you choose. 2. lot the estimate of the power spectral density function obtained for this process using the Bartlett method, averaging 4 abutting subsections of the data. (b) Now use the full 1000 samples of the process to compute the first several coefficients of the auto-correlation function of the process. (Because the number of lags is small compared to the length of the data it should not matter much whether you use the biased or unbiased estimate of the auto-correlation function.) Using MATLAB, obtain the coefficients of the best-fit all-pole model for the random process. (You can use
7 roblem Set 8-7- Fall, 2018 a routine you write yourself to implement the Levinson-Durbin recursion or the built-in MATLAB function levinson. If you use levinson, be sure to read the help file and be mindful of the sign convention noted above.) 1. lot the estimate of the power spectral density function using three values of the model order parameter of your choosing that illustrate how the value of affects the quality of the estimate. 2. What value of the model order parameter would you select as reasonable to model this process? Explain how you made this choice. 3. Compare the nature of these estimates with the estimates of the power spectrum that you obtained in part (a). (c), (d) Repeat parts (a) and (b) but using the samples of noise generated by the MATLAB function noisegen.m, which includes the periodic components whose effects are indicated by the spikes in Fig. C8.3 above. (e) Compare the effectiveness of the all-pole model for characterizing the power spectral density function of the random process produced by noisegen.m (with the periodic components) with the characterization of the power spectral density function of the random process produced by noisegen2.m (which is identical but without the periodic components.) What to turn in on Gradescope: Completed versions of the routines main_8_1.m, main_8_2.m, and main_8_3.m. Answers to the questions and all the plots.
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science : Discrete-Time Signal Processing
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.34: Discrete-Time Signal Processing OpenCourseWare 006 ecture 8 Periodogram Reading: Sections 0.6 and 0.7
More informationPractical Spectral Estimation
Digital Signal Processing/F.G. Meyer Lecture 4 Copyright 2015 François G. Meyer. All Rights Reserved. Practical Spectral Estimation 1 Introduction The goal of spectral estimation is to estimate how the
More informationPROBLEM SET 3. Note: This problem set is a little shorter than usual because we have not covered inverse z-transforms yet.
PROBLEM SET 3 Issued: /3/9 Due: 2/6/9 Reading: During the past week we concluded our discussion DTFT properties and began our discussion of z-transforms, covering basic calculation of the z-transform and
More informationLab 4: Quantization, Oversampling, and Noise Shaping
Lab 4: Quantization, Oversampling, and Noise Shaping Due Friday 04/21/17 Overview: This assignment should be completed with your assigned lab partner(s). Each group must turn in a report composed using
More informationDepartment of Electrical and Computer Engineering Digital Speech Processing Homework No. 7 Solutions
Problem 1 Department of Electrical and Computer Engineering Digital Speech Processing Homework No. 7 Solutions Linear prediction analysis is used to obtain an eleventh-order all-pole model for a segment
More informationDFT & Fast Fourier Transform PART-A. 7. Calculate the number of multiplications needed in the calculation of DFT and FFT with 64 point sequence.
SHRI ANGALAMMAN COLLEGE OF ENGINEERING & TECHNOLOGY (An ISO 9001:2008 Certified Institution) SIRUGANOOR,TRICHY-621105. DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING UNIT I DFT & Fast Fourier
More informationLaboratory Project 2: Spectral Analysis and Optimal Filtering
Laboratory Project 2: Spectral Analysis and Optimal Filtering Random signals analysis (MVE136) Mats Viberg and Lennart Svensson Department of Signals and Systems Chalmers University of Technology 412 96
More informationContents. Digital Signal Processing, Part II: Power Spectrum Estimation
Contents Digital Signal Processing, Part II: Power Spectrum Estimation 5. Application of the FFT for 7. Parametric Spectrum Est. Filtering and Spectrum Estimation 7.1 ARMA-Models 5.1 Fast Convolution 7.2
More informationStatistical and Adaptive Signal Processing
r Statistical and Adaptive Signal Processing Spectral Estimation, Signal Modeling, Adaptive Filtering and Array Processing Dimitris G. Manolakis Massachusetts Institute of Technology Lincoln Laboratory
More informationParametric Method Based PSD Estimation using Gaussian Window
International Journal of Engineering Trends and Technology (IJETT) Volume 29 Number 1 - November 215 Parametric Method Based PSD Estimation using Gaussian Window Pragati Sheel 1, Dr. Rajesh Mehra 2, Preeti
More informationDISCRETE-TIME SIGNAL PROCESSING
THIRD EDITION DISCRETE-TIME SIGNAL PROCESSING ALAN V. OPPENHEIM MASSACHUSETTS INSTITUTE OF TECHNOLOGY RONALD W. SCHÄFER HEWLETT-PACKARD LABORATORIES Upper Saddle River Boston Columbus San Francisco New
More informationCONTENTS NOTATIONAL CONVENTIONS GLOSSARY OF KEY SYMBOLS 1 INTRODUCTION 1
DIGITAL SPECTRAL ANALYSIS WITH APPLICATIONS S.LAWRENCE MARPLE, JR. SUMMARY This new book provides a broad perspective of spectral estimation techniques and their implementation. It concerned with spectral
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 informationCCNY. BME I5100: Biomedical Signal Processing. Stochastic Processes. Lucas C. Parra Biomedical Engineering Department City College of New York
BME I5100: Biomedical Signal Processing Stochastic Processes Lucas C. Parra Biomedical Engineering Department CCNY 1 Schedule Week 1: Introduction Linear, stationary, normal - the stuff biology is not
More informationII. Nonparametric Spectrum Estimation for Stationary Random Signals - Non-parametric Methods -
II. onparametric Spectrum Estimation for Stationary Random Signals - on-parametric Methods - - [p. 3] Periodogram - [p. 12] Periodogram properties - [p. 23] Modified periodogram - [p. 25] Bartlett s method
More informationCentre for Mathematical Sciences HT 2017 Mathematical Statistics
Lund University Stationary stochastic processes Centre for Mathematical Sciences HT 2017 Mathematical Statistics Computer exercise 3 in Stationary stochastic processes, HT 17. The purpose of this exercise
More informationLesson 1. Optimal signalbehandling LTH. September Statistical Digital Signal Processing and Modeling, Hayes, M:
Lesson 1 Optimal Signal Processing Optimal signalbehandling LTH September 2013 Statistical Digital Signal Processing and Modeling, Hayes, M: John Wiley & Sons, 1996. ISBN 0471594318 Nedelko Grbic Mtrl
More informationCHAPTER 2 RANDOM PROCESSES IN DISCRETE TIME
CHAPTER 2 RANDOM PROCESSES IN DISCRETE TIME Shri Mata Vaishno Devi University, (SMVDU), 2013 Page 13 CHAPTER 2 RANDOM PROCESSES IN DISCRETE TIME When characterizing or modeling a random variable, estimates
More informationSPECTRUM. Deterministic Signals with Finite Energy (l 2 ) Deterministic Signals with Infinite Energy N 1. n=0. N N X N(f) 2
SPECTRUM Deterministic Signals with Finite Energy (l 2 ) Energy Spectrum: S xx (f) = X(f) 2 = 2 x(n)e j2πfn n= Deterministic Signals with Infinite Energy DTFT of truncated signal: X N (f) = N x(n)e j2πfn
More informationAdvanced Digital Signal Processing -Introduction
Advanced Digital Signal Processing -Introduction LECTURE-2 1 AP9211- ADVANCED DIGITAL SIGNAL PROCESSING UNIT I DISCRETE RANDOM SIGNAL PROCESSING Discrete Random Processes- Ensemble Averages, Stationary
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 informationVALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF INFORMATION TECHNOLOGY. Academic Year
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur- 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY Academic Year 2016-2017 QUESTION BANK-ODD SEMESTER NAME OF THE SUBJECT SUBJECT CODE SEMESTER YEAR
More informationNonparametric and Parametric Defined This text distinguishes between systems and the sequences (processes) that result when a WN input is applied
Linear Signal Models Overview Introduction Linear nonparametric vs. parametric models Equivalent representations Spectral flatness measure PZ vs. ARMA models Wold decomposition Introduction Many researchers
More informationComplement on Digital Spectral Analysis and Optimal Filtering: Theory and Exercises
Complement on Digital Spectral Analysis and Optimal Filtering: Theory and Exercises Random Signals Analysis (MVE136) Mats Viberg Department of Signals and Systems Chalmers University of Technology 412
More informationDepartment of Electrical and Telecommunications Engineering Technology TEL (718) FAX: (718) Courses Description:
NEW YORK CITY COLLEGE OF TECHNOLOGY The City University of New York 300 Jay Street Brooklyn, NY 11201-2983 Department of Electrical and Telecommunications Engineering Technology TEL (718) 260-5300 - FAX:
More informationChirp Transform for FFT
Chirp Transform for FFT Since the FFT is an implementation of the DFT, it provides a frequency resolution of 2π/N, where N is the length of the input sequence. If this resolution is not sufficient in a
More informationComplement on Digital Spectral Analysis and Optimal Filtering: Theory and Exercises
Complement on Digital Spectral Analysis and Optimal Filtering: Theory and Exercises Random Processes With Applications (MVE 135) Mats Viberg Department of Signals and Systems Chalmers University of Technology
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 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 informationLecture 20: Discrete Fourier Transform and FFT
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept of Electrical Engineering Lecture 20: Discrete Fourier Transform and FFT Dec 10, 2001 Prof: J Bilmes TA:
More information13.7 Power Spectrum Estimation by the Maximum Entropy (All Poles) Method
3.7 Maximum Entropy (All Poles) Method 565 LP coefficients for each segment of the data. The output is reconstructed by driving these coefficients with initial conditions consisting of all zeros except
More informationWiener-Khintchine Theorem. White Noise. Wiener-Khintchine Theorem. Power Spectrum Estimation
Wiener-Khintchine Theorem Let x(n) be a WSS random process with autocorrelation sequence r xx (m) =E[x(n + m)x (n)] The power spectral density is defined as the Discrete Time Fourier Transform of the autocorrelation
More informationBME 50500: Image and Signal Processing in Biomedicine. Lecture 5: Correlation and Power-Spectrum CCNY
1 BME 50500: Image and Signal Processing in Biomedicine Lecture 5: Correlation and Power-Spectrum Lucas C. Parra Biomedical Engineering Department CCNY http://bme.ccny.cuny.edu/faculty/parra/teaching/signal-and-image/
More informationFourier Methods in Digital Signal Processing Final Exam ME 579, Spring 2015 NAME
Fourier Methods in Digital Signal Processing Final Exam ME 579, Instructions for this CLOSED BOOK EXAM 2 hours long. Monday, May 8th, 8-10am in ME1051 Answer FIVE Questions, at LEAST ONE from each section.
More information2.161 Signal Processing: Continuous and Discrete Fall 2008
MI OpenCourseWare http://ocw.mit.edu.6 Signal Processing: Continuous and Discrete Fall 008 For information about citing these materials or our erms of Use, visit: http://ocw.mit.edu/terms. Massachusetts
More information6.435, System Identification
System Identification 6.435 SET 3 Nonparametric Identification Munther A. Dahleh 1 Nonparametric Methods for System ID Time domain methods Impulse response Step response Correlation analysis / time Frequency
More informationCourse Name: Digital Signal Processing Course Code: EE 605A Credit: 3
Course Name: Digital Signal Processing Course Code: EE 605A Credit: 3 Prerequisites: Sl. No. Subject Description Level of Study 01 Mathematics Fourier Transform, Laplace Transform 1 st Sem, 2 nd Sem 02
More informationAutoregressive (AR) Modelling
Autoregressive (AR) Modelling A. Uses of AR Modelling () Alications (a) Seech recognition and coding (storage) (b) System identification (c) Modelling and recognition of sonar, radar, geohysical signals
More informationLinear Prediction 1 / 41
Linear Prediction 1 / 41 A map of speech signal processing Natural signals Models Artificial signals Inference Speech synthesis Hidden Markov Inference Homomorphic processing Dereverberation, Deconvolution
More informationSIDDHARTH GROUP OF INSTITUTIONS:: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)
SIDDHARTH GROUP OF INSTITUTIONS:: PUTTUR Siddharth Nagar, Narayanavanam Road 517583 QUESTION BANK (DESCRIPTIVE) Subject with Code : Digital Signal Processing(16EC422) Year & Sem: III-B.Tech & II-Sem Course
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 informationSignal processing Frequency analysis
Signal processing Frequency analysis Jean-Hugh Thomas (jean-hugh.thomas@univ-lemans.r) Fourier series and Fourier transorm (h30 lecture+h30 practical work) 2 Sampling (h30+h30) 3 Power spectrum estimation
More informationEE 3054: Signals, Systems, and Transforms Spring A causal discrete-time LTI system is described by the equation. y(n) = 1 4.
EE : Signals, Systems, and Transforms Spring 7. A causal discrete-time LTI system is described by the equation Test y(n) = X x(n k) k= No notes, closed book. Show your work. Simplify your answers.. A discrete-time
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 informationDiscrete-Time Gaussian Fourier Transform Pair, and Generating a Random Process with Gaussian PDF and Power Spectrum Mark A.
Discrete-Time Gaussian Fourier Transform Pair, and Generating a Random Process with Gaussian PDF and Power Spectrum Mark A. Richards October 3, 6 Updated April 5, Gaussian Transform Pair in Continuous
More informationPart III Spectrum Estimation
ECE79-4 Part III Part III Spectrum Estimation 3. Parametric Methods for Spectral Estimation Electrical & Computer Engineering North Carolina State University Acnowledgment: ECE79-4 slides were adapted
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 informationAutoregressive tracking of vortex shedding. 2. Autoregression versus dual phase-locked loop
Autoregressive tracking of vortex shedding Dileepan Joseph, 3 September 2003 Invensys UTC, Oxford 1. Introduction The purpose of this report is to summarize the work I have done in terms of an AR algorithm
More informationEEG- Signal Processing
Fatemeh Hadaeghi EEG- Signal Processing Lecture Notes for BSP, Chapter 5 Master Program Data Engineering 1 5 Introduction The complex patterns of neural activity, both in presence and absence of external
More informationLab 9a. Linear Predictive Coding for Speech Processing
EE275Lab October 27, 2007 Lab 9a. Linear Predictive Coding for Speech Processing Pitch Period Impulse Train Generator Voiced/Unvoiced Speech Switch Vocal Tract Parameters Time-Varying Digital Filter H(z)
More informationAdaptive Systems Homework Assignment 1
Signal Processing and Speech Communication Lab. Graz University of Technology Adaptive Systems Homework Assignment 1 Name(s) Matr.No(s). The analytical part of your homework (your calculation sheets) as
More informationLAB 6: FIR Filter Design Summer 2011
University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 6: FIR Filter Design Summer 011
More informationFeature extraction 2
Centre for Vision Speech & Signal Processing University of Surrey, Guildford GU2 7XH. Feature extraction 2 Dr Philip Jackson Linear prediction Perceptual linear prediction Comparison of feature methods
More informationDigital Signal Processing
COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #21 Friday, October 24, 2003 Types of causal FIR (generalized) linear-phase filters: Type I: Symmetric impulse response: with order M an even
More informationTHE PROCESSING of random signals became a useful
IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, VOL. 58, NO. 11, NOVEMBER 009 3867 The Quality of Lagged Products and Autoregressive Yule Walker Models as Autocorrelation Estimates Piet M. T. Broersen
More informationQuestion Bank. UNIT 1 Part-A
FATIMA MICHAEL COLLEGE OF ENGINEERING & TECHNOLOGY Senkottai Village, Madurai Sivagangai Main Road, Madurai -625 020 An ISO 9001:2008 Certified Institution Question Bank DEPARTMENT OF ELECTRONICS AND COMMUNICATION
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 informationrepresentation of speech
Digital Speech Processing Lectures 7-8 Time Domain Methods in Speech Processing 1 General Synthesis Model voiced sound amplitude Log Areas, Reflection Coefficients, Formants, Vocal Tract Polynomial, l
More informationIT DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING IT6502 - DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A 1. What is a continuous and discrete time signal? Continuous
More informationNotes 22 largely plagiarized by %khc
Notes 22 largely plagiarized by %khc LTv. ZT Using the conformal map z e st, we can transfer our knowledge of the ROC of the bilateral laplace transform to the ROC of the bilateral z transform. Laplace
More informationLeast Square Es?ma?on, Filtering, and Predic?on: ECE 5/639 Sta?s?cal Signal Processing II: Linear Es?ma?on
Least Square Es?ma?on, Filtering, and Predic?on: Sta?s?cal Signal Processing II: Linear Es?ma?on Eric Wan, Ph.D. Fall 2015 1 Mo?va?ons If the second-order sta?s?cs are known, the op?mum es?mator is given
More informationAutomatic Autocorrelation and Spectral Analysis
Piet M.T. Broersen Automatic Autocorrelation and Spectral Analysis With 104 Figures Sprin ger 1 Introduction 1 1.1 Time Series Problems 1 2 Basic Concepts 11 2.1 Random Variables 11 2.2 Normal Distribution
More informationMassachusetts Institute of Technology
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.011: Introduction to Communication, Control and Signal Processing QUIZ, April 1, 010 QUESTION BOOKLET Your
More informationw n = c k v n k (1.226) w n = c k v n k + d k w n k (1.227) Clearly non-recursive filters are a special case of recursive filters where M=0.
Random Data 79 1.13 Digital Filters There are two fundamental types of digital filters Non-recursive N w n = c k v n k (1.226) k= N and recursive N M w n = c k v n k + d k w n k (1.227) k= N k=1 Clearly
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 information2.161 Signal Processing: Continuous and Discrete Fall 2008
IT OpenCourseWare http://ocw.mit.edu 2.161 Signal Processing: Continuous and Discrete all 2008 or information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. assachusetts
More informationChapter 9. Linear Predictive Analysis of Speech Signals 语音信号的线性预测分析
Chapter 9 Linear Predictive Analysis of Speech Signals 语音信号的线性预测分析 1 LPC Methods LPC methods are the most widely used in speech coding, speech synthesis, speech recognition, speaker recognition and verification
More information2.161 Signal Processing: Continuous and Discrete Fall 2008
IT OpenCourseWare http://ocw.mit.edu 2.6 Signal Processing: Continuous and Discrete Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. ASSACHUSETTS
More informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture : Design of Digital IIR Filters (Part I) Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 008 K. E. Barner (Univ.
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 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 informationSIMON FRASER UNIVERSITY School of Engineering Science
SIMON FRASER UNIVERSITY School of Engineering Science Course Outline ENSC 810-3 Digital Signal Processing Calendar Description This course covers advanced digital signal processing techniques. The main
More informationThe goal of the Wiener filter is to filter out noise that has corrupted a signal. It is based on a statistical approach.
Wiener filter From Wikipedia, the free encyclopedia In signal processing, the Wiener filter is a filter proposed by Norbert Wiener during the 1940s and published in 1949. [1] Its purpose is to reduce the
More informationIMPROVEMENTS IN MODAL PARAMETER EXTRACTION THROUGH POST-PROCESSING FREQUENCY RESPONSE FUNCTION ESTIMATES
IMPROVEMENTS IN MODAL PARAMETER EXTRACTION THROUGH POST-PROCESSING FREQUENCY RESPONSE FUNCTION ESTIMATES Bere M. Gur Prof. Christopher Niezreci Prof. Peter Avitabile Structural Dynamics and Acoustic Systems
More informationComputer Engineering 4TL4: Digital Signal Processing
Computer Engineering 4TL4: Digital Signal Processing Day Class Instructor: Dr. I. C. BRUCE Duration of Examination: 3 Hours McMaster University Final Examination December, 2003 This examination paper includes
More informationSignals and Systems
204181 Signals and Systems Examination Scheme: Teaching Scheme: Theory Online : 50 Marks Lectures: 4 Hrs/ Week Theory Paper : 50 Marks Tutorial : 1 Hr/Week Term work: 25 Course Objectives and Outcomes:
More informationSignals, Instruments, and Systems W5. Introduction to Signal Processing Sampling, Reconstruction, and Filters
Signals, Instruments, and Systems W5 Introduction to Signal Processing Sampling, Reconstruction, and Filters Acknowledgments Recapitulation of Key Concepts from the Last Lecture Dirac delta function (
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 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 information1 1.27z z 2. 1 z H 2
E481 Digital Signal Processing Exam Date: Thursday -1-1 16:15 18:45 Final Exam - Solutions Dan Ellis 1. (a) In this direct-form II second-order-section filter, the first stage has
More informationMagnitude F y. F x. Magnitude
Design of Optimum Multi-Dimensional Energy Compaction Filters N. Damera-Venkata J. Tuqan B. L. Evans Imaging Technology Dept. Dept. of ECE Dept. of ECE Hewlett-Packard Labs Univ. of California Univ. of
More informationCentre for Mathematical Sciences HT 2018 Mathematical Statistics
Lund University Stationary stochastic processes Centre for Mathematical Sciences HT 2018 Mathematical Statistics Computer exercise 1 in Stationary stochastic processes, HT 18. The purpose of this computer
More informationWiener Filtering. EE264: Lecture 12
EE264: Lecture 2 Wiener Filtering In this lecture we will take a different view of filtering. Previously, we have depended on frequency-domain specifications to make some sort of LP/ BP/ HP/ BS filter,
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 informationbe a deterministic function that satisfies x( t) dt. Then its Fourier
Lecture Fourier ransforms and Applications Definition Let ( t) ; t (, ) be a deterministic function that satisfies ( t) dt hen its Fourier it ransform is defined as X ( ) ( t) e dt ( )( ) heorem he inverse
More informationcovariance function, 174 probability structure of; Yule-Walker equations, 174 Moving average process, fluctuations, 5-6, 175 probability structure of
Index* The Statistical Analysis of Time Series by T. W. Anderson Copyright 1971 John Wiley & Sons, Inc. Aliasing, 387-388 Autoregressive {continued) Amplitude, 4, 94 case of first-order, 174 Associated
More informationTHE PROBLEMS OF ROBUST LPC PARAMETRIZATION FOR. Petr Pollak & Pavel Sovka. Czech Technical University of Prague
THE PROBLEMS OF ROBUST LPC PARAMETRIZATION FOR SPEECH CODING Petr Polla & Pavel Sova Czech Technical University of Prague CVUT FEL K, 66 7 Praha 6, Czech Republic E-mail: polla@noel.feld.cvut.cz Abstract
More informationL7: Linear prediction of speech
L7: Linear prediction of speech Introduction Linear prediction Finding the linear prediction coefficients Alternative representations This lecture is based on [Dutoit and Marques, 2009, ch1; Taylor, 2009,
More informationCourse content (will be adapted to the background knowledge of the class):
Biomedical Signal Processing and Signal Modeling Lucas C Parra, parra@ccny.cuny.edu Departamento the Fisica, UBA Synopsis This course introduces two fundamental concepts of signal processing: linear systems
More informationSTAT 153: Introduction to Time Series
STAT 153: Introduction to Time Series Instructor: Aditya Guntuboyina Lectures: 12:30 pm - 2 pm (Tuesdays and Thursdays) Office Hours: 10 am - 11 am (Tuesdays and Thursdays) 423 Evans Hall GSI: Brianna
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 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 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 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 informationMel-Generalized Cepstral Representation of Speech A Unified Approach to Speech Spectral Estimation. Keiichi Tokuda
Mel-Generalized Cepstral Representation of Speech A Unified Approach to Speech Spectral Estimation Keiichi Tokuda Nagoya Institute of Technology Carnegie Mellon University Tamkang University March 13,
More informationPAGE 1 FIRST AN ADVERTISEMENT
PAGE 1 FIRST AN ADVERTISEMENT Neil Grossbard(x6356),proficient in numerical analysis and computer programming. Thanks to the efforts of Jack Jasperse, Bamandas Basu, Paul Rothwel and many other scientists,
More informationStationary Graph Processes: Nonparametric Spectral Estimation
Stationary Graph Processes: Nonparametric Spectral Estimation Santiago Segarra, Antonio G. Marques, Geert Leus, and Alejandro Ribeiro Dept. of Signal Theory and Communications King Juan Carlos University
More information( ) John A. Quinn Lecture. ESE 531: Digital Signal Processing. Lecture Outline. Frequency Response of LTI System. Example: Zero on Real Axis
John A. Quinn Lecture ESE 531: Digital Signal Processing Lec 15: March 21, 2017 Review, Generalized Linear Phase Systems Penn ESE 531 Spring 2017 Khanna Lecture Outline!!! 2 Frequency Response of LTI System
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 informationSome notes on processing: causal vs. acausal low-cut filters version 1.0. David M. Boore. Introduction
File: c:\filter\notes on processing.tex Some notes on processing: causal vs. acausal low-cut filters version. David M. Boore Introduction These are some informal notes showing results of some procedures
More information