1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 EKT 232.

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.
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
Lecture 8: Fourier Series and Fourier Transform
APPLICATIONS OF FOURIER REPRESENTATIONS TO
A-A+ B-B+ C-C+ F. Week 11. Chapter 10 Fourier Transforms 1.The Four Fourier transforms CTFT DTFT FS DFT/S 2.Relationships 3.Important properties.
Continuous-Time Fourier Methods
Discrete-Time Fourier Methods
Signals and Systems Discrete Time Fourier Series.
Continuous-Time Signal Analysis: The Fourier Transform
Chapter 4 The Fourier Series and Fourier Transform
CH#3 Fourier Series and Transform
Chapter 4 The Fourier Series and Fourier Transform.
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.
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 Transforms Section Kamen and Heck.
Fourier Series Summary (From Salivahanan et al, 2002)
1 The Fourier Series for Discrete- Time Signals Suppose that we are given a periodic sequence with period N. The Fourier series representation for x[n]
Basic signals Why use complex exponentials? – Because they are useful building blocks which can be used to represent large and useful classes of signals.
Module 2 SPECTRAL ANALYSIS OF COMMUNICATION SIGNAL.
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.
Fourier Series. Introduction Decompose a periodic input signal into primitive periodic components. A periodic sequence T2T3T t f(t)f(t)
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.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Chapter 4 Fourier transform Prepared by Dr. Taha MAhdy.
Signal and System I The unit step response of an LTI system.
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 EKT 232.
Basic Operation on Signals Continuous-Time Signals.
BYST SigSys - WS2003: Fourier Rep. 120 CPE200 Signals and Systems Chapter 3: Fourier Representations for Signals (Part I)
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
Chapter 5 Finite-Length Discrete Transform
CH#3 Fourier Series and 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.
INTRODUCTION TO SIGNALS
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.
Alexander-Sadiku Fundamentals of Electric Circuits
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 Roadmap SignalSystem Input Signal Output Signal characteristics Given input and system information, solve for the response Solving differential equation.
Frequency domain analysis and Fourier Transform
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 School of Computer and Communication Engineering, UniMAP Amir Razif B. Jamil Abdullah EKT.
Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: 2.3 Fourier Transform: From Fourier Series to Fourier Transforms.
بسم الله الرحمن الرحيم University of Khartoum Department of Electrical and Electronic Engineering Third Year – 2015 Dr. Iman AbuelMaaly Abdelrahman
Lecture 2 Outline “Fun” with Fourier Announcements: Poll for discussion section and OHs: please respond First HW posted 5pm tonight Duality Relationships.
Chapter 2. Signals and Linear Systems
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
CH#3 Fourier Series and Transform 1 st semester King Saud University College of Applied studies and Community Service 1301CT By: Nour Alhariqi.
Math for CS Fourier Transforms
Dr. Michael Nasief Digital Signal Processing Lec 7 1.
UNIT II Analysis of Continuous Time signal
Introduction to Signals and Systems
Notes Assignments Tutorial problems
Signals & Systems (CNET - 221) Chapter-5 Fourier Transform
Signals and Systems Lecture 15
Signals & Systems (CNET - 221) Chapter-4
4. The Continuous time Fourier Transform
Concept of frequency in Discrete Signals & Introduction to LTI Systems
Signals and Systems Lecture 11
Presentation transcript:

1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 EKT 232

Time propertyPeriodicNonperiodic Continuous (t)Fourier series (FS) Fourier Transform (FT) Discrete [n]Discrete-Time Fourier Series (DTFS) Discrete-Time Fourier Transform (DTFT) 2 Relationship between Time Properties of a Signal and the Appropriate Fourier Representation

Periodic signal:FS Representations 3

Notice that in; where, Ω 0 =2π/N fundamental frequency of x[n]. Similarly for continous x(t) fundamental period T, where, ω 0 =2π/T fundamental frequency of x(t). Show the relationship… (3.1) (3.2)

10/8/20155 Freq of the kth sinusoid is kω 0 and each sinusoid has a common period T, A sinusoid whose freq is an integer multiple of a fundamental freq is said to be a harmonic of the sinusoid at the fundamental freq. Thus, is the kth harmonic of

