Lecture 2 Outline “Fun” with Fourier Announcements: Poll for discussion section and OHs: please respond First HW posted 5pm tonight Duality Relationships.

Slides:



Advertisements
Similar presentations
Review of Frequency Domain
Advertisements

SIGNAL AND SYSTEM CT Fourier Transform. Fourier’s Derivation of the CT Fourier Transform x(t) -an aperiodic signal -view it as the limit of a periodic.
Chapter 8: The Discrete Fourier Transform
Signals & systems Ch.3 Fourier Transform of Signals and LTI System
EECS 20 Chapter 10 Part 11 Fourier Transform In the last several chapters we Viewed periodic functions in terms of frequency components (Fourier series)
Autumn Analog and Digital Communications Autumn
PROPERTIES OF FOURIER REPRESENTATIONS
APPLICATIONS OF FOURIER REPRESENTATIONS TO
EE-2027 SaS, L11 1/13 Lecture 11: Discrete Fourier Transform 4 Sampling Discrete-time systems (2 lectures): Sampling theorem, discrete Fourier transform.
EECS 20 Chapter 9 Part 21 Convolution, Impulse Response, Filters In Chapter 5 we Had our first look at LTI systems Considered discrete-time systems, some.
Continuous-Time Fourier Methods
Discrete-Time Fourier Methods
Discrete-Time Convolution Linear Systems and Signals Lecture 8 Spring 2008.
Analogue and digital techniques in closed loop regulation applications Digital systems Sampling of analogue signals Sample-and-hold Parseval’s theorem.
Signals and Systems Discrete Time Fourier Series.
Lecture 9 FIR and IIR Filter design using Matlab
Discrete-Time Fourier Series
Copyright © Shi Ping CUC Chapter 3 Discrete Fourier Transform Review Features in common We need a numerically computable transform, that is Discrete.
Lecture 41 Practical sampling and reconstruction.
Discrete-Time and System (A Review)
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
Fourier Series Summary (From Salivahanan et al, 2002)
Fourier To apprise the intimate relationship between the 4-Fourier’s used in practice. Continuous Time Fourier Series and Continuous Time Fourier Transform.
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 EKT 232.
1 Review of Continuous-Time Fourier Series. 2 Example 3.5 T/2 T1T1 -T/2 -T 1 This periodic signal x(t) repeats every T seconds. x(t)=1, for |t|
The Continuous - Time Fourier Transform (CTFT). Extending the CTFS The CTFS is a good analysis tool for systems with periodic excitation but the CTFS.
Discrete Fourier Transform Prof. Siripong Potisuk.
Signal and Systems Prof. H. Sameti Chapter 5: The Discrete Time Fourier Transform Examples of the DT Fourier Transform Properties of the DT Fourier Transform.
1 Fourier Representations of Signals & Linear Time-Invariant Systems Chapter 3.
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 School of Computer and Communication Engineering, UniMAP Hasliza A Samsuddin EKT.
The Discrete Fourier Transform 主講人:虞台文. Content Introduction Representation of Periodic Sequences – DFS (Discrete Fourier Series) Properties of DFS The.
Signals & systems Ch.3 Fourier Transform of Signals and LTI System 5/30/2016.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 EKT 232.
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
1. 2 Ship encountering the superposition of 3 waves.
Chapter 2. Signals and Linear Systems
3.0 Fourier Series Representation of Periodic Signals 3.1 Exponential/Sinusoidal Signals as Building Blocks for Many Signals.
Lecture 6: DFT XILIANG LUO 2014/10. Periodic Sequence  Discrete Fourier Series For a sequence with period N, we only need N DFS coefs.
Chapter 5 Finite-Length Discrete Transform
Fourier Analysis of Signals and Systems
5.0 Discrete-time Fourier Transform 5.1 Discrete-time Fourier Transform Representation for discrete-time signals Chapters 3, 4, 5 Chap 3 Periodic Fourier.
Dan Ellis 1 ELEN E4810: Digital Signal Processing Topic 3: Fourier domain 1.The Fourier domain 2.Discrete-Time Fourier Transform (DTFT) 3.Discrete.
Signals and Systems Prof. H. Sameti Chapter 4: The Continuous Time Fourier Transform Derivation of the CT Fourier Transform pair Examples of Fourier Transforms.
ES97H Biomedical Signal Processing
DTFT continue (c.f. Shenoi, 2006)  We have introduced DTFT and showed some of its properties. We will investigate them in more detail by showing the associated.
Fourier Representation of Signals and LTI Systems.
Signals and Systems Fall 2003 Lecture #6 23 September CT Fourier series reprise, properties, and examples 2. DT Fourier series 3. DT Fourier series.
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 UniMAP.
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 School of Computer and Communication Engineering, UniMAP Amir Razif B. Jamil Abdullah EKT.
بسم الله الرحمن الرحيم University of Khartoum Department of Electrical and Electronic Engineering Third Year – 2015 Dr. Iman AbuelMaaly Abdelrahman
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
EE 102b: Signal Processing and Linear Systems II Professor Andrea Goldsmith Signals and Systems.
Lecture 20 Outline: Laplace Transforms Announcements: Reading: “6: The Laplace Transform” pp. 1-9 HW 7 posted, due next Wednesday My OHs Monday cancelled,
EE104: Lecture 6 Outline Announcements: HW 1 due today, HW 2 posted Review of Last Lecture Additional comments on Fourier transforms Review of time window.
UNIT-II FOURIER TRANSFORM
Signals & systems Ch.3 Fourier Transform of Signals and LTI System
Lecture 3 Outline: Sampling and Reconstruction
Recap: Chapters 1-7: Signals and Systems
Announcements: Poll for discussion section and OHs: please respond
Chapter 8 The Discrete Fourier Transform
Sampling the Fourier Transform
Lecture 15 Outline: DFT Properties and Circular Convolution
Signals & Systems (CNET - 221) Chapter-5 Fourier Transform
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Signals and Systems Lecture 15
4. The Continuous time Fourier Transform
Presentation transcript:

