Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.

Slides:



Advertisements
Similar presentations
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
Advertisements

Digital Signal Processing – Chapter 11 Introduction to the Design of Discrete Filters Prof. Yasser Mostafa Kadah
1 Discrete Hilbert Transform 7 th April 2007 Digital Signal Processing I Islamic University of Gaza.
Speech and Audio Processing and Recognition
Z Transform (2) Hany Ferdinando Dept. of Electrical Eng. Petra Christian University.
Discrete-Time Signals and Systems Quote of the Day Mathematics is the tool specially suited for dealing with abstract concepts of any kind and there is.
Chapter 4 Image Enhancement in the Frequency Domain.
1 Copyright © 2001, S. K. Mitra Polyphase Decomposition The Decomposition Consider an arbitrary sequence {x[n]} with a z-transform X(z) given by We can.
Lecture #7 FREQUENCY RESPONSE OF LSI SYSTEMS Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh, Pennsylvania.
About this Course Subject: Textbook Reference book Course website
5.1 the frequency response of LTI system 5.2 system function 5.3 frequency response for rational system function 5.4 relationship between magnitude and.
Chapter 4 Image Enhancement in the Frequency Domain.
Systems: Definition Filter
Fast Fourier Transforms
T Digital Signal Processing and Filtering
Speech Signal Processing I Edmilson Morais and Prof. Greg. Dogil October, 25, 2001.
Lecture 9 FIR and IIR Filter design using Matlab
Discrete-Time and System (A Review)
Chapter 2 Discrete-Time Signals and Systems
Chapter 2: Discrete time signals and systems
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
1 The Fourier Series for Discrete- Time Signals Suppose that we are given a periodic sequence with period N. The Fourier series representation for x[n]
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
Digital Signal Processing – Chapter 10
Chapter 7 LTI Discrete-Time Systems in the Transform domain.
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
Discrete Fourier Transform Prof. Siripong Potisuk.
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
5.Linear Time-Invariant System
Z TRANSFORM AND DFT Z Transform
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
ELECTRICA L ENGINEERING Principles and Applications SECOND EDITION ALLAN R. HAMBLEY ©2002 Prentice-Hall, Inc. Chapter 6 Frequency Response, Bode Plots,
EEE 503 Digital Signal Processing Lecture #2 : EEE 503 Digital Signal Processing Lecture #2 : Discrete-Time Signals & Systems Dr. Panuthat Boonpramuk Department.
DTFT Properties  Example - Determine the DTFT Y(e jω ) of  Let  We can therefore write  the DTFT of x[n] is given by.
1 Today's lecture −Cascade Systems −Frequency Response −Zeros of H(z) −Significance of zeros of H(z) −Poles of H(z) −Nulling Filters.
Digital Signal Processing
Transform Analysis of LTI Systems Quote of the Day Any sufficiently advanced technology is indistinguishable from magic. Arthur C. Clarke Content and Figures.
Chapter 4 LTI Discrete-Time Systems in the Transform Domain
Instructor: Mian Shahzad Iqbal
Filtering x y.
Lecture 12: Parametric Signal Modeling XILIANG LUO 2014/11 1.
Signals and Systems, 2/E by Simon Haykin and Barry Van Veen Copyright © 2003 John Wiley & Sons. Inc. All rights reserved. Figure 4.1 (p. 343) FS and FT.
Fourier Analysis Using the DFT Quote of the Day On two occasions I have been asked, “Pray, Mr. Babbage, if you put into the machine wrong figures, will.
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
Frequency Response of Rational Systems Quote of the Day If knowledge can create problems, it is not through ignorance that we can solve them. Isaac Asimov.
Minimum-Phase Systems Quote of the Day Experience is the name everyone gives to their mistakes. Oscar Wilde Content and Figures are from Discrete-Time.
ELECTRICAL ENGINEERING: PRINCIPLES AND APPLICATIONS, Fourth Edition, by Allan R. Hambley, ©2008 Pearson Education, Inc. Lecture 17 Fourier Analysis, Low.
ELECTRICAL ENGINEERING: PRINCIPLES AND APPLICATIONS, Third Edition, by Allan R. Hambley, ©2005 Pearson Education, Inc. CHAPTER 6 Frequency Response, Bode.
Generalized Linear Phase Quote of the Day The mathematical sciences particularly exhibit order, symmetry, and limitation; and these are the greatest forms.
Dr. Michael Nasief Digital Signal Processing Lec 7 1.
 Signal: Physical quantity that varies with time, space or any other independent variable/s.  System: Physical device that performs an operation on.
