How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches

Size: px
Start display at page:

Download "How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches"

Transcription

1 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 inputs x[n], x[n-], x[n- 2]. as well as the previous outputs y[n-], y[n-2], Discrete Fourier Transform (in short, DFT) Remember we have introduced three inds of Fourier transforms. However, what we are able to deal with in the discrete-time domain is usually a finiteduration signal. DFT is the final (fourth) Fourier transform, where its input is a discrete-time finite-duration signal. Details will be introduced in later courses

2 DTFT Theorems Reviews (From Oppenheim) Linearity x [n] X (e jw ), x 2 [n] X 2 (e jw ) implies that a x [n] + a 2 x 2 [n] a X (e jw ) + a 2 X 2 (e jw ) Time shifting x[n] X(e jw ) implies that x jwn jw d n n e X e d

3 DTFT Theorems (continue) Frequency shifting x[n] X(e jw ) implies that Time reversal e jw n x j w n X e 0 w 0 x[n] X(e jw ) If the sequence is time reversed, then x[n] X(e jw )

4 DTFT Theorems (continue) Differentiation in frequency implies that x[n] X(e jw ) Parseval s theorem x[n] X(e jw ) implies that E nx n n x j dx e dw jw 2 jw n X e 2 2 dw

5 DTFT Theorems (continue) The convolution theorem x[n] X(e jw ) and h[n] H(e jw ), and if y[n] = x[n] h[n], then Y(e jw ) = X(e jw )H(e jw ) The modulation or windowing theorem x[n] X(e jw ) and w[n] W(e jw ), and if y[n] = x[n]w[n], then Y jw j j w e X e W e 2 d Periodic convolution, Y(e jw )= Y(e j(w+2) )

6 DTFT Theorems (continue) Hence, unlie continuous Fourier transform, DTFT s time and frequency domains are not that analogous in DTFT. For example, convolution in the time domain implies multiplication in the frequency domain. But multiplication in the time domain implies periodic-convolution in the frequency domain.

7 DTFT Pairs n n n e 0 jw n 0 ( n ) 2 w 2

8 DTFT Pairs (continue) Real Exponentials n a u n ( a ) ae u n w 2 jw e n n a u n ( a ) jw jw ae 2

9 n DTFT Pairs (continue) sin(ax)/x : called sync function sin(ax)/sin(x) : called Dirichlet Kernel r sin w n p u n ( r ) sin w 2 r cos w e r e p p jw 2 j 2w sin n wn c X e jw 0 w c w w w c x n 0 n M sin w M / 2 0 otherw ise sin w / 2 e jw M /2

10 DTFT Pairs (finally) jw n 0 e 2 w w 2 0 j j w n e w w e w w cos

11 Example: Determining a Fourier Transform Pairwise Formulas Suppose we wish to find the Fourier transform of x[n] = a n u[n-5]. x x x 2 n jw n a u n X e Thus, n x n 5 X 2 ae jw j 5 w jw e e X e 5 jw n a x 2 n, so X e jw jw a 5 e ae e j 5 w j 5 w ae jw

12 Another Example Determining the impulse response for a difference equation y[n](/2) y[n] = x[n] (/4)x[n] To find the impulse response, we set x[n] = [n]. Then the above equation becomes h[n](/2) h[n] = [n] (/4)[n] Applying DTFT, we obtain H(e jw ) (/2)e -jw H(e jw ) = (/4) e -jw So H(e jw ) = ( (/4) e -jw ) / ( (/2) e -jw )

13 continue Then, from the pairwise table, we now a n u n ( a ) ae jw thus, (/2) n u[n] / ( (/2) e -jw ) By the shifting property, in the time domain, the second term of H(e jw ) is (/4)(/2) n u[n] (/4) e -jw / ( (/2) e -jw ) Hence, h[n] = (/2) n u[n] (/4)(/2) n u[n]

14 Symmetry Property of DTFT Conjugate-symmetric sequence: x e [n] = x e *[ n] If a real sequence is conjugate symmetric, then it is called an even sequence satisfying x e [n] = x e [ n]. Conjugate-asymmetric sequence: x o [n] = x o *[ n] If a real sequence is conjugate antisymmetric, then it is called an odd sequence satisfying x 0 [n] = x 0 [n]. Any sequence can be represented as a sum of a conjugate-symmetric and asymmetric sequences, x[n] = x e [n] + x o [n], where x e [n] = (/2)(x[n]+ x*[n]) and x o [n] = (/2)(x[n] x*[n]).

15 Symmetry Property of DTFT (continue) Similarly, a Fourier transform can be decomposed into a sum of conjugate-symmetric and antisymmetric parts: where and X(e jw ) = X e (e jw ) + X o (e jw ), X e (e jw ) = (/2)[X(e jw ) + X*(e jw )] X o (e jw ) = (/2)[X(e jw ) X*(e jw )]

16 Symmetry Property of DTFT (continue) Fourier Transform Pairs (if x[n] X(e jw )) x*[n] X*(e jw ) x*[n] X*(e jw ) Re{x[n]} X e (e jw ) (conjugate-symmetry part of X(e jw )) jim{x[n]} X o (e jw ) (conjugate anti-symmetry part of X(e jw )) x e [n] (conjugate-symmetry part of x[n]) X R (e jw ) = Re{X(e jw )} x o [n] (conjugate anti-symmetry part of x[n]) jx I (e jw ) = jim{x(e jw )}

