Complex symmetry Signals and Systems Fall 2015

Size: px
Start display at page:

Download "Complex symmetry Signals and Systems Fall 2015"

Transcription

1 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 notions can be applied to all the other categories (FS, DTFS, FT, DTFT). First we will talk what happens to the frequency representation X(e jω ) when x[n] has different properties. (a) Prove x[n] is real X (e jω ) X(e jω ) If x[n] is real then x [n] x[n]. X(e jω ) x[n]e jωn X (e jω ) X(e jω ) n ( n n n n n n x[n]e jωn ) ( x[n]e jωn ) x [n] ( e jωn) x [n]e jωn, we know that x [n] x[n] x[n]e jωn x[n]e jωn X (e jω ) X(e jω ) x[n] is real X (e jω ) X(e jω )

2 Complex symmetry (b) Prove x[n] is pure imaginary X (e jω ) X(e jω ) If x[n] is pure imaginary then x [n] x[n]. X(e jω ) X (e jω ) X(e jω ) n n n n n x[n]e jωn, we know that x [n] x[n] x[n] is pure imaginary (c) Prove x[n] is even X(e jω ) X(e jω ) If x[n] is even then x[n] x[ n]. X(e jω ) x[n]e jωn n n x[n]e jω( n) we can do a variable change m n x[ m]e jωm, we know that x[n] x[ n] m m x[m]e jωm X(e jω ) x[n] is even X(e jω ) X(e jω )

3 Complex symmetry 3 (d) Prove x[n] is odd X(e jω ) X(e jω ) If x[n] is odd then x[n] x[ n]. X(e jω ) x[n]e jωn x[n] is odd n n we can do a variable change m n, we know that x[n] x[ n] m m Time domain x[n] is real x [n] x[n] x[n] is pure imaginary x [n] x[n] x[n] is even x[n] x[ n] x[n] is odd x[n] x[ n] Frequency domain X (e jω ) X(e jω ) X(e jω ) X(e jω ) We will next mix the properties. In other words, we want to see what happens when the signal is real and even or complex and odd. (a) Prove x[n] is real and even X (e jω ) X(e jω ) X(e jω ) x[n] is real X (e jω ) X(e jω ) x[n] is even X(e jω ) X(e jω ) x[n] is real and even X (e jω ) X(e jω ) X(e jω )

4 4 Complex symmetry X (e jω ) X(e jω ) X(e jω ) is real, therefore ImX(e jω )} 0 X(e jω ) X(e jω ) X(e jω ) is even (b) Prove x[n] is real and odd X (e jω ) X(e jω ) X(e jω ) x[n] is real X (e jω ) X(e jω ) x[n] is odd X(e jω ) X(e jω ) x[n] is real and odd X (e jω ) X(e jω ) X(e jω ) X (e jω ) X(e jω ) X(e jω ) is pure imaginary, therefore ReX(e jω )} 0 X(e jω ) X(e jω ) X(e jω ) is even (c) Prove x[n] is pure imaginary and even x[n] is pure imaginary x[n] is even x[n] is pure imaginary and even (d) Prove x[n] is pure imaginary and odd x[n] is pure imaginary x[n] is odd x[n] is pure imaginary and odd Time domain Frequency domain x[n] is real and even ImX(e jω )} 0 x[n] is real and odd ReX(e jω )} 0 x[n] is pure imaginary and even x[n] is pure imaginary and odd

5 Complex symmetry 5 Thinking about the duality property, if we know information about the frequency representation X(e jω ) we can determine properties for the signal x[n]. Rule All of these properties can be applied to the rest of the Fourier friends - FS, DTFS, FT and DTFT.

6 6 Complex symmetry Problem 0 Given the following time domain signals, determine whether their corresponding Fourier transform is real/imaginary and even/odd. (a) x(t) cos( π 4 t) (b) x[n] j sin( π 8 n) (c) x(t) ( 1 (d) Solution: ) t ( 1 ) n, n 1 x[n] 0, n 0 n, n 1 (a) x(t) cos( π 4 t) Step 0: Compute the complex conjugate x (t) x (t) cos( π 4 t) x(t) x (t) x(t) X [k] X[ k] Step 1: Determine whether the signal is even or odd x( t) cos( π 4 t) cos( π 4 t) x(t) x( t) x(t) X[k] X[ k] Step : Draw the conclusion x (t) x(t) and x( t) x(t) X [k] X[ k] X[k] From this we can extract that the FS of x(t) is real and even. Alternate route: Compute the FS coefficients x(t) cos( π 4 t) 1 ej π 4 t + 1 e j π 4 t The FS coefficients are real and even. X[ 1] X[1] 1 for one period T 0 8

