UNIT-II FOURIER TRANSFORM

Slides:



Advertisements
Similar presentations
Signals and Fourier Theory
Advertisements

Ch 3 Analysis and Transmission of Signals
Symmetry and the DTFT If we know a few things about the symmetry properties of the DTFT, it can make life simpler. First, for a real-valued sequence x(n),
Chapter 8: The Discrete Fourier Transform
PROPERTIES OF FOURIER REPRESENTATIONS
Fourier Theory and its Application to Vision
Meiling chensignals & systems1 Lecture #04 Fourier representation for continuous-time signals.
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.
3.0 Fourier Series Representation of Periodic Signals
Goals For This Class Quickly review of the main results from last class Convolution and Cross-correlation Discrete Fourier Analysis: Important Considerations.
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.
Fourier representation for discrete-time signals And Sampling Theorem
Discrete-Time and System (A Review)
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.
DTFT And Fourier Transform
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.
Signals and Systems Jamshid Shanbehzadeh.
Course Outline (Tentative)
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]
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.
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.
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.
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
Fourier Analysis of Discrete Time Signals
3.0 Fourier Series Representation of Periodic Signals 3.1 Exponential/Sinusoidal Signals as Building Blocks for Many Signals.
CH#3 Fourier Series and Transform
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.
7- 1 Chapter 7: Fourier Analysis Fourier analysis = Series + Transform ◎ Fourier Series -- A periodic (T) function f(x) can be written as the sum of sines.
2D Sampling Goal: Represent a 2D function by a finite set of points.
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.
1 Roadmap SignalSystem Input Signal Output Signal characteristics Given input and system information, solve for the response Solving differential equation.
Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: 2.3 Fourier Transform: From Fourier Series to Fourier Transforms.
Ch # 11 Fourier Series, Integrals, and Transform 1.
بسم الله الرحمن الرحيم University of Khartoum Department of Electrical and Electronic Engineering Third Year – 2015 Dr. Iman AbuelMaaly Abdelrahman
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
The Fourier Transform.
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.
Math for CS Fourier Transform
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:
الفريق الأكاديمي لجنة الهندسة الكهربائية 1 Discrete Fourier Series Given a periodic sequence with period N so that The Fourier series representation can.
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Lecture 19 Spectrogram: Spectral Analysis via DFT & DTFT
Signals & systems Ch.3 Fourier Transform of Signals and LTI System
The Discrete Fourier Transform
EE Audio Signals and Systems
Chapter 2. Fourier Representation of Signals and Systems
UNIT II Analysis of Continuous Time signal
The sampling of continuous-time signals is an important topic
Chapter 8 The Discrete Fourier Transform
Sampling the Fourier Transform
Signals & Systems (CNET - 221) Chapter-5 Fourier Transform
Chapter 8 The Discrete Fourier Transform
Lesson Week 8 Fourier Transform of Time Functions (DC Signal, Periodic Signals, and Pulsed Cosine)
Chapter 8 The Discrete Fourier Transform
Signals and Systems Lecture 15
4. The Continuous time Fourier Transform
Chapter 3 Sampling.
CE Digital Signal Processing Fall Discrete Fourier Transform (DFT)
DIGITAL CONTROL SYSTEM WEEK 3 NUMERICAL APPROXIMATION
Presentation transcript:

UNIT-II FOURIER TRANSFORM

Introduction We have seen that periodic signals can be represented with the Fourier series Can aperiodic signals be analyzed in terms of frequency components? Yes, and the Fourier transform provides the tool for this analysis

Introduction Contd. Time Discrete Fourier Periodic Series Transform Continuous Time Periodic Aperiodic

Fourier Transform in the General Case Given a signal x(t), its Fourier transform is defined as A signal x(t) is said to have a Fourier transform in the ordinary sense if the above integral converges

Existence of Fourier Transform The integral does converge if the signal x(t) is “well-behaved” and x(t) is absolutely integrable, namely, Note: well behaved means that the signal has a finite number of discontinuities, maxima, and minima within any finite time interval

Example: The DC or Constant Signal Consider the signal Clearly x(t) does not satisfy the first requirement since Therefore, the constant signal does not have a Fourier transform in the ordinary sense

Rectangular Form of the Fourier Transform Consider Since in general is a complex function, by using Euler’s formula

Fourier Transform of Real-Valued Signals If x(t) is real-valued, it is Moreover whence Hermitian symmetry

Inverse Fourier Transform Given a signal x(t) with Fourier transform , x(t) can be recomputed from by applying the inverse Fourier transform given by Transform pair