NonPeriodic Signal:FT Representations 6

10/8/20157 (3.3) (3.4)

10/8/20158 Identify the fourier representation for the following signals; a.x[n]=(1/2) n u[n] b. x(t)=e-t cos (2 πt) u(t) c. x(t)=1-cos (7 πt )+sin (6 πt)

9 Discrete-Time Periodic Signals: The Discrete-Time Fourier Series (DTFS) (3.5) (3.6)

10 Fourier Series Are the DTFS coefficients of the signal x[n]. We can denote that x[n] and X[k] are a DTFS pair and the relationship as;

Exercise 10/8/201511

12 1. Find the frequency-domain representation of the signal in Figure 3.1 below. Figure 3.1: Time Domain Signal. Solution: Step 1: Determine N and  . The signal has period N=5, so   =2  /5. Also the signal has odd symmetry, so we sum over n = -2 to n = 2

13 Step 2: Solve for the frequency-domain, X[k]. From step 1, we found the fundamental frequency, N =5, and we sum over n = -2 to n = 2.

14 From the value of x{n} we get,Cont’d…

15Cont’d…

16 CT Fourier Series Definition

10/8/ CTFS Properties Linearity Dr. Abid Yahya

10/8/ CTFS Properties Time Shifting

10/8/ CTFS Properties Frequency Shifting (Harmonic Number Shifting) A shift in frequency (harmonic number) corresponds to multiplication of the time function by a complex exponential. Time Reversal

10/8/ CTFS Properties Change of Representation Time (m is any positive integer) Dr. Abid Yahya

10/8/ CTFS Properties Change of Representation Time

10/8/ CTFS Properties Time Differentiation

10/8/2015. J. Roberts - All Rights Reserved 23 Time Integration is not periodic CTFS Properties Case 1Case 2

10/8/ CTFS Properties Multiplication-Convolution Duality

10/8/ Fourier Series(DTFS)

10/8/ Notice that in the summation is over exactly one period, a finite summation. This is because of the periodicity of the complex sinusoid, This occurs because discrete time n is always an integer. Fourier Series(DTFS)

10/8/ Fourier Series(DTFS)

10/8/ DTFS Properties Linearity

10/8/ DTFS Properties Time Shifting

10/8/ DTFS Properties Frequency Shifting (Harmonic Number Shifting)

10/8/ DTFS Properties Time Scaling If a is not an integer, some values of z[n] are undefined and no DTFS can be found. If a is an integer (other than 1) then z[n] is a decimated version of x[n] with some values missing and there cannot be a unique relationship between their harmonic functions. However, if then

10/8/ DTFS Properties Change of Representation Time (q is any positive integer)

10/8/ DTFS Properties First Backward Difference Multiplication- Convolution Duality

The Fourier Transform

10/8/ Extending the CTFS The CTFS is a good analysis tool for systems with periodic excitation but the CTFS cannot represent an aperiodic signal for all time The continuous-time Fourier transform (CTFT) can represent an aperiodic signal for all time

10/8/ ForwardInverse f form  form ForwardInverse Definition of the CTFT or Commonly-used notation:

10/8/ Some Remarkable Implications of the Fourier Transform The CTFT expresses a finite-amplitude, real-valued, aperiodic signal which can also, in general, be time-limited, as a summation (an integral) of an infinite continuum of weighted, infinitesimal-amplitude, complex sinusoids, each of which is unlimited in time. (Time limited means “having non-zero values only for a finite time.”)

The Discrete-Time Fourier Transform

10/8/ Extending the DTFS Analogous to the CTFS, the DTFS is a good analysis tool for systems with periodic excitation but cannot represent an aperiodic signal for all time The discrete-time Fourier transform (DTFT) can represent an aperiodic signal for all time

10/8/ Definition of the DTFT F Form  Form ForwardInverse ForwardInverse

10/8/ The Four Fourier Methods

10/8/ Relations Among Fourier Methods Multiplication-Convolution Duality

10/8/ Relations Among Fourier Methods Time and Frequency Shifting

10/8/ Tutorials 1. Compute the CTFS:,