Discrete Time Signal Processing Chu-Song Chen (陳祝嵩) Institute of Information Science Academia Sinica 中央研究院 資訊科學研究所.
DSP First, 2/e Lecture 16 DTFT Properties. June 2016 © , JH McClellan & RW Schafer 2 License Info for DSPFirst Slides  This work released under.
Review of Fourier Transform for Continuous-time aperiodic signals.
Figure 11.1 Linear system model for a signal s[n].
Figure 7.1 (p. 554) Real and imaginary parts of the signal zn.
Digital Signal Processing Lecture 4 DTFT
The Discrete Fourier Transform
Outline Linear Shift-invariant system Linear filters
Lecture 18 DFS: Discrete Fourier Series, and Windowing
Chapter 8 The Discrete Fourier Transform
Homomorphic Speech Processing
Chapter 8 The Discrete Fourier Transform
INTRODUCTION TO THE SHORT-TIME FOURIER TRANSFORM (STFT)
Speech Processing Final Project
Lecture 4 Image Enhancement in Frequency Domain
Presentation transcript:

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure 13.1 System notation for the mapping and inverse mapping between a signal and its complex cepstrum.

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure 13.2 Determination of the complex cepstrum for minimum-phase signals.

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure 13.3 Cascade of three systems implementing the computation of the complex cepstrum operation D ∗ [ ].

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure 13.4 Approximate realization using the DFT of (a) D ∗ [ ・ ] and (b) D − ∗ 1 [ ・ ].

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure 13.5 (a) Samples of arg[X(e jω )]. (b) Principal value of part (a). (c) Correction sequence for obtaining arg from ARG.

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure 13.6 Canonic form for homomorphic systems where inputs and corresponding outputs are combined by convolution.

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure 13.7 Deconvolution of a sequence into minimum-phase and allpass components using the cepstrum.

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure 13.8 The use of homomorphic deconvolution to separate a sequence into minimum-phase and maximum- phase components.

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure 13.9 Pole-zero plot of the z -transform X(z) = V(z)P(z) for the example signal of Figure

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure The sequences: (a) v[n], (b) p[n], and (c) x[n] corresponding to the pole–zero plot of Figure 13.9.

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure The sequences: (a) v[n], (b) p[n], and (c) x[n]. ˆ ˆˆ

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure The sequences: (a) c v [n], (b) c p [n], and (c) c x [n].

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure Fourier transforms of x[n] in Figure (a) Log magnitude. (b) Principal value of the phase. (c) Continuous “unwrapped” phase after removing a linear-phase component from part (b). The DFT samples are connected by straight lines.

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure (a) Complex cepstrum xp[n] of sequence in Figure 13.10(c). (b) Cepstrum c x [n] of sequence in Figure 13.10(c). ˆ

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure (a) System for homomorphic deconvolution. (b) Time-domain representation of frequency-invariant filtering.

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure Time response of frequency-invariant linear systems for homomorphic deconvolution. (a) Lowpass system. (b) Highpass system. (Solid line indicates envelope of the sequence [n] as it would be applied in a DFT implementation. The dashed line indicates the periodic extension.)

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure Lowpass frequency-invariant linear filtering in the system of Figure (a) Real parts of the Fourier transforms of the input (solid line) and output (dashed line) of the lowpass system with N 1 = 14 and N 2 = 14 in Figure 13.16(a). (b) Imaginary parts of the input (solid line) and output (dashed line). (c) Output sequence y [n] for the input of Figure 13.10(c).

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure Illustration of highpass frequency-invariant linear filtering in the system of Figure (a) Real part of the Fourier transform of the output of the highpass frequency-invariant system with N 1 = 14 and N 2 = 512 in Figure 13.16(b). (b) Imaginary part for conditions of part (a). (c) Output sequence y [n] for the input of Figure

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure (a) Complex cepstrum of x[n] = x min n ∗ x ap [n]. (b) Complex cepstrum of x min [n]. (c) Complex cepstrum of x ap [n].

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure (a) Minimum-phase output. (b) Allpass output obtained as depicted in Figure 13.7.

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure (a) Minimum-phase output. (b) Maximum-phase output obtained as depicted in Figure 13.8.

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure Discrete-time model of speech production.

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure Homomorphic deconvolution of speech. (a) Segment of speech weighted by a Hamming window. (b) High quefrency component of the signal in (a). (c) Low quefrency component of the signal in (a).

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure Complex logarithm of the signal of Figure 13.23(a): (a) Log magnitude. (b) Unwrapped phase.

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure Complex cepstrum of the signal in Figure 13.23(a) (inverse DTFT of the complex logarithm in Figure 13.24).

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure (a) System for cepstrum analysis of speech signals. (b) Analysis for voice speech. (c) Analysis for unvoiced speech.

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure (a) Cepstra and (b) log spectra for sequential segments of voiced speech.

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure P13.10

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure P13.12

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure P

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure P

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure P13.14

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure P13.17

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure P

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure P

Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W. Schafer Figure P13.31