17 Symmetry Property of DTFT (continue) Fourier Transform Pairs (if x[n] X(e jw )) Any real x e [n] X(e jw ) = X*(e jw ) (Fourier transform is conjugate symmetric) Any real x e [n] X R (e jw ) = X R (e jw ) (real part is even) Any real x e [n] X I (e jw ) = X I (e jw ) (imaginary part is odd) Any real x e [n] X R (e jw ) = X R (e jw ) (magnitude is even) Any real x e [n] X R (e jw )= X R (e jw ) (phase is odd) x o [n] (even part of real x[n]) X R (e jw ) x o [n] (odd part of real x[n]) jx I (e jw )

18 Example of Symmetry Properties The Fourier transform of the real sequence x[n] = a n u[n] for a < is X jw e jw Its magnitude is an even function, and phase is odd. ae

19 Sinusoidal Responses of LTI System (application of symmetric property) We have seen that e jwn is an eigen function of any LTI system, with the corresponding eigenvalue (or frequency response) H(e jw ). What happens when feeding a real sinusoid of frequency w 0 into the LTI system with the frequency response H(e jw )? A j jw n A j x n A cos w n e e e e jw n

20 Sinusoidal Responses of LTI System (application of symmetric property) If the impulse response h[n] is real, by the symmetry property, H(e jw 0) = H*(e jw 0) Hence, A j A j y n H e e e H e e e R e{ } jw jw n jw jw n A jw0 j jw0n A jw0 j jw0n H e e e H e ( e e ) 2 2 A jw0 j jw0n A jw0 j jw0n H e e e [ H e e e ] 2 2 jw j A H e e e jw n jw0 j jw0n j jw0 R e{ }, w here A H e e e e H e jw0 cos 0 A H e w n

21 Efficient Representation of Difference Equations We have mentioned that difference equation is a common way for realiing an LTI system (although not all LTI system is able to be implemented by difference equations) N 0 a y M n bm xn m m 0 To represent a difference equation efficiently, -transform introduced below is widely used.

22 Z-transform Representing a discrete-time signal (or a sequence) as a polynomial. X n n For CS students: It has the same form of the generating function for combinations in combinatorics. But are developed from different domains. In fact, the difference equation is the same as the recurrence relation in combinatorics. x n

23 Z-transform For a right-sided sequence (x[n]=0 for n<0), the -transform is X x n n 0 Example: what is the -transform of deltafunction? X n n 0 n n

24 Example of -transform for a finite sequence X n n N>5 x[n]

25 Z-Transform vs. DTFT Discrete-time Fourier Transform X jw e xn Hence, DTFT is equivalent to substituting =e jw into the -transform n More specifically, the -transform is a generaliation of the DTFT, where the DTFT evaluates the -transform only on the complex unit circle ( = ): e jwn n jw X x n n e

26 Z-Transform vs. DTFT The unit circle in the complex plane. DTFT is only evaluated on this circle.

27 Z-transform vs. Convolution Remember that the convolution results can be seen as the coefficients of polynomial products. Since -transform represents a sequence as a polynomial, it has the property that Time domain convolution implies Z-domain multiplication

28 Proof Convolution Tae the -transform on both sides:

29 Proof (con t) Time domain convolution implies Z-domain multiplication

30 Time Delay Property It can be easily shown that time delay of n 0 samples is equivalent to multiplying -n 0 in the -domain.

31 Z-transform Applying to Systems In the above, -transform is applied to a signal. Now, we apply it to the LTI system realied by a difference equation: Taing -transforms for both sides, we have M m m N m n x b n y a 0 0 m M m m N X b Y a 0 0

32 Z-transform Applying to Systems Hence Y X M m 0 N 0 b a m We call Y H ( ) A fractional form X the system function of this LTI system General Definition: the system function of an LTI system is the -transform of the output signal divided by the -transform of the input signal. m

33 System Function vs. Frequency Response Hence, when feeding an input signal X() to an LTI system with the system function H(), the output is the product Y()=X()H() When =e jw, we obtain the output spectrum Y(e jw )=X(e jw )H(e jw ). X() Y() (= H()X()) H()/H(e jw ) X(e jw ) Y(e jw ) (= H(e jw )X(e jw )) Z-transform Fourier transform

34 Z-transform and Impulse Response In addition, the convolution in time domain implies multiplication in the -domain (and frequency domain). So, x[n] h[n] Time domain convolution y[n] = x[n]h[n] X() Y() (= H()X()) H()/H(e jw ) X(e jw ) Y(e jw ) (= H(e jw )X(e jw )) Z-transform Fourier transform

35 Z-transform Hence, we can represent an LTI system by either h[n] (impulse response), H(e jw ) (frequency response), or H() (-transform) In particular, we usually use H() as a fractional form: M H ( ) m 0 N 0 b to represent a difference-equation LTI system. m a m

36 Cascading of LTI Systems Cascading of LTI systems can be described in the -domain too.

37 Z-transform vs. Laplace transform Remar Z-transform transfers a discrete-time signal to the -domain. It is analogous to the Laplace transform for the continuous-time signal that is transformed to the s- domain. Z-transform: for solving difference equations Laplace transform: for solving differential equations