Lecture 2 Outline “Fun” with Fourier Announcements: Poll for discussion section and OHs: please respond First HW posted 5pm tonight Duality Relationships Connections between Continuous/Discrete Time Filtering and Convolution Periodic Signals Energy, Power, and Parseval

Duality in Fourier Transforms

t.5T -.5T  x(t): Aperiodic Continuous CTFT: X(j  ): Aperiodic Continuous 0N0N0 2N 0 -N 0 N -N n x[n]: Periodic Discrete DTFS: a k : Periodic Discrete a0a0 a1a1 a2a2 a3a3 a4a4 a -2 a -1 a -3 a -4 Samples of X(e j  ) every 2  /N 0 n N -N x[n]: Aperiodic Discrete DTFT: X(e j  ): Periodic Continuous CONNECTIONS BETWEEN THE CTFT, DTFT, CTFS, DTFS Using rect  sinc example Aliased version of X(j  ) from sampling x(t) every T s =T/(2N+1), then scale  axis by 2  /T s to get  axis 0T0T0 2T 0 -T 0.5T -.5T t x(t): Periodic Continuous a2a2 a1a1 a0a0 a3a3 0  a4a4 a -2 a -3 a -4 a5a5 a6a6 a -5 a -6 CTFS: a k Aperiodic Discrete a -1 Samples of X(j  ) every 2  /T 0

Filtering and Convolution Filtering Example: Important convolution examples 0N0N0 -N 0 N -N n x[n]: Periodic Discrete a0a0 a1a1 a2a2 a3a3 a4a4 a -2 a -1 a -3 a -4 X( j  ) H( j  ) Y( j  )=H( j  )X( j  ) X( e j  ) H(e j  ) Y(e j  )=H( e j  )X( e j  ) W -W  1 X( e j  ) 2W T0 A * = 2T 0 A2TA2T T0 A * … 0N-1 … 0 = … 0 … 2N-1 A2A2 2A 2 3A 2 NA 2 A2A2 2A 2 3A 2 A

Periodic Signals Continuous time: x(t) periodic iff there exists a T 0 >0 such that x(t)=x(t+T 0 ) for all t T 0 is called a period of x(t); smallest such T 0 is fundamental period If x(t) periodic with period T 1, y(t) periodic with period T 2, then x(t)+y(t) is periodic with period k 1 T 1 =k 2 T 2 if such integers k i exist. Discrete time: x[n] periodic iff there exists a N 0 >0 such that x[n]=x[n+N 0 ] for all n N 0 is called a period of x(t); smallest such N 0 is fundamental period If x[n] periodic with period N 1, y[n] periodic with period N 2, then x[n]+y[n] is periodic with period k 1 N 1 =k 2 N 2 if such integers k i exist. Filtering periodic signals H( j  ) H( e j  ) 0N0N0 -N 0 N -N n 0T0T0 2T 0 -T 0.5T -.5T t

Energy, Power, and Parseval’s Relation Continuous Time Aperiodic Signals Discrete Time Aperiodic Signals Energy signals have zero power; Power signals have infinite energy Periodic:

a0a0 a1a1 a2a2 a3a3 a4a4 a -2 a -1 a -3 a -4 Examples Continuous-time Discrete-time AT .5T -.5T A t x(t) X(j  ) Which would you rather integrate? 0N2N-N N1N1 -N 1 n x[n]: Periodic Discrete Which would you rather sum?

Main Points Duality saves work! Only need to compute half of the Fourier Series and Transform pairs, use duality to get the other half. Fourier transforms of continuous aperiodic signals yield their discrete- time counterparts by sampling and appropriate scaling of  axis. Fourier transforms of continuous or discrete periodic signals obtained by sampling their aperiodic Fourier transforms Filtering convolves input signal with impulse response of filter. This becomes multiplication of corresponding Fourier Transforms One domain typically easier to compute than the other Sum of 2 periodic signals has period equal to the LCM of the two periods. Filtering a periodic signal preserves Fourier Series components in filter BW Energy and power can be computed in time or frequency domain