Review: Continuous Fourier Transform

Similar documents
Fourier Transform for Continuous Functions

Continuous Fourier transform of a Gaussian Function

IB Paper 6: Signal and Data Analysis

Interchange of Filtering and Downsampling/Upsampling

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n.

Chapter 6: Applications of Fourier Representation Houshou Chen

X. Chen More on Sampling

Homework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt

Linear Convolution Using FFT

EA2.3 - Electronics 2 1

EE 224 Signals and Systems I Review 1/10

Fourier transform. Stefano Ferrari. Università degli Studi di Milano Methods for Image Processing. academic year

Digital Signal Processing. Midterm 1 Solution

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization

Chapter 5 Frequency Domain Analysis of Systems

so mathematically we can say that x d [n] is a discrete-time signal. The output of the DT system is also discrete, denoted by y d [n].

Discrete-time Signals and Systems in

ESS Dirac Comb and Flavors of Fourier Transforms

Chapter 5 Frequency Domain Analysis of Systems

EE Homework 13 - Solutions

Tutorial Sheet #2 discrete vs. continuous functions, periodicity, sampling

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches

Fourier Series Summary (From Salivahanan et al, 2002)

Module 3 : Sampling and Reconstruction Lecture 22 : Sampling and Reconstruction of Band-Limited Signals

L6: Short-time Fourier analysis and synthesis

Chapter 8 The Discrete Fourier Transform

ECE 301 Fall 2011 Division 1 Homework 10 Solutions. { 1, for 0.5 t 0.5 x(t) = 0, for 0.5 < t 1

EC Signals and Systems

Question Paper Code : AEC11T02

Chap 4. Sampling of Continuous-Time Signals

Bridge between continuous time and discrete time signals

Continuous Time Signal Analysis: the Fourier Transform. Lathi Chapter 4

Review of Discrete-Time System

Signals & Systems. Chapter 7: Sampling. Adapted from: Lecture notes from MIT, Binghamton University, and Purdue. Dr. Hamid R.

ESS Finite Impulse Response Filters and the Z-transform

DESIGN OF CMOS ANALOG INTEGRATED CIRCUITS

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2)

3.2 Complex Sinusoids and Frequency Response of LTI Systems

Discrete-Time David Johns and Ken Martin University of Toronto

Lecture 3 January 23

Aspects of Continuous- and Discrete-Time Signals and Systems

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 20, Cover Sheet

E : Lecture 1 Introduction

Each problem is worth 25 points, and you may solve the problems in any order.

ECG782: Multidimensional Digital Signal Processing

University Question Paper Solution

Generation of bandlimited sync transitions for sine waveforms

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

FROM ANALOGUE TO DIGITAL

ECE 301: Signals and Systems Homework Assignment #7

Lecture 27 Frequency Response 2

/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by

LECTURE 12 Sections Introduction to the Fourier series of periodic signals

Discrete Fourier Transform

DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010

ELEG 3124 SYSTEMS AND SIGNALS Ch. 5 Fourier Transform

Chapter 2: Problem Solutions

The Discrete-time Fourier Transform

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

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

Solution 7 August 2015 ECE301 Signals and Systems: Final Exam. Cover Sheet

Continuous-Time Fourier Transform

The Continuous-time Fourier

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

NAME: 11 December 2013 Digital Signal Processing I Final Exam Fall Cover Sheet

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, Cover Sheet

Fourier Series and Fourier Transforms

MEDE2500 Tutorial Nov-7

Discrete Time Fourier Transform (DTFT)

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.

Multirate Digital Signal Processing

Topic 3: Fourier Series (FS)

2A1H Time-Frequency Analysis II

Signals and Systems. Lecture 14 DR TANIA STATHAKI READER (ASSOCIATE PROFESSOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON

Lecture 28 Continuous-Time Fourier Transform 2

Discrete-Time Fourier Transform

Image Acquisition and Sampling Theory

Sensors. Chapter Signal Conditioning

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin

2A1H Time-Frequency Analysis II Bugs/queries to HT 2011 For hints and answers visit dwm/courses/2tf

Fourier Analysis of Signals Using the DFT

Signals & Systems. Lecture 5 Continuous-Time Fourier Transform. Alp Ertürk

Review of Analog Signal Analysis

Let H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )

! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals

Overview of Sampling Topics

EE422G Homework #9 Solution

HST.582J / 6.555J / J Biomedical Signal and Image Processing Spring 2007

8 The Discrete Fourier Transform (DFT)