38 Time Delay System Recall that time delay of n 0 samples is equivalent to convolving with (n-n 0 ) in time domain, or multiplying -n 0 in the -domain. We call - the unit-delay system

39 System Diagram of A Causal FIR System The signal-flow graph of a causal FIR system can be represented by -transforms: x[n] b 0 + y[n] y M n b m x n m m 0 x[n-] x[n-2] b b x[n-m] b M +

40 Deconvolution Deconvolution or inverse filtering

41 Example Deconvolution or inverse filtering

42 Poles and Zeros of Fractional Form Let H() = P()/Q() be the system function of a rational form. Let us represent both P() and Q() as polynomials of (not - ) Then Poles: the roots of Q() Zeros: the roots of P()

43 Example of Poles and Zeros

44 Example and Physical Meanings Three eros: Three poles: 0, 0, 0 (or called a three-order pole at 0) Physical meanings Pole: The pole of a -transform H() are the values of for which H()=. Zero: The ero of a -transform H() are the values of for which H()=0.

45 Poles and eros of negative powers of

46 Pole-Zero Plot It is useful to display the eros and poles of H() on the complex -plane. Knowing the poles and eros is equivalent to nowing the LTI system. eros poles

47 Significance of the Zeros of H() for The poles a FIR system are always in the origin (or a multi-order ero). The eros of a FIR filter thus play a major role in the frequency response. Recall that DTFT is evaluated on the unitcircle on the -plane. If the eros are placed close to the unit circle, we can image that the nearby frequencies will be lowered. FIR System

48 Example: The L-point Running- Sum Filter The system function is We have to represent it as rational form in. From geometric series,

49 Example: The L-point Running- Sum Filter The eros of H() will be determined by the roots of the numerator polynomial, The poles are determined by the denominator. There are (L-)-th roots at =0 and a root at =. So, the is a common location at = for both pole and ero; they are canceled. Hence, finally, the L-point runing-sum filter has L- eros and an (L-)th-order pole at the origin.

50 Example: The L-point Running- For instance, L=0 Sum Filter

51 Example: The L-point Running- Sum Filter The magnitude response: note that there are a total of 9 ero responses from [-, )

52 Recall: Ideal Low-pass Filter s frequency response

53 Passband In the above example of 0-point running sum filter, the passband is roughly centered at w=0. It acts lie a low-pass filter. Can we move the passband to other locations by re-placing eros, so that the filter acts lie some other frequency-selection filters?

54 Frequency-selection Filters: Ideal High-pass Filter

55 Ideal Band-pass Filter

56 Ideal Band-stop Filter

57 Bandpass Filter by Placing the Zeros of an FIR system We can move the passband to a frequency away from w=0 by changing the ero locations: The obvious way is to use all but one of the roots of unity as the eros of an FIR filter. Note that by specifying poles and eros, we completely describe the LTI system. L=0

58 Bandpass Filter by Placing the Zeros of an FIR system Frequency magnitude response:

59 Bandpass Filter with Real Coefficients However, the above filter have complex coefficients. By the symmetry property of DTFT, we now that the magnitude response should be an even function if we hope the coefficients are all real.

60 Practical Band Pass Filtering The above examples enable us a process of manipulating (adding, moving, removing) the eros interactively by using a simulation system (eg. Matlab) for filter design. We show a filter obtained by such an interactive design below, although much better filters can be deigned by more sophisticated methods. It is a useful illustration of the power of the - transform to simplify the analysis of such problems. The underlying reason is that the -transform coverts difficult problems involving convolution and frequency response into simple algebraic ideas based multiplying and factoring polynomials.

61 Practical Band Pass Filtering

62 Digital Filter Structures We now that there could be multiple ways to realie the system function of a difference equation. Z-transform is also useful in help characterie these solutions, and find an efficient implementation structure.

