EECS 20 Chapter 10 Part 11 Sampling and Reconstruction Last time we Viewed aperiodic functions in terms of frequency components via Fourier transform Gained.

Slides:



Advertisements
Similar presentations
DCSP-11 Jianfeng Feng
Advertisements

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),
Fourier Transform – Chapter 13. Fourier Transform – continuous function Apply the Fourier Series to complex- valued functions using Euler’s notation to.
President UniversityErwin SitompulSMI 7/1 Dr.-Ing. Erwin Sitompul President University Lecture 7 System Modeling and Identification
CEN352, Dr. Ghulam Muhammad King Saud University
Review of Frequency Domain
EECS 20 Chapter 10 Part 11 Fourier Transform In the last several chapters we Viewed periodic functions in terms of frequency components (Fourier series)
EECS 20 Chapter 12 Part 11 Stability and Z Transforms Last time we Explored sampling and reconstruction of signals Saw examples of the phenomenon known.
EECS 20 Chapter 8 Part 21 Frequency Response Last time we Revisited formal definitions of linearity and time-invariance Found an eigenfunction for linear.
1.The Concept and Representation of Periodic Sampling of a CT Signal 2.Analysis of Sampling in the Frequency Domain 3.The Sampling Theorem — the Nyquist.
Overview of Sampling Theory
EE-2027 SaS, L10: 1/13 Lecture 10: Sampling Discrete-Time Systems 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
EECS 20 Chapter 9 Part 21 Convolution, Impulse Response, Filters Last time we Revisited the impulse function and impulse response Defined the impulse (Dirac.
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.
Leo Lam © Signals and Systems EE235. Transformers Leo Lam ©
SAMPLING & ALIASING. OVERVIEW Periodic sampling, the process of representing a continuous signal with a sequence of discrete data values, pervades the.
The Nyquist–Shannon Sampling Theorem. Impulse Train  Impulse Train (also known as "Dirac comb") is an infinite series of delta functions with a period.
Chapter 4: Sampling of Continuous-Time Signals
FT Representation of DT Signals:
The sampling of continuous-time signals is an important topic It is required by many important technologies such as: Digital Communication Systems ( Wireless.
Fourier representation for discrete-time signals And Sampling Theorem
Discrete-Time and System (A Review)
EE421, Fall 1998 Michigan Technological University Timothy J. Schulz 08-Sept, 98EE421, Lecture 11 Digital Signal Processing (DSP) Systems l Digital processing.
Chapter 5 Frequency Domain Analysis of Systems. Consider the following CT LTI system: absolutely integrable,Assumption: the impulse response h(t) is absolutely.
Fourier Analysis of Systems Ch.5 Kamen and Heck. 5.1 Fourier Analysis of Continuous- Time Systems Consider a linear time-invariant continuous-time system.
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 Prof. H. Sameti Chapter 7: The Concept and Representation of Periodic Sampling of a CT Signal Analysis of Sampling in the Frequency.
Leo Lam © Signals and Systems EE235 Lecture 28.
Chapter 2 Discrete System Analysis – Discrete Signals
Sampling Theorems. Periodic Sampling Most signals are continuous in time. Example: voice, music, images ADC and DAC is needed to convert from continuous-time.
Fourier Series Summary (From Salivahanan et al, 2002)
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 5 Ideal Filters, Sampling, and Reconstruction Sections Wed. June 26, 2013.
1 Prof. Nizamettin AYDIN Advanced Digital Signal Processing.
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.
Notice  HW problems for Z-transform at available on the course website  due this Friday (9/26/2014) 
Lecture 7: Sampling Review of 2D Fourier Theory We view f(x,y) as a linear combination of complex exponentials that represent plane waves. F(u,v) describes.
Prof. Brian L. Evans Dept. of Electrical and Computer Engineering The University of Texas at Austin Lecture 4 EE 345S Real-Time.
Leo Lam © Signals and Systems EE235 Leo Lam.
Fourier Analysis of Signals and Systems
1 Digital Signal Processing Lecture 3 – 4 By Dileep kumar
Technological Educational Institute Of Crete Department Of Applied Informatics and Multimedia Neural Networks Laboratory Slide 1 FOURIER TRANSFORMATION.
Leo Lam © Signals and Systems EE235. Leo Lam © Fourier Transform Q: What did the Fourier transform of the arbitrary signal say to.
EE104: Lecture 11 Outline Midterm Announcements Review of Last Lecture Sampling Nyquist Sampling Theorem Aliasing Signal Reconstruction via Interpolation.
Digital Signal Processing
ABE425 Engineering Measurement Systems Fourier Transform, Sampling theorem, Convolution and Digital Filters Dr. Tony E. Grift Dept. of Agricultural.
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.
Lecture 3: The Sampling Process and Aliasing 1. Introduction A digital or sampled-data control system operates on discrete- time rather than continuous-time.
Continuous-time Signal Sampling
Topics 1 Specific topics to be covered are: Discrete-time signals Z-transforms Sampling and reconstruction Aliasing and anti-aliasing filters Sampled-data.
2D Fourier Transform.
Chapter 2 Ideal Sampling and Nyquist Theorem
Digital Signal Processing
Lecture 1.4. Sampling. Kotelnikov-Nyquist Theorem.
Sampling and DSP Instructor: Dr. Mike Turi Department of Computer Science & Computer Engineering Pacific Lutheran University.
Chapter 4 Dynamical Behavior of Processes Homework 6 Construct an s-Function model of the interacting tank-in-series system and compare its simulation.
Chapter 4 Dynamical Behavior of Processes Homework 6 Construct an s-Function model of the interacting tank-in-series system and compare its simulation.
SAMPLING & ALIASING.
7.0 Sampling 7.1 The Sampling Theorem
Zhongguo Liu Biomedical Engineering
Lecture 10 Digital to Analog (D-to-A) Conversion
The sampling of continuous-time signals is an important topic
Sampling and the Discrete Fourier Transform
Chapter 3 Sampling.
DIGITAL CONTROL SYSTEM WEEK 3 NUMERICAL APPROXIMATION
Presentation transcript:

EECS 20 Chapter 10 Part 11 Sampling and Reconstruction Last time we Viewed aperiodic functions in terms of frequency components via Fourier transform Gained insight into the meaning of Fourier transform through comparison with Fourier series Defined (continuous-time) Fourier transform and DTFT and computed transforms for some aperiodic and periodic signals Identified useful properties of the Fourier transform Today we will Explore sampling and reconstruction of signals See examples of the phenomenon known as aliasing Find the sampling rate needed for accurate reconstruction Learn about the Nyquist-Shannon Sampling theorem Describe different types of reconstruction

EECS 20 Chapter 10 Part 12 Sampling Let’s define a system called Sampler that converts a continuous- time signal to a discrete-time signal by sampling every T seconds: Sampler T : [Reals  Complex]  [Integers  Complex]  x  [Reals  Complex] and  n  Integers, Sampler T (x)(n) = x(nT)

EECS 20 Chapter 10 Part 13 Sampling Sinusoids: Aliasing Suppose we have a sinusoid with frequency f (in Hertz) that we want to sample. x(t) = cos(2  ft+  ) Sampling the signal at sampling frequency f s = 1/T yields Sampler T (x)(n) = cos(2  fnT+  ) = cos(2  n(f/f s )+  ) Notice that a sinusoid with frequency f′ = f + k f s (k  Integers) yields an identical sampled signal! x′(t) = cos(2  (f + k f s )t+  ) Sampler T (x′)(n) = cos(2  n(f + k f s )/f s +  ) = cos(2  n(f/f s )+2  nk+  ) = cos(2  n(f/f s )+  )

EECS 20 Chapter 10 Part 14 Aliasing Thus, when we try to reconstruct a sinusoid from its samples, we can’t know what frequency the original sinusoid had (unless we are given more information). Every discrete-time signal has many continuous-time “identities”. We call this phenomenon aliasing. We want to reconstruct back to the original continuous signal, not an alias of the original signal. If we have more information about the original signal, e. g., we know that its frequency lies within some range, we may be able to rule out all but one of the aliases.

EECS 20 Chapter 10 Part 15 Nyquist Frequency Suppose we have samples of a sinusoid, and we want to reconstruct the original continuous-time sinusoid. If we know that the frequency f of the original continuous-time sinusoid lies within the interval [0, ½ f s ), then we have ruled out all but one of the possibilities, and have uniquely identified the original signal. We can accurately reconstruct any continuous-time signal from samples as long as the sampling frequency f s is at least twice as large as the highest frequency component in the original signal. The frequency ½ f s is known as the Nyquist frequency. It is the highest frequency we can reconstruct from a sampler.

EECS 20 Chapter 10 Part 16 Reconstruction There are many different ways to reconstruct a signal. Zero-order hold: Create the continuous signal x(t) by holding each sample y(n) constant over the time period nT to (n+1)T. First-order hold: (Linear interpolation) For t between nT and (n+1)T, x(t) varies linearly from x(t)=y(n) at t=nT to x(t)=y(n+1) at t=(n+1)T. Ideal interpolation: The method that reconstructs sinusoids exactly. We will define this rigorously. Each method of interpolation is itself a system, with domain [Integers  Complex] and range [Reals  Complex]. We will now mathematically define each of these systems.

EECS 20 Chapter 10 Part 17 Interpolation as Composition of Systems We will represent each method of interpolation as the composition of a special system we will call ImpulseGen T, and another system particular to the method of interpolation. We define the system ImpulseGen T : [Integers  Complex]  [Reals  Complex] " y  [Integers  Complex] and  t  Reals, The system creates a signal with Dirac delta functions of height y(n) at each time t = nT. Visualize it as a system that turns samples into Dirac delta functions.

EECS 20 Chapter 10 Part 18 Defining Methods of Interpolation To perform the interpolation, the signal is first sent through ImpulseGen T. The output of ImpulseGen T is then sent through an LTI system that will determine the method of interpolation. For zero-order hold, the LTI system has impulse response For first-order hold (linear interpolation), For ideal interpolation, the impulse response is

EECS 20 Chapter 10 Part 19 Nyquist-Shannon Sampling Theorem The ideal interpolation is important because it makes possible the perfect recovery of any signal as long as its highest frequency component is less than the Nyquist frequency. The Nyquist-Shannon Sampling Theorem states: If x is a continuous-time signal with Fourier transform X and if X(  ) is zero outside the range -  /T <  <  /T rad/s, then x = IdealInterpolator T (Sampler T (x)) where IdealInterpolator T is the composition of ImpulseGen T and the LTI system defined on the previous slide.

EECS 20 Chapter 10 Part 110 Justification for the Sampling Theorem While the formal proof for the theorem is rather technical (you can find it in a DSP book) we will give the intuition behind it: Let’s consider what Sampler T and IdealInterpolator T do to a signal from a frequency standpoint. The signal x passes through Sampler T first, creating a signal y. Page 437 of the text shows that when a signal is sampled, the old CTFT X and new DTFT Y are related as follows: The CTFT of the original signal is copied and shifted by 2  k/T. If the original CTFT is zero outside the interval -  /T <  <  /T then the copies won’t overlap!

EECS 20 Chapter 10 Part 111 Justification for the Sampling Theorem Now consider what ImpulseGen T does to the sampled signal y. According to page 437 in the text, the Fourier transforms of these two signals are related by Finally, consider what the LTI system does to the signal w. For CTFT 

EECS 20 Chapter 10 Part 112 Justification for the Sampling Theorem We know that if we pass a signal through an LTI system, the Fourier transform of the output is the product of the Fourier transform of the input and the frequency response. So, the output z of the LTI system has Fourier transform To make Z, we take copies of X, each shifted by 2  k/T, and then cut away anything outside of the interval -  /T <  <  /T. Z is the same as X if X(  ) was originally zero outside the interval -  /T <  <  /T.