Discrete-Time Signals: Time-Domain Representation

Elec4621 Advanced Digital Signal Processing Chapter 11: Time-Frequency Analysis

ECE 350 Signals and Systems Spring 2011 Final Exam - Solutions. Three 8 ½ x 11 sheets of notes, and a calculator are allowed during the exam.

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Solutions for Problem Set 2

Sampling. Alejandro Ribeiro. February 8, 2018

Discrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz

Discrete-Time Signals: Time-Domain Representation

Images have structure at various scales

Flash File. Module 3 : Sampling and Reconstruction Lecture 28 : Discrete time Fourier transform and its Properties. Objectives: Scope of this Lecture:

ECE-314 Fall 2012 Review Questions for Midterm Examination II

Transcription:

Review: Continuous Fourier Transform

Review: convolution x t h t = x τ h(t τ)dτ

Convolution in time domain Derivation

Convolution Property Interchange the order of integrals Let

Convolution Property By substitution back, Convolution property is one of the most important properties in Fourier transform.

Note that the above is only a conceptual formulation. For different definitions of the continuous Fourier transform, the convolution property is also a slight different according to how to decomposes the scaling 1/2. Review: Convolution Property Due to the duality of frequency and time domains, we also have the property that multiplication in the time domain corresponds to the convolution in the frequency domain: That is

Review: Convolution Property For the continuous-time Foruier transform pair defined below, F Forward jw f t e The convolution property is Time domain Backward jwt 1 dt f t F jw e 2 Frequency domain jwt dw There is a scaling factor

Review: Fourier transform of periodic Signals Example: time domain a periodic square wave

Review: Frequency domain of squared wave

This Week

Impulse Train Remember that the continuous Fourier transform of a periodic signal is an impulse sequence. What happens when the periodic signal is itself an impulse sequence? An example of such signal is the impulse train: According to the duality between the time and frequency domains of continuous Fourier transform, its Fourier transform should be an impulse sequence that is also periodic.

Impulse Train What is the continuous Fourier Transform of p(t)?

Impulse Train Derivation: because p(t) is a periodic signal, it can be expressed by Fourier series: where

Impulse Train To determine the coefficients a k of Fourier series, we must evaluate the Fourier series integral over one period [ T s /2, T s /2]. Since p(t) is the impulse training with period T s, there is only a single delta function, (t), within the period [ T s /2, T s /2]. Hence,

Impulse Train Remember that we have the property about the inner product of an impulse function and an arbitrary signal: Hence, when a = 0 and f x = e jkω st

Impulse Train According to the transform pair of periodic signals in course 3, the continuous Fourier transform of a periodic signal is in general of the form of sum of delta functions centered at integer multiples of s : Hence, the Fourier transform of the impulse train p(t) is another impulse train

Continuous Fourier Transform We have introduced the continuous Fourier transform and investigate several of its transform pairs. The continuous Fourier transform defines completely and exactly the frequency domain, where the frequency domain is continuous and range un-limited.

Finite Duration Signal and Band Limited Signal Finite Duration Signal: A signal x(t) is nonzero in [-t b, t b ] for some t b >0, and is zero elsewhere. Band Limited Signal: A signal s frequency is nonzero in the frequency band [-w b, w b ] for some w b >0, and s zero elsewhere. Finite duration in time domain Band limited in frequency domain Band unlimited in frequency domain Infinite duration in time domain

Finite Duration Signal and Band Because a finite-duration signal can be represented as the multiplication of some signal of a rectangular window. Time domain multiplication, frequency domain is the convolution of the sync function. Since the sync function is band unlimited. The convolution of it and any function is generally band unlimited. Limited Signal

Finite Duration Signal and Band Limited Signal Similarly, a band-limited signal can be represented as the multiplication of some spectrum of a rectangular window in frequency domain. Frequency domain multiplication, time domain is the convolution with the sync function. Since the sync function is infinite durational. The convolution of it and any function is infinite durational.

Discrete-time Signals in Continuous Domain How to represent a discrete-time signal in the time domain for continuous Fourier transform? A discrete-time signal can be represented as a sequence of impulse functions (an impulse train) occurred at equally spaced time instances, in the continuous-functional domain.

Discrete-time Signals A common way to obtain a discrete-time signal is to sample a continuous-time signal at equally spaced time instances. Referred to as uniform sampling: Impulse Sequence

Continuous Fourier Transform of an Impulse Sequence Recall When the frequency domain spectrum is an equally-spaced impulse sequence, what is the time domain signal? The time-domain signal is a periodic function.