63 Digital Filter Structures (for IIR Filter) 0 N M y n a y n b x n M n x b n v 0 ] [ ] [ n v n y a n y N Direct Form I implementation

64 On the -domain or equivalently M N b a H H H 0 2 ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( 0 X b X H V M ) ( ) ( ) ( ) ( ) ( 2 V a V H Y N

65 By changing the order of H and H 2, onsider the equivalence on the -domain: where Let Then ) ( ) ( ) ( 2 H H H M b H 0 ) ( ) ( ) ( 2 N a H ) ( ) ( ) ( ) ( ) ( 2 X a X H W N ) ( ) ( ) ( ) ( 0 W b W H Y M

66 In the time domain, We have the following equivalence for implementation: N n x n w a n w ] [ ] [ ] [ M n w b n y 0 ] [ ] [ We assume M=N here

67 Note that the exactly the same signal, w[], is stored in the two chains of delay elements in the bloc diagram. The implementation can be further simplified as follows: Direct Form II (or Canonic Direct Form) implementation

68 By using the direct form II implementation, the number of delay elements is reduced from (M+N) to max(m,n). Example: H ( ) Direct form I implementation Direct form II implementation

69 Representing by signal-flow graph Example: the signal-flow graph of direct form II.

70 Example: H 2 2 ( )( ) ( ) ( 0.5 )( 0.25 ) Cascade structure: direct form I implementation Cascade structure: direct form II implementation

71 Cascade Form From the fundamental theorem of algebra, we now that an n-th order real-coefficient polynomial has n roots that are real or complex-conjugate pairs. From this theorem, it ensures that we can factor the numerator and denominator polynomials. We can express H() in the form: H M M 2 ( f ) ( ) N N 2 ( c ) ( ( g d )( )( g d ) ) where M=M +2M 2 and N=N +2N 2, g and g * are a complex conjugate pair of eros, and d and d * are a complex conjugate pair of poles.

72 A general form is where and we assume that MN. The real poles and eros have been combined in pairs. If there are an odd number of eros, one of the coefficients b 2 will be ero. s N a a b b b H ) ( 2 / ( ) N N s

73 It suggests that a difference equation can be implemented via the following structure consisting of a cascade of second-order and first-order systems: cascade form of implementation (with a direct form II realiation of each second-order subsystems)

74 Parallel Form We also now that a rational function can be represented as sum of partial fractions. If we represent H() by additions of low-order rational systems: where N=N +2N 2. If MN, then N p = MN. 2 0 ) )( ( ) ( ) ( N N N d d e B c A C H p

75 Parallel Form Alternatively, we may group the real poles in pairs, so that p N s N a a e e C H ) (

76 Illustration of parallel-form structure for six-order system (M=N=6) with the real and complex poles grouped in pairs.

77 Example: consider still the same system ) ( H

78 another alternation of the same system H ( ) Hence, given a system function, there are many ways to implement it. There are equivalent when infinite-precision arithmetic is used. However, their behavior with finiteprecision arithmetic could be quite different.

79 Remar: While the signal flow graph is an efficient way to represent a difference equation, not all of its instances are realiable: If a system function has poles, a corresponding signal flow graph will have feedbac loops. A signal flow graph is computable if all loops contain at least one unit delay element. Eg. A non-computable system Computable systems

80 Discrete Fourier Transform (DFT) Currently, we have investigated three cases of Fourier transform, Fourier series (for continuous periodic signal) Continuous Fourier transform (for continuous signal) Discrete-time Fourier transform (for discrete-time signal) All of them have infinite integral or summation in either time or frequency domains.

81 There is still another type of Fourier transform Consider a discrete sequence that is periodic in the time domain. Eg., it can be obtained by a periodic expansion of a finite-duration sequence, ie., we image that a finitelength sequence repeats, over and over again, in the time domain). Then, in the frequency domain, the spectrum shall be both periodic and discrete, ie, the frequency sequence is also made up of a finite-length sequence, which repeats over and over again in the frequency domain.

82 Discrete Fourier Transform Considering both the finite-length (or finite-duration) sequences in one period of the time and frequency domains, leads to a transform called discrete Fourier transform (DFT). In principle, DFT acts lie performing multiple (a ban of) FIR filters simultaneously at the same time.

83 DFT Definition If x[n] is a finite-length sequence (n0 only when n <N), its DTFT X(e jw ) is still a periodic continuous function with period 2. The DFT of x[n], denoted by X() is as follows: j 2 / N where, and W n are the roots of W N =. W e

84 Relation to DTFT for Finite-length sequence X() is the uniform samples of the DTFT X(e jw ) at the discrete frequency w = (2/N), when the frequency range [0, 2] is divided into N equally spaced points. Note that the above explains only the relation between DFT and DTFT for the simple case that x[n] is a finite-length sequence. We will investigate more in-depth relationships between DFT continuous FT (and also between DFT and DTFT) for length-unlimited sequences in the future.

85 From Kuhn 2005

86 From Kuhn 2005

87 Four types of Fourier Transforms Frequency domain nonperiodic Frequency domain periodic Time domain nonperiodic Continuous Fourier transform (both domains are continuous) DTFT (time domain discrete, frequency domain continuous and band-limited or periodic) Time domain periodic Fourier series (time domain continuous and periodic, frequency domain discrete) DFT/DTFS (time domain discrete, frequency domain discrete, and both finite-duration or periodic)

Let H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )

Let H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 ) Review: Poles and Zeros of Fractional Form Let H() = P()/Q() be the system function of a rational form. Let us represent both P() and Q() as polynomials of (not - ) Then Poles: the roots of Q()=0 Zeros:

More information

Linear Convolution Using FFT

Linear Convolution Using FFT Linear Convolution Using FFT Another useful property is that we can perform circular convolution and see how many points remain the same as those of linear convolution. When P < L and an L-point circular

More information

Digital 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 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 information

