Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: 2.3 Fourier Transform: 2.3.1 From Fourier Series to Fourier Transforms.

Slides:



Advertisements
Similar presentations
Continuous-Time Fourier Transform
Advertisements

Ch 3 Analysis and Transmission of Signals
Math Review with Matlab:
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Response to a Sinusoidal Input Frequency Analysis of an RC Circuit.
HILBERT TRANSFORM Fourier, Laplace, and z-transforms change from the time-domain representation of a signal to the frequency-domain representation of the.
Lecture 7: Basis Functions & Fourier Series
ELEC 303 – Random Signals Lecture 20 – Random processes
Signals and Systems – Chapter 5
Noise. Noise is like a weed. Just as a weed is a plant where you do not wish it to be, noise is a signal where you do not wish it to be. The noise signal.
Review of Frequency Domain
Properties of continuous Fourier Transforms
EE-2027 SaS 06-07, L11 1/12 Lecture 11: Fourier Transform Properties and Examples 3. Basis functions (3 lectures): Concept of basis function. Fourier series.
PROPERTIES OF FOURIER REPRESENTATIONS
Lecture 14: Laplace Transform Properties
Lecture 9: Fourier Transform Properties and Examples
Leo Lam © Signals and Systems EE235. Leo Lam © Fourier Transform Q: What did the Fourier transform of the arbitrary signal say to.
Chapter 4 The Fourier Series and Fourier Transform
EE313 Linear Systems and Signals Fall 2010 Initial conversion of content to PowerPoint by Dr. Wade C. Schwartzkopf Prof. Brian L. Evans Dept. of Electrical.
Chapter 4 The Fourier Transform EE 207 Dr. Adil Balghonaim.
Chapter 4 The Fourier Series and Fourier Transform.
Leo Lam © Signals and Systems EE235. Leo Lam © x squared equals 9 x squared plus 1 equals y Find value of y.
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
ELEC ENG 4035 Communications IV1 School of Electrical & Electronic Engineering 1 Section 2: Frequency Domain Analysis Contents 2.1 Fourier Series 2.2 Fourier.
Chapter 5 Frequency Domain Analysis of Systems. Consider the following CT LTI system: absolutely integrable,Assumption: the impulse response h(t) is absolutely.
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.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Linearity Time Shift and Time Reversal Multiplication Integration.
Fourier Transforms Section Kamen and Heck.
Fourier Series Summary (From Salivahanan et al, 2002)
1 I. Phasors (complex envelope) representation for sinusoidal signal narrow band signal II. Complex Representation of Linear Modulated Signals & Bandpass.
CISE315 SaS, L171/16 Lecture 8: Basis Functions & Fourier Series 3. Basis functions: Concept of basis function. Fourier series representation of time functions.
(Lecture #08)1 Digital Signal Processing Lecture# 8 Chapter 5.
Module 2 SPECTRAL ANALYSIS OF COMMUNICATION SIGNAL.
Chapter 5 Frequency Domain Analysis of Systems. Consider the following CT LTI system: absolutely integrable,Assumption: the impulse response h(t) is absolutely.
Lecture 24: CT 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.
Chapter 5: Fourier Transform.
Signals & systems Ch.3 Fourier Transform of Signals and LTI System 5/30/2016.
Signal and Systems Prof. H. Sameti Chapter 3: Fourier Series Representation of Periodic Signals Complex Exponentials as Eigenfunctions of LTI Systems Fourier.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Signal and System I The unit step response of an LTI system.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
1 Lecture 1: February 20, 2007 Topic: 1. Discrete-Time Signals and Systems.
Linearity Recall our expressions for the Fourier Transform and its inverse: The property of linearity: Proof: (synthesis) (analysis)
Chapter 2. Signals and Linear Systems
Input Function x(t) Output Function y(t) T[ ]. Consider The following Input/Output relations.
Fourier Analysis of Signals and Systems
Chapter 7 The Laplace Transform
Chapter 2. Fourier Representation of Signals and Systems
EE 207 Dr. Adil Balghonaim Chapter 4 The Fourier Transform.
Fourier Representation of Signals and LTI Systems.
Topics 1 Specific topics to be covered are: Discrete-time signals Z-transforms Sampling and reconstruction Aliasing and anti-aliasing filters Sampled-data.
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 UniMAP.
بسم الله الرحمن الرحيم University of Khartoum Department of Electrical and Electronic Engineering Third Year – 2015 Dr. Iman AbuelMaaly Abdelrahman
Eeng360 1 Chapter 2 Linear Systems Topics:  Review of Linear Systems Linear Time-Invariant Systems Impulse Response Transfer Functions Distortionless.
Chapter 2. Signals and Linear Systems
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
Fourier Transform and Spectra
Math for CS Fourier Transforms
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.
Convergence of Fourier series It is known that a periodic signal x(t) has a Fourier series representation if it satisfies the following Dirichlet conditions:
Signals & systems Ch.3 Fourier Transform of Signals and LTI System
Chapter 2. Signals and Linear Systems
Chapter 2. Fourier Representation of Signals and Systems
UNIT II Analysis of Continuous Time signal
2.2 Fourier Series: Fourier Series and Its Properties
Fourier Transform and Spectra
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Presentation transcript:

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Fourier Transform: From Fourier Series to Fourier Transforms  First, the signal x(t) must satisfy the following condition: 1. x(t) is absolutely integrable on the real line; that is, 2. x(t) is an energy type signal Then the Fourier transform (or Fourier integral) of x(t), defined by The original signal can be obtained from its Fourier transform by

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: FOURIER TRANSFORM The following observations concerning the Fourier transform X(f) is generally a complex function  Its magnitude | X(f) | and phase  X(f) represent the amplitude and phase of various frequency components in x(t)  X(f), | X(f) |, | X(f) | 2 is sometimes referred to as the spectrum of the signal x(t) Shorthand for both FT and iFT relations:  X(f) : Fourier transform of x(t), the notation:  x(t) : Inverse Fourier transform of X(f), the notation: If the variable in the Fourier transform is ω rather than f, then

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: FOURIER TRANSFORM Proof of FT  From FS:  Let

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Example 2.3.1: Example 2.3.2: Example 2.3.3:

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Fourier Transform of Real, Even, and Odd Signals For real x(t), the transform X(f) is a Hermitian function: If, in addition to being real, x(t) is an even signal : the Fourier transform X(f) will be real and even. If x(t) is real and odd : the real part of its Fourier transform vanishes and X( f ) will be imaginary and odd. Figure 2.36 Magnitude and phase of the spectrum of a real signal.

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Signal Bandwidth The bandwidth of a signal represents the range of frequencies present in the signal The higher the bandwidth, the larger the variations in the frequencies present In general, we define the bandwidth of a real signal x(t) as the range of positive frequencies present in the signal In order to find the bandwidth of x(t)  we first find X(f), which is the Fourier transform of x(t)  we find the range of positive frequencies that X(f) occupies The bandwidth is BW = W max – W min  W max : Highest positive frequency present in X(f)  W min : Lowest positive frequency present in X(f)

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Basic Properties of the Fourier Transform Theorem : Linearity Theorem : Duality

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Example 2.3.5: Ex 에서 이므로 Example: Ex 에서 이므로 Example 2.3.6: Ex 에서 이므로 Example 2.3.4:

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Basic Properties of the Fourier Transform Theorem : Shift in Time Domain Theorem : Scaling If a > 1, then x(at) is a contracted form of x(t) If a < 1, x(at) is an expanded version of x(t)  If we expand a signal in the time domain, its frequency-domain representation (Fourier transform) contracts  If we contract a signal in the time domain, its frequency domain representation expands  This is exactly what we expect since contracting a signal in the time domain makes the changes in the signal more abrupt, thus increasing its frequency content.

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Basic Properties of the Fourier Transform Theorem : Convolution  This theorem is very important and is a direct result of the fact that the complex exponentials are eigenfunctions of LTI systems (or, equivalently, eigenfunctions of the convolution operation).  Finding the response of an LTI system to a given input is much easier in the frequency domain than it is the time domain.  This theorem is the basis of the frequency-domain analysis of LTI systems.

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Example 2.3.9: Example : Example :

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Basic Properties of the Fourier Transform Theorem : Modulation This theorem is the dual of the time-shift theorem. The time-shift theorem says that a shift in the time domain results in a multiplication by a complex exponential in the frequency domain The modulation theorem states that a multiplication in the time domain by a complex exponential results in a shift in the frequency domain A shift in the frequency domain is usually called modulation

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Example Determine the Fourier transform of the signal Solution In Chapter 3, we will see that this relation is the basis of the operation of amplitude modulation systems. Figure 2.38 Effect of modulation in both the time and frequency domain.

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Basic Properties of the Fourier Transform Theorem : Parseval’s Relation  If the Fourier transforms of the signals x(t) and y(t) are denoted by X(f) and Y(f) respectively, then  Note that if we let y(t) = x(t), we obtain This is known as Rayleigh's theorem and is similar to Parseval's relation for periodic signals

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Example :

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Basic Properties of the Fourier Transform Theorem : Time Autocorrelation The time autocorrelation function of the signal x(t) is denoted by R x (  ) and is defined by The autocorrelation theorem states that The Fourier transform of the autocorrelation of a signal is always a real-valued, positive function

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Basic Properties of the Fourier Transform Theorem : Differentiation Theorem : Differentiation in the Frequency Domain

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Example : Example : 기출문제 :

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Basic Properties of the Fourier Transform Theorem : Integration Theorem : Moments For the special case of n = 0, we obtain this simple relation for finding the area under a signal, i.e.,

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Fourier Transform Pairs

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Fourier Transform Properties

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Transmission over LTI Systems The output of an LTI system is equal to the convolution of the input and the impulse response of the system If we translate this relationship in the frequency domain using the convolution theorem, then X(f), H(f), and Y(f) are the Fourier transforms of the input, system impulse response, and the output, respectively. The input-output relation for an LTI system in the frequency domain is much simpler than the corresponding relation in the time domain In the time domain, we have the convolution integral; however, in the frequency domain we have simple multiplication To find the output of an LTI system for a given input, we must find the Fourier transform of the input and the Fourier transform of the system impulse response. Then, we must multiply them to obtain the Fourier transform of the output. To get the time-domain representation of the output, we find the inverse Fourier transform of the result

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Transmission over LTI Systems Lowpass signals Signals with a frequency domain representation that contains frequencies around the zero frequency and does not contain frequencies beyond some W l Ideal lowpass filter An LTI system that can pass all frequencies less than some W and rejects all frequencies beyond W An ideal lowpass filter will have a frequency response that is 1 for all frequencies -W  f  W and is 0 outside this interval W is the bandwidth of the filter.

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Transmission over LTI Systems Ideal highpass filter There is unity outside the interval -W  f  W and zero inside Ideal bandpass filters have a frequency response that is unity in some interval W 1  |f|  W 2 and zero otherwise The bandwidth of the filter is W 2 – W 1 Figure 2.45 Various filter types.

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: HILBERT TRANSFORM AND ITS PROPERTIES In this section, we will introduce the Hilbert transform of a signal and explore some of its properties The Hilbert transform is unlike many other transforms because it does not involve a change of domain  In contrast, Fourier, Laplace, and z-transforms start from the time-domain representation of a signal and introduce the transform as an equivalent frequency-domain (or more precisely, transform-domain) representation of the signal The resulting two signals are equivalent representations of the same signal in terms of two different arguments, time and frequency Strictly speaking, the Hilbert transform is not a transform in this sense  First, the result of a Hilbert transform is not equivalent to the original signal, rather it is a completely different signal  Second, the Hilbert transform does not involve a domain change, i.e., the Hilbert transform of a signal x(t) is another signal denoted by in the same domain (i.e., time domain with the same argument t)

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: HILBERT TRANSFORM The Hilbert transform of a signal x(t) is a signal whose absolute frequency components lag the frequency components of x(t) by 90   has exactly the same frequency components present in x(t) with the same amplitude–except there is a 90  phase delay  The Hilbert transform of x(t) = Acos(2  f 0 t +  ) is Acos(2  f 0 t +  - 90  ) = Asin(2  f 0 t +  ) A lag of  /2 at all absolute frequencies  e j2  f 0 t will become  e -j2  f 0 t will become At positive frequencies, the spectrum of the signal is multiplied by -j At negative frequencies, it is multiplied by +j  This is equivalent to saying that the spectrum (Fourier transform) of the signal is multiplied by -jsgn(f).

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: HILBERT TRANSFORM  In this section, assume that x(t) is real The operation of the Hilbert transform is equivalent to a convolution, i.e., filtering

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Example Determine the Hilbert transform of the signal x(t) = 2sinc(2t) Solution We use the frequency-domain approach to solve this problem. Using the scaling property of the Fourier transform, we have In this expression, the first term contains all the negative frequencies and the second term contains all the positive frequencies To obtain the frequency-domain representation of the Hilbert transform of x(t), we use the relation which results in Taking the inverse Fourier transform, we have

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: HILBERT TRANSFORM AND ITS PROPERTIES Evenness and Oddness The Hilbert transform of an even signal is odd, and the Hilbert transform of an odd signal is even  Proof If x(t) is even, then X(f) is a real and even function Therefore, -jsgn(f)X(f) is an imaginary and odd function Hence, its inverse Fourier transform will be odd If x(t) is odd, then X(f) is imaginary and odd Thus -jsgn(f)X(f) is real and even Therefore, is even Sign Reversal Applying the Hilbert-transform operation to a signal twice causes a sign reversal of the signal, i.e.,  Proof

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: HILBERT TRANSFORM AND ITS PROPERTIES Energy The energy content of a signal is equal to the energy content of its Hilbert transform  Proof Using Rayleigh's theorem of the Fourier transform, we have Orthogonality The signal x(t) and its Hilbert transform are orthogonal  Proof Using Parseval's theorem of the Fourier transform, we obtain In the last step, we have used the fact that X(f) is Hermitian; | X(f)| 2 is even

Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: Recommended Problems Textbook Problems from p , , , (b) , , , , (a), 2.49.(d), 2.49.(e) , , 2.62, 2.63, 2.65