Continuous Fourier Transform of an Impulse Sequence Remember that Continuous Fourier transform is timefrequency analogous. Forward Backward F jw f t e 1 jwt dt f t F jw e 2 jwt dw

Continuous Fourier Transform of an Impulse Sequence If we (purposively) perform forward transform for the complex conjugate of the frequency domain spectrum F*(jw) and exchange the roles of w and t, we have the following symmetry property of the Fourier transform: * * jwt * F jw e dw F jw e dw f t jwt 2 ( ) Forward transform of F*(jw) apply the rule of Backward transform

Continuous Fourier Transform of an Impulse Sequence Remember that when F(jw) is an equallyspaced impulse sequence, f(t) is a periodic function. By exchanging the variables w and t, we have * jtw * F jt e dt f w 2 ( ) That is, when F*(jt) is a time-domain signal, its frequency domain spectrum is 2 f*(w).

Continuous Fourier Transform of an Impulse Sequence Taking the complex conjugate of f(t) or F(jw) does not affect the properties of being a periodic function or an impulse sequence. So, when the time domain signal is an equally-spaced impulse sequence, the frequency domain spectrum is a periodic function.

Continuous Fourier Transform of an Impulse Sequence The spectrum is a periodic function: Hence, the frequency components appear repeatedly from low frequency bands to very high (unlimited) frequency bands. It means that a discrete-time signal always has very high frequency components, since the spectrum is repeated (toward infinity). This is because that impulse signals can be treated as a high-oscillation in a very short time interval.

Sampling a Continuous Function The property that a discrete-time signal always has very high frequency components could violate our intuition. It is because that it is quite often the situation that a discretetime signal are samples from a relatively smoother continuous-time signals. What is the relationship between the spectra of the continuous-time signal and the sampled signal?

Sampling Theorem Given an analog (i.e., continuous-time) signal x a (t) Let us assume that a discrete-time signal x a (nt) (n is an integer) is uniformly sampled from the analog signal x a (t) with the time step T. Recall that the sampled signal can be represented as the following form via delta functions: x ( t) x ( nt ) ( t nt ) s n a

Sampled Signals It can also be represented as the multiplication of the continuous-time signal x a (t) and the impulse train signal That is s t t nt x t x t s t x t t nt s a a

Impulse train signal

Examples of x s (t) for two sampling rates

Using Convolution Let us now consider the continuous Fourier transform of x s (t). Since x s (t) is a product of x a (t) and s(t), its frequency domain corresponds to the convolution of X a (jw) and S(jw) (divided by the scaling factor 2 ) Time domain Frequency domain

Remember that the continuous Fourier transform of a periodic impulse train s(t) is still a periodic impulse train with the period w s =2 /T. S jw = 2π T k= δ(w kw s ) where w s =2 /T (or f s = 1/T) is the sampling frequency in radians/s.

It follows that in the frequency domain X s jw = 1 2π X a(jw) S(jw) Hence, we see that the copies of X a (jw) are shifted by integer multiples of the sampling frequency, and then superimposed to product the periodic Fourier transform of the sampled signal. 1 X jw X j w kw T s a s k

Uniformly Sampling a Continuous Function 1 2 r X s jw X a jw j T r T What does it mean? Remember that X a (jw) is the spectrum of the analog signal x a (t) X s (jw) is the spectrum of the uniformly sampled signal x s (t) The equation means that X s (jw) is a periodic duplication of the continuous Fourier transform X a (jw) a period 2 /T = w s and scaled by T.

Illustration: Frequency domain convolution This is a case of non-overlapping

Illustration: Frequency domain convolution The above shows the case without overlapping. When Ω N is getting larger, there will be overlapping between the duplicates of X c (jω)

Aliasing Effect Because of the overlapping effect, more commonly known as aliasing, there is no way of retrieving X a (jw) from X s (jw) In other words, we have lost the information contained in the analog function x a (t) if the aliasing occurs when we perform uniform sampling on it.

Aliasing Effect How to avoid aliasing? Band-limited signal: the continuous signal x a (t) is band limited if its Fourier transform X a (jw) = 0 for w >w b, where w b is a frequency bound. For a signal that is not band-limited, there is no chance to avoid aliasing.

Illustration for Avoid Aliasing A case without aliasing:

Illustration for Avoid Aliasing In this case, aliasing occurs:

Avoid Aliasing From the above illustrations, we can see that If the continuous signal x a (t) is a band-limited signal with the bound w b, then, the aliasing can be avoided when the sampling frequency is chosen such that w s > 2w b. When there is no aliasing, we can reconstruct the continuous signal from its uniform samples.

Sampling Theorem To avoid the situation of aliasing, the sampling frequency shall be larger than twice of the highest frequency of the continuous signal. Nyquist sampling theorem: f b (= w b /2 ) is called the Nyquist frequency, and 2f b is called the Nyquist rate.

Further illustration Continuous signal Sampled signal The magnitude spectrum of the continuous signal The spectrum of the sampled signal

Time-domain Example of Aliasing In the above, the aliasing is analyzed in frequency domain. What does it happen in time domain? From the sampling theorem, we see that aliasing occurs when the sampling rate w s is not high enough. For example, when we sample a sinusoidal signal with a low frequency, we can see the aliasing effect in time domain.

Example: sampling with sufficiently large rates.

Eg., sampling of insufficient rate: a 100 Hz sinusoid at f s =80 samples/sec.

Reconstruct the continuous-time signal from the sampled signal If a band-limited signal is sampled with a frequency higher than the Nyquist rate, then it is possible to reconstruct the original continuous-time signal. Ideal low-pass filter: a system for which the frequency response is unity over a low range of frequencies and is zero at the high frequencies.

Ideal low-pass filter: frequency domain In frequency domain: the effect is equivalent to multiply the spectrum of the input signal and the rectangular window of the ideal low-pass filter.

Reconstruction and Anti-aliasing filter For a band-limited signal, if we sample it with a sufficient high rate (higher than the Nyquist rate), then it can be recovered exactly by ideal low-pass filter. Ideal low pass filter can also serve as an antialiasing filter when the signal is not band-limited (which is common in practice). In this way, some rear frequencies of the signal s spectrum will be discarded or sacrificed, but the aliasing effect is avoided.

Ideal low-pass filter: time domain In frequency domain, multiplication of a rectangle window is performed for an ideal low-pass filter. In time domain, convolution is performed. Recall the Fourier transform of a rectangular function is a sync function.

Sync Function Interpolation Hence, in time domain, ideal low-pass filter acts as convolution with the sync function.

Discrete-time signals Remember that the spectrum of a discrete-time signal is periodic, which always has very high frequency. However, if we assume that the discrete-time signal is sampled from a continuous function following the sampling theorem, we can use the sync function to interpolate the continuous-time signal, and the spectrum is band-limited. In this way, the discrete-time signal can be imaged as samples from a smooth function.

Fourier Transform of Discrete-time Signals From Fourier Series: time domain is periodic, then frequency domain is discrete Remember that the continuous Fourier transform has similar forms of forward and inverse transforms. Question: When time domain is discrete, what happens in the frequency domain? The frequency domain is periodic Discrete time Fourier transform: dealing with the case where time domain is a discrete-time signal, x[-2t], x[-t], x[0], x[t], x[2t], (T is the time step)

Discrete-time Fourier Transform We have seen that a set of discrete samples can be represented as a series of impulses in the continuous domain. The Fourier transform of such a signal is a periodic function with the period 2 /T. The spectrum is only informative within a single period [- /T, /T] because others are repetitive or can be ignored by the smoothness assumption. In particular, there could also be signals that are discrete-time by nature (not necessarily samples of a continuous function) Therefore, the discrete-time Fourier transform (DTFT) is introduced for the spectrum representation the discrete-time signals, just like that Fourier series is particular for periodic function.

DTFT The DTFT pair is defined as follows: Let x(n) be a discrete-time signal, n Z. forward DTFT: inverse DTFT: Note that we do not incorporate the sampling period T in the transform. It can be treated as the normalized case of T=1.

DTFT In digital signal processing, discrete-time signals are of the main interest, and DTFT is a main tool for analyzing such a signal. Since the frequency spectrum repeats periodically with the period 2, we usually consider only a finite-duration [, ]. We can bear in mind that, if we have the knowledge that the discrete-time signal is sampled from an analog signal by sampling theorem, then the DTFT spectrum is exactly the analog spectrum cut by an ideal low-pass filter.

DTFT When the discrete-time signal are sampled from a continuous function and knowing the sampling period T, the DTFT frequency corresponds to the analog frequency /T. High frequency region: The frequency nearing or. Low frequency region: The frequency nearing 0. DTFT is suitable to model the frequency response of discrete-time systems; will be introduced later.