2. Typical Discrete-Time Systems All-Pass Systems (5.5) 2.2. Minimum-Phase Systems (5.6) 2.3. Generalized Linear-Phase Systems (5.

2. Typical Discrete-Time Systems All-Pass Systems (5.5) 2.2. Minimum-Phase Systems (5.6) 2.3. Generalized Linear-Phase Systems (5. . Typical Discrete-Time Systems.1. All-Pass Systems (5.5).. Minimum-Phase Systems (5.6).3. Generalized Linear-Phase Systems (5.7) .1. All-Pass Systems An all-pass system is defined as a system which has

More information

Lecture 19 IIR Filters

Lecture 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 information

UNIT-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).

UNIT-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 information

Generalizing the DTFT!

Generalizing the DTFT! The Transform Generaliing the DTFT! The forward DTFT is defined by X e jω ( ) = x n e jωn in which n= Ω is discrete-time radian frequency, a real variable. The quantity e jωn is then a complex sinusoid

More information

Interchange of Filtering and Downsampling/Upsampling

Interchange 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 information

ENT 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 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 information

Chapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals

Chapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals z Transform Chapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals (ii) Understanding the characteristics and properties

More information

Responses of Digital Filters Chapter Intended Learning Outcomes:

Responses of Digital Filters Chapter Intended Learning Outcomes: Responses of Digital Filters Chapter Intended Learning Outcomes: (i) Understanding the relationships between impulse response, frequency response, difference equation and transfer function in characterizing

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

/ (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 information

EE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley

EE123 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 information

Chapter 8 The Discrete Fourier Transform

Chapter 8 The Discrete Fourier Transform Chapter 8 The Discrete Fourier Transform Introduction Representation of periodic sequences: the discrete Fourier series Properties of the DFS The Fourier transform of periodic signals Sampling the Fourier

More information

Optimum Ordering and Pole-Zero Pairing of the Cascade Form IIR. Digital Filter

Optimum Ordering and Pole-Zero Pairing of the Cascade Form IIR. Digital Filter Optimum Ordering and Pole-Zero Pairing of the Cascade Form IIR Digital Filter There are many possible cascade realiations of a higher order IIR transfer function obtained by different pole-ero pairings

More information

Digital Signal Processing

Digital 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 information

Chapter 7: Filter Design 7.1 Practical Filter Terminology

Chapter 7: Filter Design 7.1 Practical Filter Terminology hapter 7: Filter Design 7. Practical Filter Terminology Analog and digital filters and their designs constitute one of the major emphasis areas in signal processing and communication systems. This is due

More information

(i) Represent discrete-time signals using transform. (ii) Understand the relationship between transform and discrete-time Fourier transform

(i) Represent discrete-time signals using transform. (ii) Understand the relationship between transform and discrete-time Fourier transform z Transform Chapter Intended Learning Outcomes: (i) Represent discrete-time signals using transform (ii) Understand the relationship between transform and discrete-time Fourier transform (iii) Understand

More information

Module 4 : Laplace and Z Transform Problem Set 4

Module 4 : Laplace and Z Transform Problem Set 4 Module 4 : Laplace and Z Transform Problem Set 4 Problem 1 The input x(t) and output y(t) of a causal LTI system are related to the block diagram representation shown in the figure. (a) Determine a differential

More information

Discrete-Time Signals and Systems. The z-transform and Its Application. The Direct z-transform. Region of Convergence. Reference: Sections

Discrete-Time Signals and Systems. The z-transform and Its Application. The Direct z-transform. Region of Convergence. Reference: Sections Discrete-Time Signals and Systems The z-transform and Its Application Dr. Deepa Kundur University of Toronto Reference: Sections 3. - 3.4 of John G. Proakis and Dimitris G. Manolakis, Digital Signal Processing:

More information

Use: Analysis of systems, simple convolution, shorthand for e jw, stability. Motivation easier to write. Or X(z) = Z {x(n)}

Use: Analysis of systems, simple convolution, shorthand for e jw, stability. Motivation easier to write. Or X(z) = Z {x(n)} 1 VI. Z Transform Ch 24 Use: Analysis of systems, simple convolution, shorthand for e jw, stability. A. Definition: X(z) = x(n) z z - transforms Motivation easier to write Or Note if X(z) = Z {x(n)} z

More information

LAB 6: FIR Filter Design Summer 2011

LAB 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 information

y[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)

y[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 information

Very useful for designing and analyzing signal processing systems

Very useful for designing and analyzing signal processing systems z-transform z-transform The z-transform generalizes the Discrete-Time Fourier Transform (DTFT) for analyzing infinite-length signals and systems Very useful for designing and analyzing signal processing

More information

Chapter 7: The z-transform

Chapter 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 information

Discrete-Time Fourier Transform (DTFT)

Discrete-Time Fourier Transform (DTFT) Discrete-Time Fourier Transform (DTFT) 1 Preliminaries Definition: The Discrete-Time Fourier Transform (DTFT) of a signal x[n] is defined to be X(e jω ) x[n]e jωn. (1) In other words, the DTFT of x[n]

More information

EEL3135: Homework #4

EEL3135: 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 information

Digital Signal Processing:

Digital Signal Processing: Digital Signal Processing: Mathematical and algorithmic manipulation of discretized and quantized or naturally digital signals in order to extract the most relevant and pertinent information that is carried

More information

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE) QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE) 1. For the signal shown in Fig. 1, find x(2t + 3). i. Fig. 1 2. What is the classification of the systems? 3. What are the Dirichlet s conditions of Fourier

More information

Stability Condition in Terms of the Pole Locations

Stability 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 information

DHANALAKSHMI 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 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 information

Chap 2. Discrete-Time Signals and Systems

Chap 2. Discrete-Time Signals and Systems Digital Signal Processing Chap 2. Discrete-Time Signals and Systems Chang-Su Kim Discrete-Time Signals CT Signal DT Signal Representation 0 4 1 1 1 2 3 Functional representation 1, n 1,3 x[ n] 4, n 2 0,

More information

EE123 Digital Signal Processing

EE123 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 information

Optimum Ordering and Pole-Zero Pairing. Optimum Ordering and Pole-Zero Pairing Consider the scaled cascade structure shown below

Optimum Ordering and Pole-Zero Pairing. Optimum Ordering and Pole-Zero Pairing Consider the scaled cascade structure shown below Pole-Zero Pairing of the Cascade Form IIR Digital Filter There are many possible cascade realiations of a higher order IIR transfer function obtained by different pole-ero pairings and ordering Each one

More information

Discrete-time Signals and Systems in

Discrete-time Signals and Systems in Discrete-time Signals and Systems in the Frequency Domain Chapter 3, Sections 3.1-39 3.9 Chapter 4, Sections 4.8-4.9 Dr. Iyad Jafar Outline Introduction The Continuous-Time FourierTransform (CTFT) The

More information

Discrete-Time Fourier Transform

Discrete-Time Fourier Transform C H A P T E R 7 Discrete-Time Fourier Transform In Chapter 3 and Appendix C, we showed that interesting continuous-time waveforms x(t) can be synthesized by summing sinusoids, or complex exponential signals,

More information

Review: Continuous Fourier Transform

Review: Continuous Fourier Transform Review: Continuous Fourier Transform Review: convolution x t h t = x τ h(t τ)dτ Convolution in time domain Derivation Convolution Property Interchange the order of integrals Let Convolution Property By

More information

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals SIGNALS AND SYSTEMS Unit IV Analysis of DT signals Contents: 4.1 Discrete Time Fourier Transform 4.2 Discrete Fourier Transform 4.3 Z Transform 4.4 Properties of Z Transform 4.5 Relationship between Z

More information

E : Lecture 1 Introduction

E : 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 information

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

Z - 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 information

Digital Signal Processing Lecture 4

Digital 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 information

LECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)