Properties of the Fourier Transform Linearity: Left or Right Shift in Time: Time Scaling:

Properties of the Fourier Transform Time Reversal: Multiplication by a Power of t: Multiplication by a Complex Exponential:

Properties of the Fourier Transform Multiplication by a Sinusoid (Modulation): Differentiation in the Time Domain:

Properties of the Fourier Transform Integration in the Time Domain: Convolution in the Time Domain: Multiplication in the Time Domain:

Properties of the Fourier Transform Parseval’s Theorem: Duality: if

Generalized Fourier Transform Fourier transform of Applying the duality property generalized Fourier transform of the constant signal

Generalized Fourier Transform of Sinusoidal Signals

Fourier Transform of Periodic Signals Let x(t) be a periodic signal with period T; as such, it can be represented with its Fourier transform Since , it is

Fourier Transform of the Unit-Step Function Since using the integration property, it is

Sampling Sampling is a continuous to discrete-time conversion. Most common sampling is periodic If a function x(t) contains no frequencies higher than B Hz, it is completely determined by giving its ordinates at a series of points spaced 1/(2B) seconds apart.

Types of Sampling

Sampling Theorem Statement: A continuous time signal can be represented in its samples and can be recovered back when sampling frequency fs is greater than or equal to the twice the highest frequency component of message signal. i. e. fs≥2fm.

Nyquist sampling rate for low-pass and band pass signals

Aliasing Effect Aliasing is a phenomenon where the high frequency components of the sampled signal interfere with each otherbecause of inadequate sampling fs  < 2fm . The overlapped region in case of under sampling represents aliasing effect, which can be removed by considering fs >2fm By using anti aliasing filters.

Fourier Transform Signal Analysis and Processing (1)Time Domain Analysis: t-A (2)Frequency Domain Analysis: f-A Fourier Transform 这里是否应该加入对频谱分析的一点解释呢? in time-domain in frequency-domain In some situation, signal’s frequency spectrum can represent its characteristics more clearly.

? Fourier Transform Signal Analysis and Processing: (1)Time Domain Analysis (2)Frequency Domain Analysis Fourier Transform is a bridge from time domain to frequency domain. Characteristic: continuous—discrete, periodic—nonperiodic . Type: Continuous periodic signals ? Continuous nonperiodic signals Discrete nonperiodic signals Discrete periodic signals

Continuous non-periodic function’s Fourier Transform Time-domain Frequency-domain Conclusion : Continuous non-periodic function— Non-periodic continuous function

Discrete-time non-periodic sequence’s Fourier Transform Time-domain Frequency-domain Conclusion : Discrete non-periodic function— Continuous-time periodic function

Periodic  Discrete; NonperiodicContinuous Conclusion (1)Sampling in time domain brings periodicity in frequency domain. (2)Sampling in frequency domain brings periodicity in time domain. (3)Relationship between frequency domain and time domain Time domain Frequency domain Transform Continuous periodic Discrete non-periodic Fourier series Continuous non-periodic Continuous non-periodic Fourier Transform Discrete non-periodic Continuous periodic Sequence’s Fourier Transform Discrete periodic Discrete periodic Discrete Fourier Series Periodic  Discrete; NonperiodicContinuous

Basic idea of Discrete Fourier Transform In practical application, signal processed by computer has two main characteristics: (1) Discrete (2) Finite length Similarly, signal’s frequency must also have two main characteristics: (1) Discrete (2) Finite length But nonperiodic sequence’s Fourier Transform is a continuous function of , and it is a periodic function in  with a period 2. So it is not suitable to solve practical digital signal processing. Idea: Expand finite-length sequence to periodic sequence, compute its Discrete Fourier Series, so that we can get the discrete spectrum in frequency domain.

Discrete Fourier Transform-DFT Periodic sequence and its DFS

Discrete Fourier Transform-DFT Periodic sequence is infinite length. but only N sequence values contain information. Periodic sequence  finite length sequence. Relationship between these sequences? Infinite  Finite Periodic  Nonperiodic 周期序列和有限长序列存在本质上的联系

Discrete Fourier Transform-DFT Relationship between periodic sequence and finite-length sequence Periodic sequence can be seen as periodically copies of finite-length sequence. Finite-length sequence can be seen as extracting one period from periodic sequence. Finite-duration Sequence Periodic Sequence Main period

Properties of DTFT

Properties of DTFT

Convolution Property

Multiplication Property