CHAPTER 3 Discrete-Time Signals in the Transform-Domain

Slides:



Advertisements
Similar presentations
Hany Ferdinando Dept. of Electrical Eng. Petra Christian University
Advertisements

ELEN 5346/4304 DSP and Filter Design Fall Lecture 7: Z-transform Instructor: Dr. Gleb V. Tcheslavski Contact:
Signals and Systems – Chapter 5
Chapter 8: The Discrete Fourier Transform
Lecture 19: Discrete-Time Transfer Functions
Discrete-Time Signal processing Chapter 3 the Z-transform
Lecture #07 Z-Transform meiling chen signals & systems.
Z-Transform Fourier Transform z-transform. Z-transform operator: The z-transform operator is seen to transform the sequence x[n] into the function X{z},
Signals and Systems Discrete Time Fourier Series.
Prepared by: Deepak Kumar Rout
Systems: Definition Filter
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Copyright © Shi Ping CUC Chapter 3 Discrete Fourier Transform Review Features in common We need a numerically computable transform, that is Discrete.
Discrete-Time and System (A Review)
1 7.1 Discrete Fourier Transform (DFT) 7.2 DFT Properties 7.3 Cyclic Convolution 7.4 Linear Convolution via DFT Chapter 7 Discrete Fourier Transform Section.
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
UNIT - 4 ANALYSIS OF DISCRETE TIME SIGNALS. Sampling Frequency Harry Nyquist, working at Bell Labs developed what has become known as the Nyquist Sampling.
Chapter 2 Discrete-Time Signals and Systems
CHAPTER 1 Signals and Signal Processing
The z-Transform Prof. Siripong Potisuk. LTI System description Previous basis function: unit sample or DT impulse  The input sequence is represented.
CHAPTER 8 DSP Algorithm Implementation Wang Weilian School of Information Science and Technology Yunnan University.
Fourier Series Summary (From Salivahanan et al, 2002)
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]
Digital Signal Processing – Chapter 10
Finite-Length Discrete Transform
Discrete Fourier Transform Prof. Siripong Potisuk.
CHAPTER 6 Digital Filter Structures
CHAPTER 4 Laplace Transform.
1 1 Chapter 3 The z-Transform 2 2  Consider a sequence x[n] = u[n]. Its Fourier transform does not converge.  Consider that, instead of e j , we use.
Chapter 5 Z Transform. 2/45  Z transform –Representation, analysis, and design of discrete signal –Similar to Laplace transform –Conversion of digital.
Z Transform Chapter 6 Z Transform. z-Transform The DTFT provides a frequency-domain representation of discrete-time signals and LTI discrete-time systems.
1 Z-Transform. CHAPTER 5 School of Electrical System Engineering, UniMAP School of Electrical System Engineering, UniMAP NORSHAFINASH BT SAUDIN
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 School of Computer and Communication Engineering, UniMAP Hasliza A Samsuddin EKT.
The Discrete Fourier Transform 主講人:虞台文. Content Introduction Representation of Periodic Sequences – DFS (Discrete Fourier Series) Properties of DFS The.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
CHAPTER 10 Applications of Digital Signal Processing
Department of Computer Eng. Sharif University of Technology Discrete-time signal processing Chapter 3: THE Z-TRANSFORM Content and Figures are from Discrete-Time.
1 Lecture 1: February 20, 2007 Topic: 1. Discrete-Time Signals and Systems.
Digital Signal Processing Chapter 3 Discrete transforms.
Fourier Analysis of Discrete Time Signals
Digital Signal Processing
Z TRANSFORM AND DFT Z Transform
Lecture 6: DFT XILIANG LUO 2014/10. Periodic Sequence  Discrete Fourier Series For a sequence with period N, we only need N DFS coefs.
Chapter 5 Finite-Length Discrete Transform
CHAPTER 2 Discrete-Time Signals and Systems in the Time-Domain
DTFT Properties  Example - Determine the DTFT Y(e jω ) of  Let  We can therefore write  the DTFT of x[n] is given by.
Digital Signal Processing
The Z-Transform Quote of the Day Such is the advantage of a well-constructed language that its simplified notation often becomes the source of profound.
DTFT continue (c.f. Shenoi, 2006)  We have introduced DTFT and showed some of its properties. We will investigate them in more detail by showing the associated.
Sampling and Reconstruction The impulse response of an continuous-time ideal low pass filter is the inverse continuous Fourier transform of its frequency.
CHAPTER 5 Digital Processing of Continuous- Time Signal Wangweilian School of Information Science and Technology Yunnan University.
Fourier Representation of Signals and LTI Systems.
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 School of Computer and Communication Engineering, UniMAP Amir Razif B. Jamil Abdullah EKT.
بسم الله الرحمن الرحيم Digital Signal Processing Lecture 3 Review of Discerete time Fourier Transform (DTFT) University of Khartoum Department of Electrical.
Chapter 2 The z-transform and Fourier Transforms The Z Transform The Inverse of Z Transform The Prosperity of Z Transform System Function System Function.
Dr. Michael Nasief Digital Signal Processing Lec 7 1.
Review of DSP.
بسم الله الرحمن الرحيم Lecture (12) Dr. Iman Abuel Maaly The Discrete Fourier Transform Dr. Iman Abuel Maaly University of Khartoum Department of Electrical.
1 Chapter 8 The Discrete Fourier Transform (cont.)
CHAPTER 5 Z-Transform. EKT 230.
CE Digital Signal Processing Fall Discrete-time Fourier Transform
Chapter 5 Z Transform.
4.1 DFT In practice the Fourier components of data are obtained by digital computation rather than by analog processing. The analog values have to be.
Chapter 5 DT System Analysis : Z Transform Basil Hamed
Discrete-Time Signal processing Chapter 3 the Z-transform
Lecture 17 DFT: Discrete Fourier Transform
Lecture 15 DTFT: Discrete-Time Fourier Transform
Discrete-Time Fourier Transform Discrete Fourier Transform z-Transform
Discrete-Time Signal processing Chapter 3 the Z-transform
Presentation transcript:

CHAPTER 3 Discrete-Time Signals in the Transform-Domain Wang Weilian wlwang@ynu.edu.cn School of Information Science and Technology Yunnan University

Outline The Discrete-Time Fourier Transform The Discrete Fourier Transform Relation between the DTFT and the DFT, and Their Inverses Discrete Fourier Transform Properties Computation of the DFT of Real Sequences Linear Convolution Using the DFT The z-Transform 云南大学滇池学院课程:数字信号处理

Outline Region of Convergence of a Rational z-Transform Inverse z-Transform z-Transform Properties 云南大学滇池学院课程:数字信号处理

The Discrete-Time Fourier Transform The discrete-time Fourier transform (DTFT) or, simply, the Fourier transform of a discrete–time sequence x[n] is a representation of the sequence in terms of the complex exponential sequence where is the real frequency variable. The discrete-time Fourier transform of a sequence x[n] is defined by 云南大学滇池学院课程:数字信号处理

The Discrete-Time Fourier Transform In general is a complex function of the real variable and can be written in rectangular form as where and are, respectively, the real and imaginary parts of , and are real functions of . Polar form 云南大学滇池学院课程:数字信号处理

The Discrete-Time Fourier Transform Convergence Condition: If x[n] is an absolutely summable sequence, i.e., Thus the equation is a sufficient condition for the existence of the DTFT. 云南大学滇池学院课程:数字信号处理

The Discrete-Time Fourier Transform Bandlimited Signals: A full-band discrete-time signal has a spectrum occupying the whole frequency rang . If the spectrum is limited to a portion of the frequency range , it is called a bandlimited signal. A lowpass discrete-time signal has a spectrum occupying the frequency range , where is called the bandwidth of the signal. A bandpass discrete-time signal has a spectrum occupying the frequency range , where is its bandwidth. 云南大学滇池学院课程:数字信号处理

The Discrete-Time Fourier Transform Discrete-Time Fourier Transform Properties There are a number of important properties of the discrete-time Fourier transform which are useful in digital signal processing applications. We list the general properties in Table 3.2, and the symmetry properties in Tables 3.3 and 3.4. 云南大学滇池学院课程:数字信号处理

The Discrete-Time Fourier Transform Energy Density Spectrum 云南大学滇池学院课程:数字信号处理

The Discrete Fourier Transform DTFT Computation Using MATLAB The Signal Processing Toolbox in MATLAB Functions: freqz abs Angle The forms of freqz: H = freqz(num, den, w) [H, w] = freqz(num, den, k, ’whole’) Example 3.8: Program 3_1 云南大学滇池学院课程:数字信号处理

The Discrete Fourier Transform Definition The simplest relation between a finite-length sequence x[n], defined for , and its DTFT is obtained by uniformly sampling on the -axis between at , . 云南大学滇池学院课程:数字信号处理

The Discrete Fourier Transform The sequence X[k] is called the discrete Fourier transform (DFT) of the sequence x[n]. Using the commonly used notation We can rewrite as Inverse discrete Fourier transform (IDFT) 云南大学滇池学院课程:数字信号处理

The Discrete Fourier Transform Matrix Relations The DFT samples defined in can be expressed in matrix form as where X is the vector composed of the N DFT samples, x is the vector of N input samples, 云南大学滇池学院课程:数字信号处理