LECTURE 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 information

Discrete-time signals and systems

Discrete-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 information

z-transforms Definition of the z-transform Chapter

z-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 information

EE123 Digital Signal Processing

EE123 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 information

Discrete Time Systems

Discrete Time Systems Discrete Time Systems Valentina Hubeika, Jan Černocký DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz 1 LTI systems In this course, we work only with linear and time-invariant systems. We talked about

More information

Analog vs. discrete signals

Analog 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 information

Signals and Systems. Spring Room 324, Geology Palace, ,

Signals and Systems. Spring Room 324, Geology Palace, , Signals and Systems Spring 2013 Room 324, Geology Palace, 13756569051, zhukaiguang@jlu.edu.cn Chapter 10 The Z-Transform 1) Z-Transform 2) Properties of the ROC of the z-transform 3) Inverse z-transform

More information

Ch. 7: Z-transform Reading

Ch. 7: Z-transform Reading c J. Fessler, June 9, 3, 6:3 (student version) 7. Ch. 7: Z-transform Definition Properties linearity / superposition time shift convolution: y[n] =h[n] x[n] Y (z) =H(z) X(z) Inverse z-transform by coefficient

More information

Lecture 11 FIR Filters

Lecture 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 information

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE EEE 43 DIGITAL SIGNAL PROCESSING (DSP) 2 DIFFERENCE EQUATIONS AND THE Z- TRANSFORM FALL 22 Yrd. Doç. Dr. Didem Kivanc Tureli didemk@ieee.org didem.kivanc@okan.edu.tr

More information

# FIR. [ ] = b k. # [ ]x[ n " k] [ ] = h k. x[ n] = Ae j" e j# ˆ n Complex exponential input. [ ]Ae j" e j ˆ. ˆ )Ae j# e j ˆ. y n. y n.

# FIR. [ ] = b k. # [ ]x[ n  k] [ ] = h k. x[ n] = Ae j e j# ˆ n Complex exponential input. [ ]Ae j e j ˆ. ˆ )Ae j# e j ˆ. y n. y n. [ ] = h k M [ ] = b k x[ n " k] FIR k= M [ ]x[ n " k] convolution k= x[ n] = Ae j" e j ˆ n Complex exponential input [ ] = h k M % k= [ ]Ae j" e j ˆ % M = ' h[ k]e " j ˆ & k= k = H (" ˆ )Ae j e j ˆ ( )

More information

EE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley

EE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley University of California Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences Professors : N.Morgan / B.Gold EE225D Digital Filters Spring,1999 Lecture 7 N.MORGAN

More information

3.2 Complex Sinusoids and Frequency Response of LTI Systems

3.2 Complex Sinusoids and Frequency Response of LTI Systems 3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n]. LTI system: LTI System Output = A weighted superposition of the system response to each complex

More information

Review of Fundamentals of Digital Signal Processing

Review of Fundamentals of Digital Signal Processing Chapter 2 Review of Fundamentals of Digital Signal Processing 2.1 (a) This system is not linear (the constant term makes it non linear) but is shift-invariant (b) This system is linear but not shift-invariant

More information

Digital Signal Processing

Digital Signal Processing Digital Signal Processing The -Transform and Its Application to the Analysis of LTI Systems Moslem Amiri, Václav Přenosil Embedded Systems Laboratory Faculty of Informatics, Masaryk University Brno, Cech

More information

The Z-Transform. Fall 2012, EE123 Digital Signal Processing. Eigen Functions of LTI System. Eigen Functions of LTI System

The 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 information

Implementation of Discrete-Time Systems

Implementation of Discrete-Time Systems EEE443 Digital Signal Processing Implementation of Discrete-Time Systems Dr. Shahrel A. Suandi PPKEE, Engineering Campus, USM Introduction A linear-time invariant system (LTI) is described by linear constant

