Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is

Size: px
Start display at page:

Download "Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is"

Transcription

1 Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section 5. 3 The (DT) Fourier transform (or spectrum) of x[n] is X ( e jω) = n= x[n]e jωn x[n] can be reconstructed from its spectrum using the inverse Fourier transform x[n] = X ( e jω) e jωn dω The above two equations are referred to as the analysis equation and the synthesis equation respectively. 3 These slides are based on lecture notes of Professors L. Lampe, C. Leung, and R. Schober SM 38

2 Notation: X ( e jω) = F{x[n]} x[n] = F {X ( e jω) } x[n] and X ( e jω) form a Fourier transform pair, denoted by x[n] X ( e jω) Main differences from CTFT. X ( e jω) is periodic with period since e jωn is periodic in ω with period. 2. As a result of the above-mentioned periodicity, the integration for the synthesis equation is over a finite interval (of length ). SM 39

3 Example: Determine the DTFT of h[n] = a n u[n], a <. Then, H ( e jω) = = = n= n= a n e jωn ( a e jω ) n a e jω Hence, H ( e jω) = = ( acosω)2 +(asinω) 2 2acosω +a 2 A plot of H ( e jω) for a =.5 is shown in the figure below. SM 4

4 H e jω ( ) = 2 a π Since H ( e jω) = and = = = + a a e jω a ejω a e jω a e jω a e jω 2acosω +a 2 a e jω = acosω jasinω π ω we have H ( e jω) asinω = tan acosω SM 4