7 Complex symmetry 7 (b) x[n] j sin( π 8 n) Step 0: Compute the complex conjugate x [n] x [n] j sin( π 8 n) x[n] x [n] x[n] X [k] X[ k] Step 1: Determine whether the signal is even or odd x[ n] j sin( π 8 ( n)) j sin( π 8 n) x[n] x[ n] x[n] X[k] X[ k] Step : Draw the conclusion x [n] x[n] and x[ n] x[n] X [k] X[ k] X[k] From this we can extract that the DTFS of x[n] is real and odd. Alternate route: Compute the DTFS coefficients x[n] j sin( π 8 n) j j ej π 8 n j j e j π 8 n 1 ej π 8 n 1 e j π 8 n X[ 1] X[1] 1 for one period N 0 16 The FS coefficients are real and odd. ) t (c) x(t) ( 1 Step 0: Compute the complex conjugate x (t) x (t) ( ) t 1 x(t) x (t) x(t) X (jω) X( jω)

8 8 Complex symmetry Step 1: Determine whether the signal is even or odd Step : Draw the conclusion ( 1 x( t) ( 1 x(t) ) t ) t x( t) x(t) X(jω) X( jω) x (t) x(t) and x( t) x(t) X (jω) X( jω) X(jω) From this we can extract that the FT of x(t) is real and even. Alternate route: Compute the DTFS coefficients ( ) t 1 x(t) ( ) t 1 X(jω) e jωt dt 0 ( ) t 1 ( ) t 1 e jωt dt + e jωt dt 0 ( ) t 1 ( ) t 1 e jωt dt + e jωt dt 0 0 ( ) e jω t ( ) e jω t dt + dt 0 0 ( ( e jω ) t ln( ejω ) ln( ejω The FT is real and even. e jω ) t ln( e jω ) 0 ln( e jω ) ) jω ln() + 1 jω ln() 1 ln() jω + 1 ln() (ln()) + ω ln() + jω

9 Complex symmetry 9 (d) ( 1 ) n, n 1 x[n] 0, n 0 n, n 1 Step 0: Compute the complex conjugate x [n] x [n] x[n] X (e jω ) X(e jω ) Step 1: Determine whether the signal is even or odd ( 1 ) n, n 1 x[ n] 0, n 0 n, n 1 n, n 1 x[ n] 0, n 0 ( 1 n ), n 1 ( 1 n ), n 1 x[ n] 0, n 0 n, n 1 x[ n] x[n] X(jω) X( jω) Step : Draw the conclusion x [n] x[n] and x[ n] x[n] X (jω) X( jω) X(jω) From this we can extract that the FT of x(t) is pure imaginary and odd. Alternate route: Compute the DTFS coefficients ( 1 ) n, n 1 x[n] 0, n 0 n, n 1 X(e jω ) x[n]e jωn k k1 ( ) n 1 e jωn + 1 k ( n ) e jωn

10 10 Complex symmetry ( ) n 1 ( ) n 1 e jωn e jωn k1 ( ) e jω n ( ) e jω n k1 k1 k e jω 1 1 ejω 1 1 ejω ( e jω 1 1 e jω) ( 1 1ejΩ) j sin(ω) 1 cos(ω) 1 4 j sin(ω) 3 cos(ω) 4 j sin(ω) cos(ω) 3 4 The FT is pure imaginary and odd. Problem 1 You are given the following magnitude and phase of a DTFT of a discrete time aperiodic signal x[n]. X(jω) X(jω) π 1 π ω ω 1 π π Determine: (a) whether the signal is real or pure imaginary (b) whether the signal is even or odd

11 Complex symmetry 11 Solution: 1e j π, 4 ω X(jω) 1e j π, ω 4 e j π, 4 ω e j π, ω 4 j, 4 ω j, ω 4 (a) Step 0: Compute the complex conjugate X (jω) j, 4 ω j, ω 4 X (jω) X(jω) (b) Step 1: Determine whether the FT is even or odd j, 4 ω X( jω) j, ω 4 j, ω 4 j, 4 ω j, 4 ω j, ω 4 X( jω) X(jω) (c) Step : Draw conclusions based on X( jω) X(jω) X (jω). x(t) is real and odd. Problem Determine wheter the signal that has the follwing frequency representation is real/pure imaginary and even/odd. X(jω) jω cos(ω) Solution:

12 1 Complex symmetry (a) i. Step 0 is to determine X (jω) X (jω) jω cos(ω) ii. Step 1 is to determine X( jω) X( jω) j( ω) cos( ω), cos is even jω cos(ω) X(jω) iii. Step is to determine the relationship between X (jω) and X( jω) X (jω) X( jω) This implies that the signal x(t) is pure imaginary. (b) X(jω) X( jω), therefore the signal is even.

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

Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is 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

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

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

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

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

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

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

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

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

Chapter 6: Applications of Fourier Representation Houshou Chen

Chapter 6: Applications of Fourier Representation Houshou Chen Chapter 6: Applications of Fourier Representation Houshou Chen Dept. of Electrical Engineering, National Chung Hsing University E-mail: houshou@ee.nchu.edu.tw H.S. Chen Chapter6: Applications of Fourier

More information

Fourier series for continuous and discrete time signals

Fourier series for continuous and discrete time signals 8-9 Signals and Systems Fall 5 Fourier series for continuous and discrete time signals The road to Fourier : Two weeks ago you saw that if we give a complex exponential as an input to a system, the output

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

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

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

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

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

The Continuous Time Fourier Transform

The Continuous Time Fourier Transform COMM 401: Signals & Systems Theory Lecture 8 The Continuous Time Fourier Transform Fourier Transform Continuous time CT signals Discrete time DT signals Aperiodic signals nonperiodic periodic signals Aperiodic

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

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

Final Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105.

Final Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105. Final Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, e-mail address,

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

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

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

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

Final Exam of ECE301, Prof. Wang s section 8 10am Tuesday, May 6, 2014, EE 129.

Final Exam of ECE301, Prof. Wang s section 8 10am Tuesday, May 6, 2014, EE 129. Final Exam of ECE301, Prof. Wang s section 8 10am Tuesday, May 6, 2014, EE 129. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, e-mail address, and signature

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

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

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

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

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

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

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

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

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

University of Connecticut Lecture Notes for ME5507 Fall 2014 Engineering Analysis I Part III: Fourier Analysis

University of Connecticut Lecture Notes for ME5507 Fall 2014 Engineering Analysis I Part III: Fourier Analysis University of Connecticut Lecture Notes for ME557 Fall 24 Engineering Analysis I Part III: Fourier Analysis Xu Chen Assistant Professor United Technologies Engineering Build, Rm. 382 Department of Mechanical

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

6.003: Signal Processing

6.003: Signal Processing 6.003: Signal Processing Discrete Fourier Transform Discrete Fourier Transform (DFT) Relations to Discrete-Time Fourier Transform (DTFT) Relations to Discrete-Time Fourier Series (DTFS) October 16, 2018

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

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

New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Final Exam

New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Final Exam New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Name: Solve problems 1 3 and two from problems 4 7. Circle below which two of problems 4 7 you

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

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

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 Analysis Overview (0A)

Fourier Analysis Overview (0A) CTFS: Fourier Series CTFT: Fourier Transform DTFS: Fourier Series DTFT: Fourier Transform DFT: Discrete Fourier Transform Copyright (c) 2011-2016 Young W. Lim. Permission is granted to copy, distribute

More information

CH.6 Laplace Transform

CH.6 Laplace Transform CH.6 Laplace Transform Where does the Laplace transform come from? How to solve this mistery that where the Laplace transform come from? The starting point is thinking about power series. The power series

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

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

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

Homework 6 EE235, Spring 2011

Homework 6 EE235, Spring 2011 Homework 6 EE235, Spring 211 1. Fourier Series. Determine w and the non-zero Fourier series coefficients for the following functions: (a 2 cos(3πt + sin(1πt + π 3 w π e j3πt + e j3πt + 1 j2 [ej(1πt+ π

More information

MEDE2500 Tutorial Nov-7

MEDE2500 Tutorial Nov-7 (updated 2016-Nov-4,7:40pm) MEDE2500 (2016-2017) Tutorial 3 MEDE2500 Tutorial 3 2016-Nov-7 Content 1. The Dirac Delta Function, singularity functions, even and odd functions 2. The sampling process and

More information

BME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY

BME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY 1 Lucas Parra, CCNY BME 50500: Image and Signal Processing in Biomedicine Lecture 2: Discrete Fourier Transform Lucas C. Parra Biomedical Engineering Department CCNY http://bme.ccny.cuny.edu/faculty/parra/teaching/signal-and-image/

More information

Digital Signal Processing: Signal Transforms

Digital Signal Processing: Signal Transforms Digital Signal Processing: Signal Transforms Aishy Amer, Mohammed Ghazal January 19, 1 Instructions: 1. This tutorial introduces frequency analysis in Matlab using the Fourier and z transforms.. More Matlab

More information

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION FINAL EXAMINATION 9:00 am 12:00 pm, December 20, 2010 Duration: 180 minutes Examiner: Prof. M. Vu Assoc. Examiner: Prof. B. Champagne There are 6 questions for a total of 120 points. This is a closed book

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

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

Assignment 4 Solutions Continuous-Time Fourier Transform

Assignment 4 Solutions Continuous-Time Fourier Transform Assignment 4 Solutions Continuous-Time Fourier Transform ECE 3 Signals and Systems II Version 1.01 Spring 006 1. Properties of complex numbers. Let c 1 α 1 + jβ 1 and c α + jβ be two complex numbers. a.

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

School of Information Technology and Electrical Engineering EXAMINATION. ELEC3004 Signals, Systems & Control

School of Information Technology and Electrical Engineering EXAMINATION. ELEC3004 Signals, Systems & Control This exam paper must not be removed from the venue Venue Seat Number Student Number Family Name First Name School of Information Technology and Electrical Engineering EXAMINATION Semester One Final Examinations,

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

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

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

Homework 6 Solutions

Homework 6 Solutions 8-290 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 208 Homework 6 Solutions. Part One. (2 points) Consider an LTI system with impulse response h(t) e αt u(t), (a) Compute the frequency response

More information

Final Exam of ECE301, Section 1 (Prof. Chih-Chun Wang) 1 3pm, Friday, December 13, 2016, EE 129.

Final Exam of ECE301, Section 1 (Prof. Chih-Chun Wang) 1 3pm, Friday, December 13, 2016, EE 129. Final Exam of ECE301, Section 1 (Prof. Chih-Chun Wang) 1 3pm, Friday, December 13, 2016, EE 129. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, and

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

Representing a Signal

Representing a Signal The Fourier Series Representing a Signal The convolution method for finding the response of a system to an excitation takes advantage of the linearity and timeinvariance of the system and represents the

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

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

Discrete Time Rect Function(4B)

Discrete Time Rect Function(4B) Discrete Time Rect Function(4B) Discrete Time Rect Functions Copyright (c) 29-23 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation

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

06EC44-Signals and System Chapter Fourier Representation for four Signal Classes

06EC44-Signals and System Chapter Fourier Representation for four Signal Classes Chapter 5.1 Fourier Representation for four Signal Classes 5.1.1Mathematical Development of Fourier Transform If the period is stretched without limit, the periodic signal no longer remains periodic but

More information

Random signals II. ÚPGM FIT VUT Brno,

Random signals II. ÚPGM FIT VUT Brno, Random signals II. Jan Černocký ÚPGM FIT VUT Brno, cernocky@fit.vutbr.cz 1 Temporal estimate of autocorrelation coefficients for ergodic discrete-time random process. ˆR[k] = 1 N N 1 n=0 x[n]x[n + k],

More information

2.161 Signal Processing: Continuous and Discrete Fall 2008

2.161 Signal Processing: Continuous and Discrete Fall 2008 MIT OpenCourseWare http://ocw.mit.edu 2.161 Signal Processing: Continuous and Discrete Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Massachusetts

More information

X. Chen More on Sampling

X. Chen More on Sampling X. Chen More on Sampling 9 More on Sampling 9.1 Notations denotes the sampling time in second. Ω s = 2π/ and Ω s /2 are, respectively, the sampling frequency and Nyquist frequency in rad/sec. Ω and ω denote,

More information

1.3 Frequency Analysis A Review of Complex Numbers

1.3 Frequency Analysis A Review of Complex Numbers 3 CHAPTER. ANALYSIS OF DISCRETE-TIME LINEAR TIME-INVARIANT SYSTEMS I y z R θ x R Figure.8. A complex number z can be represented in Cartesian coordinates x, y or polar coordinates R, θ..3 Frequency Analysis.3.

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

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

4.1 Introduction. 2πδ ω (4.2) Applications of Fourier Representations to Mixed Signal Classes = (4.1)

4.1 Introduction. 2πδ ω (4.2) Applications of Fourier Representations to Mixed Signal Classes = (4.1) 4.1 Introduction Two cases of mixed signals to be studied in this chapter: 1. Periodic and nonperiodic signals 2. Continuous- and discrete-time signals Other descriptions: Refer to pp. 341-342, textbook.

More information

! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular

! Circular Convolution.  Linear convolution with circular convolution. ! Discrete Fourier Transform.  Linear convolution through circular Previously ESE 531: Digital Signal Processing Lec 22: April 18, 2017 Fast Fourier Transform (con t)! Circular Convolution " Linear convolution with circular convolution! Discrete Fourier Transform " Linear

More information

Overview of Sampling Topics

Overview of Sampling Topics Overview of Sampling Topics (Shannon) sampling theorem Impulse-train sampling Interpolation (continuous-time signal reconstruction) Aliasing Relationship of CTFT to DTFT DT processing of CT signals DT

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

log dx a u = log a e du

log dx a u = log a e du Formuls from Trigonometry: sin A cos A = cosa ± B) = cos A cos B sin A sin B sin A = sin A cos A tn A = tn A tn A sina ± B) = sin A cos B ± cos A sin B tn A±tn B tna ± B) = tn A tn B cos A = cos A sin

More information

Fourier Analysis Overview (0A)

Fourier Analysis Overview (0A) CTFS: Fourier Series CTFT: Fourier Transform DTFS: Fourier Series DTFT: Fourier Transform DFT: Discrete Fourier Transform Copyright (c) 2011-2016 Young W. Lim. Permission is granted to copy, distribute

More information

School of Information Technology and Electrical Engineering EXAMINATION. ELEC3004 Signals, Systems and Control

School of Information Technology and Electrical Engineering EXAMINATION. ELEC3004 Signals, Systems and Control This exam paper must not be removed from the venue Venue Seat Number Student Number Family Name First Name School of Information Technology and Electrical Engineering EXAMINATION Semester One Final Examinations,

More information

16.362: Signals and Systems: 1.0

16.362: Signals and Systems: 1.0 16.362: Signals and Systems: 1.0 Prof. K. Chandra ECE, UMASS Lowell September 1, 2016 1 Background The pre-requisites for this course are Calculus II and Differential Equations. A basic understanding of

More information

LECTURE 12 Sections Introduction to the Fourier series of periodic signals

LECTURE 12 Sections Introduction to the Fourier series of periodic signals Signals and Systems I Wednesday, February 11, 29 LECURE 12 Sections 3.1-3.3 Introduction to the Fourier series of periodic signals Chapter 3: Fourier Series of periodic signals 3. Introduction 3.1 Historical

More information

Discrete Fourier Transform

Discrete Fourier Transform Discrete Fourier Transform Valentina Hubeika, Jan Černocký DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz Diskrete Fourier transform (DFT) We have just one problem with DFS that needs to be solved.

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

School of Information Technology and Electrical Engineering EXAMINATION. ELEC3004 Signals, Systems & Control

School of Information Technology and Electrical Engineering EXAMINATION. ELEC3004 Signals, Systems & Control This exam paper must not be removed from the venue Venue Seat Number Student Number Family Name First Name School of Information Technology and Electrical Engineering EXAMINATION Semester One Final Examinations,

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

Notes 07 largely plagiarized by %khc

Notes 07 largely plagiarized by %khc Notes 07 largely plagiarized by %khc Warning This set of notes covers the Fourier transform. However, i probably won t talk about everything here in section; instead i will highlight important properties

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

CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation

CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University January 23, 2006 1 Exponentials The exponential is

More information

Z-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1.

Z-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1. 84 5. Z-TRANSFORMS 5 z-transforms Solution: Using the definition (5..2), we find: for case (a), and H(z) h 0 + h z + h 2 z 2 + h 3 z 3 2 + 3z + 5z 2 + 2z 3 H(z) h 0 + h z + h 2 z 2 + h 3 z 3 + h 4 z 4

More information

Core Concepts Review. Orthogonality of Complex Sinusoids Consider two (possibly non-harmonic) complex sinusoids

Core Concepts Review. Orthogonality of Complex Sinusoids Consider two (possibly non-harmonic) complex sinusoids Overview of Continuous-Time Fourier Transform Topics Definition Compare & contrast with Laplace transform Conditions for existence Relationship to LTI systems Examples Ideal lowpass filters Relationship

More information