More information

Ch.11 The Discrete-Time Fourier Transform (DTFT)

Ch.11 The Discrete-Time Fourier Transform (DTFT) EE2S11 Signals and Systems, part 2 Ch.11 The Discrete-Time Fourier Transform (DTFT Contents definition of the DTFT relation to the -transform, region of convergence, stability frequency plots convolution

More information

Discrete-Time David Johns and Ken Martin University of Toronto

Discrete-Time David Johns and Ken Martin University of Toronto Discrete-Time David Johns and Ken Martin University of Toronto (johns@eecg.toronto.edu) (martin@eecg.toronto.edu) University of Toronto 1 of 40 Overview of Some Signal Spectra x c () t st () x s () t xn

More information

LTI Discrete-Time Systems in Transform Domain Ideal Filters Zero Phase Transfer Functions Linear Phase Transfer Functions

LTI Discrete-Time Systems in Transform Domain Ideal Filters Zero Phase Transfer Functions Linear Phase Transfer Functions LTI Discrete-Time Systems in Transform Domain Ideal Filters Zero Pase Transfer Functions Linear Pase Transfer Functions Tania Stataki 811b t.stataki@imperial.ac.uk Types of Transfer Functions Te time-domain

More information

University Question Paper Solution

University Question Paper Solution Unit 1: Introduction University Question Paper Solution 1. Determine whether the following systems are: i) Memoryless, ii) Stable iii) Causal iv) Linear and v) Time-invariant. i) y(n)= nx(n) ii) y(t)=

More information

Continuous Fourier transform of a Gaussian Function

Continuous Fourier transform of a Gaussian Function Continuous Fourier transform of a Gaussian Function Gaussian function: e t2 /(2σ 2 ) The CFT of a Gaussian function is also a Gaussian function (i.e., time domain is Gaussian, then the frequency domain

More information

Digital Signal Processing Lecture 3 - Discrete-Time Systems

Digital 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 information

Digital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung

Digital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung Digital Signal Processing, Homework, Spring 203, Prof. C.D. Chung. (0.5%) Page 99, Problem 2.2 (a) The impulse response h [n] of an LTI system is known to be zero, except in the interval N 0 n N. The input

More information

Computer Engineering 4TL4: Digital Signal Processing

Computer 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 information

Digital Signal Processing Lecture 9 - Design of Digital Filters - FIR

Digital Signal Processing Lecture 9 - Design of Digital Filters - FIR Digital Signal Processing - Design of Digital Filters - FIR Electrical Engineering and Computer Science University of Tennessee, Knoxville November 3, 2015 Overview 1 2 3 4 Roadmap Introduction Discrete-time

More information

The Discrete-Time Fourier

The Discrete-Time Fourier Chapter 3 The Discrete-Time Fourier Transform 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 3-1-1 Continuous-Time Fourier Transform Definition The CTFT of

More information

Review of Discrete-Time System

Review of Discrete-Time System Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.

More information

Transform analysis of LTI systems Oppenheim and Schafer, Second edition pp For LTI systems we can write

Transform analysis of LTI systems Oppenheim and Schafer, Second edition pp For LTI systems we can write Transform analysis of LTI systems Oppenheim and Schafer, Second edition pp. 4 9. For LTI systems we can write yœn D xœn hœn D X kd xœkhœn Alternatively, this relationship can be expressed in the z-transform

More information

Theory and Problems of Signals and Systems

Theory and Problems of Signals and Systems SCHAUM'S OUTLINES OF Theory and Problems of Signals and Systems HWEI P. HSU is Professor of Electrical Engineering at Fairleigh Dickinson University. He received his B.S. from National Taiwan University

More information

UNIT - III PART A. 2. Mention any two techniques for digitizing the transfer function of an analog filter?

UNIT - III PART A. 2. Mention any two techniques for digitizing the transfer function of an analog filter? UNIT - III PART A. Mention the important features of the IIR filters? i) The physically realizable IIR filters does not have linear phase. ii) The IIR filter specification includes the desired characteristics

More information

Fourier Series Representation of

Fourier Series Representation of Fourier Series Representation of Periodic Signals Rui Wang, Assistant professor Dept. of Information and Communication Tongji University it Email: ruiwang@tongji.edu.cn Outline The response of LIT system

More information

Z-Transform. 清大電機系林嘉文 Original PowerPoint slides prepared by S. K. Mitra 4-1-1

Z-Transform. 清大電機系林嘉文 Original PowerPoint slides prepared by S. K. Mitra 4-1-1 Chapter 6 Z-Transform 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 4-1-1 z-transform The DTFT provides a frequency-domain representation of discrete-time

More information

Discrete Time Fourier Transform (DTFT)

Discrete 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 information

The Continuous-time Fourier

The Continuous-time Fourier The Continuous-time Fourier Transform Rui Wang, Assistant professor Dept. of Information and Communication Tongji University it Email: ruiwang@tongji.edu.cn Outline Representation of Aperiodic signals:

More information

Lecture 7 - IIR Filters

Lecture 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 information

The Discrete-time Fourier Transform

The Discrete-time Fourier Transform The Discrete-time Fourier Transform Rui Wang, Assistant professor Dept. of Information and Communication Tongji University it Email: ruiwang@tongji.edu.cn Outline Representation of Aperiodic signals: The