5 Example: Determine the DTFT of the rectangular pulse x[n] = {, n N, otherwise. Then, X ( e jω) = = N e jωn n= N 2N e jω(m N) m= (using m = n+n) = ejωn ( e jω(2n+)) e jω = e jωn e jω(n+ 2 ) { e jω(n+ 2 ) e jω(n+ 2 ) } e jω 2 { e j ω 2 e jω 2} {e jω(n+ 2 ) e jω(n+ 2 ) } = { e j ω 2 e jω 2} SM 42

6 = 2jsin[ ω ( )] N + 2 2jsin[ω/2] = sin[ ω ( )] N + 2 sin[ω/2] For N =, X ( e jω) = sin[ ω + ω 2 sin [ ] ω 2 = sinωcos ω 2 +cosωsin ω 2 sin ω 2 ] = 2sin ω 2 cos ω 2 cos ω 2 +cosωsin ω 2 sin ω 2 = 2cos 2 ω 2 +cosω = +2cosω Sketch X ( e jω) for N = in the figure below. SM 43

7 x[ n] n X( e jω ) 3 2 π π ω DTFT convergence issues Recall the DTFT analysis and synthesis equations X ( e jω) = n= x[n]e jωn (4) x[n] = X ( e jω) e jωn dω (5) SM 44

8 The analysis equation (4) contains an infinite sum. Sufficient conditions to guarantee convergence are: () x[n] is absolutely summable, i.e. n= x[n] < or (2) x[n] has finite energy, i.e. n= x[n] 2 < There are no convergence issues associated with the synthesis equation (5) since the integral is over a finite interval. For example, unlike the CTFT case, the Gibbs phenomenon is absent when (5) is used. SM 45

9 DTFT for periodic signals Section 5.2 Similar to the CT case, we can express the FT of DT periodic signals in terms of impulses. It can be shown (see (5.9) and (5.2) in textbook) that if the DT periodic signal x[n] of fundamental period N has as DTFS coefficients a k, i.e. x[n] = k=<n> a k e jk ( N)n then X ( e jω) = k= a k δ ( ω k ). (6) N Furthermore, if we define x[n] as one basic period of x[n], it can be shown that a k = N X (e jk N ). SM 46

10 In words, (6) states that the DTFT of x[n] is a sequence of impulses located at multiples of the fundamental frequency N ; the strength of the impulse located at ω = k N is a k. Example: x[n] = cos(ω n), where ω = 3. cos-----n n { cosω n} π ω ω ω cosω n = 2 ejω n + 2 e jω n SM 47

11 Fact: e jω n l= δ(ω ω l) Proof: The inverse DTFT of the RHS is = l= = e jω n. l= [ δ(ω ω l)e jωn dω ] δ(ω ω l)e jωn dω The last line follows since only one impulse is included in any interval of length. Hence, cos 3 n π + l= l= δ (ω 3 ) l δ (ω + 3 ) l SM 48

12 Exercise: Show that sin 3 n π j δ (ω 3 ) l l= δ (ω + 3 ) l l= Plot sin ( 3 n) and its DTFT in the figures below. sin----- n n { sin ω n} ω ω ω SM 49

13 Example: Determine the DTFT of the impulse train x[n] = k= δ[n kn]. Then, a k = N n=<n> x[n] e jk ( N)n = N and from (6), we have X ( e jω) = N k= δ ( ω k ). N SM 5

14 Some properties of the DTFT Sections Periodicity Section 5.3. The DTFT is always periodic in ω with period, i.e. X (e j(ω+)) = X ( e jω) In contrast, the CTFT is not generally periodic. 2. Linearity Section similar to CTFT Let x[n] X ( e jω), y[n] Y ( e jω). Then, Z z[n] = ax[n] + by[n] ( e jω) ( = ax e jω) + by (e jω) SM 5

15 Proof: follows directly from the defn. of the DTFT. Example: What is the DTFT of the signal, z[n], shown below? z[ n] n SM 52

16 3. Time-shift Section similar to CTFT If x[n] X ( e jω), then Proof: x[n N] e jωn X ( e jω). Note that when a signal is delayed by N, the spectrum amplitude is unchanged whereas the spectrum phase is changed by ωn. SM 53

17 Example: What are the DTFT s of the signals shown below? x [ n] n x 2 [ n] n SM 54

18 4. Conjugation Section similar to CTFT If x[n] X ( e jω), then Proof: x [n] X ( e jω). As a result, if x[n] is real, we have X ( e jω) = X ( e jω) i.e., the spectrum magnitude is an even function of ω and the spectrum phase is an odd function of ω. SM 55

19 5. Differencing and Accumulation Section Differencing: Using the linearity and timeshift properties, if x[n] X ( e jω), then the DTFT of the first difference signal is given by x[n] x[n ] ( e jω) X ( e jω). Accumulation: Let y[n] = n m= x[m]. Then, Y ( e jω) = X( e jω) e jω +πx ( e j) k= δ(ω k). SM 56

20 Example: Determine the DTFT of the unit step sequence u[n] = {, n <, n. u[ n] n SM 57

21 6. Parseval s relation Section similar to CTFT If x[n] X ( e jω), then n= x[n] 2 = X ( e jω) 2 dω. (7) The LHS of (7) represents the total energy in the signal x[n]. The integrand, X ( e jω) 2, in the RHS is the energy density spectrum of x[n]. SM 58

22 7. Convolution Section 5.4 similar to CTFT If y[n] = x[n] h[n] then Y ( e jω) = X ( e jω) H ( e jω). Proof: SM 59

23 Example: Determine the convolution of the DT signals x[n] and h[n] shown below. x[ n] h[ n] n n SM 6

24 8. Multiplication Section 5.5 If y[n] = a[n]b[n] then Y ( e jω) = A ( e jθ) B ( e j(ω θ)) dθ. The RHS of the previous equation is referred to as the periodic convolution of A ( e jω) and B ( e jω). Proof: SM 6

Complex symmetry Signals and Systems Fall 2015

Complex symmetry Signals and Systems Fall 2015 18-90 Signals and Systems Fall 015 Complex symmetry 1. Complex symmetry This section deals with the complex symmetry property. As an example I will use the DTFT for a aperiodic discrete-time signal. The

More information

Definition of Discrete-Time Fourier Transform (DTFT)

Definition of Discrete-Time Fourier Transform (DTFT) Definition of Discrete-Time ourier Transform (DTT) {x[n]} = X(e jω ) + n= {X(e jω )} = x[n] x[n]e jωn Why use the above awkward notation for the transform? X(e jω )e jωn dω Answer: It is consistent with

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

Discrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz

Discrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz Discrete Time Signals and Systems Time-frequency Analysis Gloria Menegaz Time-frequency Analysis Fourier transform (1D and 2D) Reference textbook: Discrete time signal processing, A.W. Oppenheim and R.W.

More information

Discrete Time Fourier Transform

Discrete Time Fourier Transform Discrete Time Fourier Transform Recall that we wrote the sampled signal x s (t) = x(kt)δ(t kt). We calculate its Fourier Transform. We do the following: Ex. Find the Continuous Time Fourier Transform of

More information

Overview of Discrete-Time Fourier Transform Topics Handy Equations Handy Limits Orthogonality Defined orthogonal

Overview of Discrete-Time Fourier Transform Topics Handy Equations Handy Limits Orthogonality Defined orthogonal Overview of Discrete-Time Fourier Transform Topics Handy equations and its Definition Low- and high- discrete-time frequencies Convergence issues DTFT of complex and real sinusoids Relationship to LTI

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

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

Fourier transform representation of CT aperiodic signals Section 4.1

Fourier transform representation of CT aperiodic signals Section 4.1 Fourier transform representation of CT aperiodic signals Section 4. A large class of aperiodic CT signals can be represented by the CT Fourier transform (CTFT). The (CT) Fourier transform (or spectrum)

More information

Signals and Systems Spring 2004 Lecture #9

Signals and Systems Spring 2004 Lecture #9 Signals and Systems Spring 2004 Lecture #9 (3/4/04). The convolution Property of the CTFT 2. Frequency Response and LTI Systems Revisited 3. Multiplication Property and Parseval s Relation 4. The DT Fourier

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

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

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

ECE-314 Fall 2012 Review Questions for Midterm Examination II

ECE-314 Fall 2012 Review Questions for Midterm Examination II ECE-314 Fall 2012 Review Questions for Midterm Examination II First, make sure you study all the problems and their solutions from homework sets 4-7. Then work on the following additional problems. Problem

More information

Discrete Fourier Transform

Discrete Fourier Transform Discrete Fourier Transform Virtually all practical signals have finite length (e.g., sensor data, audio records, digital images, stock values, etc). Rather than considering such signals to be zero-padded

More information

EE 224 Signals and Systems I Review 1/10

EE 224 Signals and Systems I Review 1/10 EE 224 Signals and Systems I Review 1/10 Class Contents Signals and Systems Continuous-Time and Discrete-Time Time-Domain and Frequency Domain (all these dimensions are tightly coupled) SIGNALS SYSTEMS

More information

Lecture 13: Discrete Time Fourier Transform (DTFT)

Lecture 13: Discrete Time Fourier Transform (DTFT) Lecture 13: Discrete Time Fourier Transform (DTFT) ECE 401: Signal and Image Analysis University of Illinois 3/9/2017 1 Sampled Systems Review 2 DTFT and Convolution 3 Inverse DTFT 4 Ideal Lowpass Filter

More information

DSP Laboratory (EELE 4110) Lab#5 DTFS & DTFT

DSP Laboratory (EELE 4110) Lab#5 DTFS & DTFT Islamic University of Gaza Faculty of Engineering Electrical Engineering Department EG.MOHAMMED ELASMER Spring-22 DSP Laboratory (EELE 4) Lab#5 DTFS & DTFT Discrete-Time Fourier Series (DTFS) The discrete-time

More information

Frequency-Domain C/S of LTI Systems

Frequency-Domain C/S of LTI Systems Frequency-Domain C/S of LTI Systems x(n) LTI y(n) LTI: Linear Time-Invariant system h(n), the impulse response of an LTI systems describes the time domain c/s. H(ω), the frequency response describes the

More information

ECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3

ECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3 ECE 30 Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3 Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out

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

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions 8-90 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 08 Midterm Solutions Name: Andrew ID: Problem Score Max 8 5 3 6 4 7 5 8 6 7 6 8 6 9 0 0 Total 00 Midterm Solutions. (8 points) Indicate whether

More information

Table 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients

Table 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients able : Properties of the Continuous-ime Fourier Series x(t = e jkω0t = = x(te jkω0t dt = e jk(/t x(te jk(/t dt Property Periodic Signal Fourier Series Coefficients x(t y(t } Periodic with period and fundamental

More information

8 The Discrete Fourier Transform (DFT)

8 The Discrete Fourier Transform (DFT) 8 The Discrete Fourier Transform (DFT) ² Discrete-Time Fourier Transform and Z-transform are de ned over in niteduration sequence. Both transforms are functions of continuous variables (ω and z). For nite-duration

More information

EC Signals and Systems

EC Signals and Systems UNIT I CLASSIFICATION OF SIGNALS AND SYSTEMS Continuous time signals (CT signals), discrete time signals (DT signals) Step, Ramp, Pulse, Impulse, Exponential 1. Define Unit Impulse Signal [M/J 1], [M/J

More information

Lecture 19: Discrete Fourier Series

Lecture 19: Discrete Fourier Series EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 19: Discrete Fourier Series Dec 5, 2001 Prof: J. Bilmes TA: Mingzhou

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

Multimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2

Multimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2 Multimedia Signals and Systems - Audio and Video Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2 Kunio Takaya Electrical and Computer Engineering University of Saskatchewan December

More information

DSP-I DSP-I DSP-I DSP-I

DSP-I DSP-I DSP-I DSP-I NOTES FOR 8-79 LECTURES 3 and 4 Introduction to Discrete-Time Fourier Transforms (DTFTs Distributed: September 8, 2005 Notes: This handout contains in brief outline form the lecture notes used for 8-79

More information

Table 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients

Table 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients able : Properties of the Continuous-ime Fourier Series x(t = a k e jkω0t = a k = x(te jkω0t dt = a k e jk(/t x(te jk(/t dt Property Periodic Signal Fourier Series Coefficients x(t y(t } Periodic with period

More information

-Digital Signal Processing- FIR Filter Design. Lecture May-16

-Digital Signal Processing- FIR Filter Design. Lecture May-16 -Digital Signal Processing- FIR Filter Design Lecture-17 24-May-16 FIR Filter Design! FIR filters can also be designed from a frequency response specification.! The equivalent sampled impulse response

More information

6.003 Signal Processing

6.003 Signal Processing 6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal

More information

Ch 4: The Continuous-Time Fourier Transform

Ch 4: The Continuous-Time Fourier Transform Ch 4: The Continuous-Time Fourier Transform Fourier Transform of x(t) Inverse Fourier Transform jt X ( j) x ( t ) e dt jt x ( t ) X ( j) e d 2 Ghulam Muhammad, King Saud University Continuous-time aperiodic

More information

5.1 The Discrete Time Fourier Transform

5.1 The Discrete Time Fourier Transform 32 33 5 The Discrete Time ourier Transform ourier (or frequency domain) analysis the last Complete the introduction and the development of the methods of ourier analysis Learn frequency-domain methods

More information

Signals & Systems. Lecture 5 Continuous-Time Fourier Transform. Alp Ertürk

Signals & Systems. Lecture 5 Continuous-Time Fourier Transform. Alp Ertürk Signals & Systems Lecture 5 Continuous-Time Fourier Transform Alp Ertürk alp.erturk@kocaeli.edu.tr Fourier Series Representation of Continuous-Time Periodic Signals Synthesis equation: x t = a k e jkω

More information

6.003 Signal Processing

6.003 Signal Processing 6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal

More information

Lecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.

Lecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. Lecture 10 Digital Signal Processing Chapter 7 Discrete Fourier transform DFT Mikael Swartling Nedelko Grbic Bengt Mandersson rev. 016 Department of Electrical and Information Technology Lund University

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

Aspects of Continuous- and Discrete-Time Signals and Systems

Aspects of Continuous- and Discrete-Time Signals and Systems Aspects of Continuous- and Discrete-Time Signals and Systems C.S. Ramalingam Department of Electrical Engineering IIT Madras C.S. Ramalingam (EE Dept., IIT Madras) Networks and Systems 1 / 45 Scaling the

More information

Digital Signal Processing. Midterm 1 Solution

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

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

PS403 - Digital Signal processing

PS403 - Digital Signal processing PS403 - Digital Signal processing III. DSP - Digital Fourier Series and Transforms Key Text: Digital Signal Processing with Computer Applications (2 nd Ed.) Paul A Lynn and Wolfgang Fuerst, (Publisher:

More information

x[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn

x[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn Sampling Let x a (t) be a continuous time signal. The signal is sampled by taking the signal value at intervals of time T to get The signal x(t) has a Fourier transform x[n] = x a (nt ) X a (Ω) = x a (t)e

More information

Signals and Systems. Problem Set: The z-transform and DT Fourier Transform

Signals and Systems. Problem Set: The z-transform and DT Fourier Transform Signals and Systems Problem Set: The z-transform and DT Fourier Transform Updated: October 9, 7 Problem Set Problem - Transfer functions in MATLAB A discrete-time, causal LTI system is described by the

More information

Discrete Fourier transform (DFT)

Discrete Fourier transform (DFT) Discrete Fourier transform (DFT) Signal Processing 2008/9 LEA Instituto Superior Técnico Signal Processing LEA (IST) Discrete Fourier transform 1 / 34 Periodic signals Consider a periodic signal x[n] with

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 4 The Fourier Series and Fourier Transform

Chapter 4 The Fourier Series and Fourier Transform Chapter 4 The Fourier Series and Fourier Transform Representation of Signals in Terms of Frequency Components Consider the CT signal defined by N xt () = Acos( ω t+ θ ), t k = 1 k k k The frequencies `present

More information

Chapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter

Chapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter Chapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter Objec@ves 1. Learn techniques for represen3ng discrete-)me periodic signals using orthogonal sets of periodic basis func3ons. 2.

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

Chapter 4 The Fourier Series and Fourier Transform

Chapter 4 The Fourier Series and Fourier Transform Chapter 4 The Fourier Series and Fourier Transform Fourier Series Representation of Periodic Signals Let x(t) be a CT periodic signal with period T, i.e., xt ( + T) = xt ( ), t R Example: the rectangular

More information

Signals and Systems Lecture 8: Z Transform

Signals and Systems Lecture 8: Z Transform Signals and Systems Lecture 8: Z Transform Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Winter 2012 Farzaneh Abdollahi Signal and Systems Lecture 8 1/29 Introduction

More information

Discrete Time Systems

Discrete Time Systems 1 Discrete Time Systems {x[0], x[1], x[2], } H {y[0], y[1], y[2], } Example: y[n] = 2x[n] + 3x[n-1] + 4x[n-2] 2 FIR and IIR Systems FIR: Finite Impulse Response -- non-recursive y[n] = 2x[n] + 3x[n-1]

More information

Your solutions for time-domain waveforms should all be expressed as real-valued functions.

Your solutions for time-domain waveforms should all be expressed as real-valued functions. ECE-486 Test 2, Feb 23, 2017 2 Hours; Closed book; Allowed calculator models: (a) Casio fx-115 models (b) HP33s and HP 35s (c) TI-30X and TI-36X models. Calculators not included in this list are not permitted.

More information

6.003 Homework #10 Solutions

6.003 Homework #10 Solutions 6.3 Homework # Solutions Problems. DT Fourier Series Determine the Fourier Series coefficients for each of the following DT signals, which are periodic in N = 8. x [n] / n x [n] n x 3 [n] n x 4 [n] / n

More information

Fourier Analysis Overview (0B)

Fourier Analysis Overview (0B) CTFS: Continuous Time Fourier Series CTFT: Continuous Time Fourier Transform DTFS: Fourier Series DTFT: Fourier Transform DFT: Discrete Fourier Transform Copyright (c) 2009-2016 Young W. Lim. Permission

More information

ECE 301 Division 1, Fall 2008 Instructor: Mimi Boutin Final Examination Instructions:

ECE 301 Division 1, Fall 2008 Instructor: Mimi Boutin Final Examination Instructions: ECE 30 Division, all 2008 Instructor: Mimi Boutin inal Examination Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out the requested

More information

Homework 8 Solutions

Homework 8 Solutions EE264 Dec 3, 2004 Fall 04 05 HO#27 Problem Interpolation (5 points) Homework 8 Solutions 30 points total Ω = 2π/T f(t) = sin( Ω 0 t) T f (t) DAC ˆf(t) interpolated output In this problem I ll use the notation

More information

EEE4001F EXAM DIGITAL SIGNAL PROCESSING. University of Cape Town Department of Electrical Engineering PART A. June hours.

EEE4001F EXAM DIGITAL SIGNAL PROCESSING. University of Cape Town Department of Electrical Engineering PART A. June hours. EEE400F EXAM DIGITAL SIGNAL PROCESSING PART A Basic digital signal processing theory.. A sequencex[n] has a zero-phase DTFT X(e jω ) given below: X(e jω ) University of Cape Town Department of Electrical

More information

Signals & Systems Handout #4

Signals & Systems Handout #4 Signals & Systems Handout #4 H-4. Elementary Discrete-Domain Functions (Sequences): Discrete-domain functions are defined for n Z. H-4.. Sequence Notation: We use the following notation to indicate the

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

ECE 301 Division 1, Fall 2006 Instructor: Mimi Boutin Final Examination

ECE 301 Division 1, Fall 2006 Instructor: Mimi Boutin Final Examination ECE 30 Division, all 2006 Instructor: Mimi Boutin inal Examination Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out the requested

More information

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything. UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 9th, 011 Examination hours: 14.30 18.30 This problem set

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

Fourier Analysis and Spectral Representation of Signals

Fourier Analysis and Spectral Representation of Signals MIT 6.02 DRAFT Lecture Notes Last update: April 11, 2012 Comments, questions or bug reports? Please contact verghese at mit.edu CHAPTER 13 Fourier Analysis and Spectral Representation of Signals We have

More information

信號與系統 Signals and Systems

信號與系統 Signals and Systems Spring 2011 信號與系統 Signals and Systems Chapter SS-4 The Continuous-Time Fourier Transform Feng-Li Lian NTU-EE Feb11 Jun11 Figures and images used in these lecture notes are adopted from Signals & Systems

More information

Grades will be determined by the correctness of your answers (explanations are not required).

Grades will be determined by the correctness of your answers (explanations are not required). 6.00 (Fall 20) Final Examination December 9, 20 Name: Kerberos Username: Please circle your section number: Section Time 2 am pm 4 2 pm Grades will be determined by the correctness of your answers (explanations

More information

Lecture 4: FT Pairs, Random Signals and z-transform

Lecture 4: FT Pairs, Random Signals and z-transform EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 4: T Pairs, Rom Signals z-transform Wed., Oct. 10, 2001 Prof: J. Bilmes

More information

TTT4120 Digital Signal Processing Suggested Solutions for Problem Set 2

TTT4120 Digital Signal Processing Suggested Solutions for Problem Set 2 Norwegian University of Science and Technology Department of Electronics and Telecommunications TTT42 Digital Signal Processing Suggested Solutions for Problem Set 2 Problem (a) The spectrum X(ω) can be

More information

Flash File. Module 3 : Sampling and Reconstruction Lecture 28 : Discrete time Fourier transform and its Properties. Objectives: Scope of this Lecture:

Flash File. Module 3 : Sampling and Reconstruction Lecture 28 : Discrete time Fourier transform and its Properties. Objectives: Scope of this Lecture: Module 3 : Sampling and Reconstruction Lecture 28 : Discrete time Fourier transform and its Properties Objectives: Scope of this Lecture: In the previous lecture we defined digital signal processing and

More 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

ECE 301. Division 3, Fall 2007 Instructor: Mimi Boutin Midterm Examination 3

ECE 301. Division 3, Fall 2007 Instructor: Mimi Boutin Midterm Examination 3 ECE 30 Division 3, all 2007 Instructor: Mimi Boutin Midterm Examination 3 Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out

More information

Continuous-Time Fourier Transform

Continuous-Time Fourier Transform Signals and Systems Continuous-Time Fourier Transform Chang-Su Kim continuous time discrete time periodic (series) CTFS DTFS aperiodic (transform) CTFT DTFT Lowpass Filtering Blurring or Smoothing Original

More information

EE 438 Essential Definitions and Relations

EE 438 Essential Definitions and Relations May 2004 EE 438 Essential Definitions and Relations CT Metrics. Energy E x = x(t) 2 dt 2. Power P x = lim T 2T T / 2 T / 2 x(t) 2 dt 3. root mean squared value x rms = P x 4. Area A x = x(t) dt 5. Average

More information

Ver 3808 E1.10 Fourier Series and Transforms (2014) E1.10 Fourier Series and Transforms. Problem Sheet 1 (Lecture 1)

Ver 3808 E1.10 Fourier Series and Transforms (2014) E1.10 Fourier Series and Transforms. Problem Sheet 1 (Lecture 1) Ver 88 E. Fourier Series and Transforms 4 Key: [A] easy... [E]hard Questions from RBH textbook: 4., 4.8. E. Fourier Series and Transforms Problem Sheet Lecture. [B] Using the geometric progression formula,

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

6.003: Signals and Systems

6.003: Signals and Systems 6.003: Signals and Sysems Relaions among Fourier Represenaions November 5, 20 Mid-erm Examinaion #3 Wednesday, November 6, 7:30-9:30pm, No reciaions on he day of he exam. Coverage: Lecures 8 Reciaions

More information

Sinc Functions. Continuous-Time Rectangular Pulse

Sinc Functions. Continuous-Time Rectangular Pulse Sinc Functions The Cooper Union Department of Electrical Engineering ECE114 Digital Signal Processing Lecture Notes: Sinc Functions and Sampling Theory October 7, 2011 A rectangular pulse in time/frequency

More information

X (z) = n= 1. Ã! X (z) x [n] X (z) = Z fx [n]g x [n] = Z 1 fx (z)g. r n x [n] ª e jnω

X (z) = n= 1. Ã! X (z) x [n] X (z) = Z fx [n]g x [n] = Z 1 fx (z)g. r n x [n] ª e jnω 3 The z-transform ² Two advantages with the z-transform:. The z-transform is a generalization of the Fourier transform for discrete-time signals; which encompasses a broader class of sequences. The z-transform

More information

6.003: Signals and Systems. Relations among Fourier Representations

6.003: Signals and Systems. Relations among Fourier Representations 6.003: Signals and Sysems Relaions among Fourier Represenaions April 22, 200 Mid-erm Examinaion #3 W ednesday, April 28, 7:30-9:30pm. No reciaions on he day of he exam. Coverage: Lecures 20 Reciaions 20

More information

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fourier Series & Transform Summary x[n] = X[k] = 1 N k= n= X[k]e jkω

More information

Fourier Representations of Signals & LTI Systems

Fourier Representations of Signals & LTI Systems 3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n] 2. LTI system: LTI System Output = A weighted superposition of the system response to each complex

More information

ECE-700 Review. Phil Schniter. January 5, x c (t)e jωt dt, x[n]z n, Denoting a transform pair by x[n] X(z), some useful properties are

ECE-700 Review. Phil Schniter. January 5, x c (t)e jωt dt, x[n]z n, Denoting a transform pair by x[n] X(z), some useful properties are ECE-7 Review Phil Schniter January 5, 7 ransforms Using x c (t) to denote a continuous-time signal at time t R, Laplace ransform: X c (s) x c (t)e st dt, s C Continuous-ime Fourier ransform (CF): ote that:

More information

Fourier Analysis and Spectral Representation of Signals

Fourier Analysis and Spectral Representation of Signals MIT 6.02 DRAFT Lecture Notes Last update: November 3, 2012 CHAPTER 13 Fourier Analysis and Spectral Representation of Signals We have seen in the previous chapter that the action of an LTI system on a

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

Transform Analysis of Linear Time-Invariant Systems

Transform Analysis of Linear Time-Invariant Systems Transform Analysis of Linear Time-Invariant Systems Discrete-Time Signal Processing Chia-Ping Chen Department of Computer Science and Engineering National Sun Yat-Sen University Kaohsiung, Taiwan ROC Transform

More information

Final Exam of ECE301, Section 3 (CRN ) 8 10am, Wednesday, December 13, 2017, Hiler Thtr.

Final Exam of ECE301, Section 3 (CRN ) 8 10am, Wednesday, December 13, 2017, Hiler Thtr. Final Exam of ECE301, Section 3 (CRN 17101-003) 8 10am, Wednesday, December 13, 2017, Hiler Thtr. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, and

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

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding J. McNames Portland State University ECE 223 FFT Ver. 1.03 1 Fourier Series

More information

summable Necessary and sufficient for BIBO stability of an LTI system. Also see poles.

summable Necessary and sufficient for BIBO stability of an LTI system. Also see poles. EECS 206 DSP GLOSSARY c Andrew E. Yagle Fall 2005 absolutely impulse response: h[n] is finite. EX: n=0 ( 3 4 )n = 1 = 4 but 1 3 n=1 1 n. 4 summable Necessary and sufficient for BIBO stability of an LI

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

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

Digital Filters Ying Sun

Digital Filters Ying Sun Digital Filters Ying Sun Digital filters Finite impulse response (FIR filter: h[n] has a finite numbers of terms. Infinite impulse response (IIR filter: h[n] has infinite numbers of terms. Causal filter:

More information

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, Cover Sheet

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, Cover Sheet EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, 2012 Cover Sheet Test Duration: 75 minutes. Coverage: Chaps. 5,7 Open Book but Closed Notes. One 8.5 in. x 11 in. crib sheet Calculators

More information

Fourier Series and Fourier Transforms

Fourier Series and Fourier Transforms Fourier Series and Fourier Transforms EECS2 (6.082), MIT Fall 2006 Lectures 2 and 3 Fourier Series From your differential equations course, 18.03, you know Fourier s expression representing a T -periodic

More information

EE 3054: Signals, Systems, and Transforms Summer It is observed of some continuous-time LTI system that the input signal.

EE 3054: Signals, Systems, and Transforms Summer It is observed of some continuous-time LTI system that the input signal. EE 34: Signals, Systems, and Transforms Summer 7 Test No notes, closed book. Show your work. Simplify your answers. 3. It is observed of some continuous-time LTI system that the input signal = 3 u(t) produces

More information

Chapter 5 Frequency Domain Analysis of Systems

Chapter 5 Frequency Domain Analysis of Systems Chapter 5 Frequency Domain Analysis of Systems CT, LTI Systems Consider the following CT LTI system: xt () ht () yt () Assumption: the impulse response h(t) is absolutely integrable, i.e., ht ( ) dt< (this

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

Multidimensional digital signal processing

Multidimensional digital signal processing PSfrag replacements Two-dimensional discrete signals N 1 A 2-D discrete signal (also N called a sequence or array) is a function 2 defined over thex(n set 1 of, n 2 ordered ) pairs of integers: y(nx 1,

More information