The Discrete Fourier Transform is the DFT matrix given by IDFT relations 云南大学滇池学院课程:数字信号处理

The Discrete Fourier Transform DFT computation Using MATLAB MATLAB functions: fft(x), fft(x,N), ifft(X), ifft(X,N) X = fft(x, N) If N < R=length(x), truncate (截短) to the first N samples. If N > R=length(x), zero-padded (补零) at the end. Example 3.11, 3.12, 3.13, Program 3_2, 3_3, 3_4. 云南大学滇池学院课程:数字信号处理

Relation between the DTFT and the DFT, and their Inverses DTFT from DFT by Interpolation We could express in terms of X[k]: 云南大学滇池学院课程:数字信号处理

Relation between the DTFT and the DFT, and their Inverses Sampling the DTFT Consider the following question We obtain the relation Example 3.14 云南大学滇池学院课程:数字信号处理

Relation between the DTFT and the DFT, and their Inverses Numerical Computation of the DTFT Using the DFT Let be the DTFT of length-N sequence x[n]. We wish to evaluate at a dense grid of frequencies: 云南大学滇池学院课程:数字信号处理

Discrete Fourier Transform Properties Like the DTFT, the DFT also satisfies a number of properties that are useful in signal processing application. A summary of the DFT properties are included in Tables 3.5, 3.6, and 3.7. 云南大学滇池学院课程:数字信号处理

Discrete Fourier Transform Properties Circular Shift of a Sequence Time-shifting property of the DTFT Circular shifting property of the DFT 云南大学滇池学院课程:数字信号处理

Computation of the DFT of Real Sequences Tow N-point DFTs can be computed efficiently using a single N-point DFT X[k] of a complex length-N sequence x[n] defined by where, and 云南大学滇池学院课程:数字信号处理

Computation of the DFT of Real Sequences we arrive at: Note that 云南大学滇池学院课程:数字信号处理

Linear Convolution Using the DFT Linear Convolution of Two Finite-Length Sequences Let g[n] and h[n] be finite-length sequences of lengths N and M, respectively. Denote L=M+N-1. Define two length-L sequences, 云南大学滇池学院课程:数字信号处理

Linear Convolution Using the DFT obtained by appending g[n] and h[n] with zero-valued samples. Then Linear Convolution of a Finite-Length Sequence with an Infinite-Length Sequence Overlap-Add Method Overlap-Save Method 云南大学滇池学院课程:数字信号处理

The z-Transform Definition For a given sequence g[n], its z-transform G(z) is defined as where is a complex variable. If we let , then the right-hand side of the above expression reduces to 云南大学滇池学院课程:数字信号处理

The z-Transform For a given sequence, the set R of values of z for which its z-transform converges is called the region of convergence (ROC). If In general, the region of convergence R of a z-transform of a sequence g[n] is an annular region of the z-plane: 云南大学滇池学院课程:数字信号处理

The z-Transform Rational z-Transforms An alternate representation as a ration of two polynomials in z: An alternate representation in factored form as 云南大学滇池学院课程:数字信号处理

Region of Convergence of a Rational z-Transform The ROC of a rational z-transform is bounded by the locations of its poles. A finite-length sequence ROC: A right-sided sequence ROC: A left-sided sequence ROC: A two-sided sequence ROC: 云南大学滇池学院课程:数字信号处理

Inverse z-Transform General Expression By the inverse Fourier transform relation. We have By making the change of variable , the above equation can be converted into a contour integral given by Where is a counterclockwise contour of integration defined by 云南大学滇池学院课程:数字信号处理

Inverse z-Transform Inverse Transform by Partial-Fraction Expansion can be expressed as We can divide P(Z) by D(Z) and re-express G(Z) as 云南大学滇池学院课程:数字信号处理

Inverse z-Transform Simple Poles p168 Multiple Poles p169 云南大学滇池学院课程:数字信号处理

z-Transform Properties P174 Table 3.9 云南大学滇池学院课程:数字信号处理

Summary Three different frequency-domain representations of an aperiodic discrete-time sequence have been introduced and their properties reviewed .Two of these representations, the discrete-time Fourier transform (DTFT) and the z-transform, are applicable to any arbitrary sequence, whereas the third one , the discrete Fourier transform (DFT), can be applied only to finite-length sequences. Relation between these three transforms have been established. The chapter ends with a discussion on the transform-domain representation of a random discrete-time sequence. For future convenience we summarize below these three frequency-domain representations. 云南大学滇池学院课程:数字信号处理

Assignment and Experiment A03: 3.2, 3.12, 3.20, See p180~182 A04: A05: Experiment E03: Q3.3 See p32 E04: E05 云南大学滇池学院课程:数字信号处理