More information

Chirp Transform for FFT

Chirp 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 information

III. Time Domain Analysis of systems

III. Time Domain Analysis of systems 1 III. Time Domain Analysis of systems Here, we adapt properties of continuous time systems to discrete time systems Section 2.2-2.5, pp 17-39 System Notation y(n) = T[ x(n) ] A. Types of Systems Memoryless

More information

Review of Fundamentals of Digital Signal Processing

Review of Fundamentals of Digital Signal Processing Solution Manual for Theory and Applications of Digital Speech Processing by Lawrence Rabiner and Ronald Schafer Click here to Purchase full Solution Manual at http://solutionmanuals.info Link download

More information

信號與系統 Signals and Systems

信號與系統 Signals and Systems Spring 2013 Flowchart Introduction (Chap 1) LTI & Convolution (Chap 2) NTUEE-SS10-Z-2 信號與系統 Signals and Systems Chapter SS-10 The z-transform FS (Chap 3) Periodic Bounded/Convergent CT DT FT Aperiodic

More information

EECE 301 Signals & Systems Prof. Mark Fowler

EECE 301 Signals & Systems Prof. Mark Fowler EECE 30 Signals & Systems Prof. Mark Fowler Note Set #26 D-T Systems: Transfer Function and Frequency Response / Finding the Transfer Function from Difference Eq. Recall: we found a DT system s freq. resp.

More information

VU Signal and Image Processing

VU Signal and Image Processing 052600 VU Signal and Image Processing Torsten Möller + Hrvoje Bogunović + Raphael Sahann torsten.moeller@univie.ac.at hrvoje.bogunovic@meduniwien.ac.at raphael.sahann@univie.ac.at vda.cs.univie.ac.at/teaching/sip/18s/

More information

Need for transformation?

Need for transformation? Z-TRANSFORM In today s class Z-transform Unilateral Z-transform Bilateral Z-transform Region of Convergence Inverse Z-transform Power Series method Partial Fraction method Solution of difference equations

More information

Z-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) = 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 information

Chapter 6: The Laplace Transform. Chih-Wei Liu

Chapter 6: The Laplace Transform. Chih-Wei Liu Chapter 6: The Laplace Transform Chih-Wei Liu Outline Introduction The Laplace Transform The Unilateral Laplace Transform Properties of the Unilateral Laplace Transform Inversion of the Unilateral Laplace

More information

Digital Signal Processing Lecture 5

Digital 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 information

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Digital Signal Processing Lecture 10 - Discrete Fourier Transform Digital Signal Processing - Discrete Fourier Transform Electrical Engineering and Computer Science University of Tennessee, Knoxville November 12, 2015 Overview 1 2 3 4 Review - 1 Introduction Discrete-time

More information

z-transform Chapter 6

z-transform Chapter 6 z-transform Chapter 6 Dr. Iyad djafar Outline 2 Definition Relation Between z-transform and DTFT Region of Convergence Common z-transform Pairs The Rational z-transform The Inverse z-transform z-transform

More information

EE 521: Instrumentation and Measurements

EE 521: Instrumentation and Measurements Aly El-Osery Electrical Engineering Department, New Mexico Tech Socorro, New Mexico, USA November 1, 2009 1 / 27 1 The z-transform 2 Linear Time-Invariant System 3 Filter Design IIR Filters FIR Filters

More information

Question Paper Code : AEC11T02

Question Paper Code : AEC11T02 Hall Ticket No Question Paper Code : AEC11T02 VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad Four Year B. Tech III Semester Tutorial Question Bank 2013-14 (Regulations: VCE-R11)

More information

DISCRETE-TIME SIGNAL PROCESSING

DISCRETE-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 information

7.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.

7.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 information

A system that is both linear and time-invariant is called linear time-invariant (LTI).

A system that is both linear and time-invariant is called linear time-invariant (LTI). The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Lecture Notes: Time, Frequency & Transform Domains February 28, 2012 Signals & Systems Signals are mapped

More information

EE 225a Digital Signal Processing Supplementary Material

EE 225a Digital Signal Processing Supplementary Material EE 225A DIGITAL SIGAL PROCESSIG SUPPLEMETARY MATERIAL EE 225a Digital Signal Processing Supplementary Material. Allpass Sequences A sequence h a ( n) ote that this is true iff which in turn is true iff

More information

VII. Discrete Fourier Transform (DFT) Chapter-8. A. Modulo Arithmetic. (n) N is n modulo N, n is an integer variable.

VII. Discrete Fourier Transform (DFT) Chapter-8. A. Modulo Arithmetic. (n) N is n modulo N, n is an integer variable. 1 VII. Discrete Fourier Transform (DFT) Chapter-8 A. Modulo Arithmetic (n) N is n modulo N, n is an integer variable. (n) N = n m N 0 n m N N-1, pick m Ex. (k) 4 W N = e -j2π/n 2 Note that W N k = 0 but

More information

DISCRETE FOURIER TRANSFORM

DISCRETE FOURIER TRANSFORM DISCRETE FOURIER TRANSFORM 1. Introduction The sampled discrete-time fourier transform (DTFT) of a finite length, discrete-time signal is known as the discrete Fourier transform (DFT). The DFT contains

More 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. 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 information

IT DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A

IT 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 information