7.0 Sampling 7.1 The Sampling Theorem

Slides:



Advertisements
Similar presentations
Signals and Systems Fall 2003 Lecture #13 21 October The Concept and Representation of Periodic Sampling of a CT Signal 2. Analysis of Sampling.
Advertisements

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
EECS 20 Chapter 10 Part 11 Sampling and Reconstruction Last time we Viewed aperiodic functions in terms of frequency components via Fourier transform Gained.
EE-2027 SaS, L10: 1/13 Lecture 10: Sampling Discrete-Time Systems 4 Sampling & Discrete-time systems (2 lectures): Sampling theorem, discrete Fourier transform.
Lecture 4: Sampling [2] XILIANG LUO 2014/10. Periodic Sampling  A continuous time signal is sampled periodically to obtain a discrete- time signal as:
First semester King Saud University College of Applied studies and Community Service 1301CT.
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:
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Echivalarea sistemelor analogice cu sisteme digitale Prof.dr.ing. Ioan NAFORNITA.
… Representation of a CT Signal Using Impulse Functions
Lecture 41 Practical sampling and reconstruction.
Discrete-Time and System (A Review)
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
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.
Sampling Theorems. Periodic Sampling Most signals are continuous in time. Example: voice, music, images ADC and DAC is needed to convert from continuous-time.
Chapter 5 Frequency Domain Analysis of Systems. Consider the following CT LTI system: absolutely integrable,Assumption: the impulse response h(t) is absolutely.
1 Lab. 4 Sampling and Rate Conversion  Sampling:  The Fourier transform of an impulse train is still an impulse train.  Then, x x(t) x s (t)x(nT) *
1 Chapter 5 Ideal Filters, Sampling, and Reconstruction Sections Wed. June 26, 2013.
1 Prof. Nizamettin AYDIN Advanced Digital Signal Processing.
Notice  HW problems for Z-transform at available on the course website  due this Friday (9/26/2014) 
Prof. Brian L. Evans Dept. of Electrical and Computer Engineering The University of Texas at Austin Lecture 4 EE 345S Real-Time.
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.
1 Signals and Systems Lecture 23 DT Processing of CT Signals Digital Differentiator and Half-Sample Delay DT Decimation and Interpolation.
Digital Signal Processing
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
Discrete-Time Processing of Continuous-Time Signals Quote of the Day Do not worry about your difficulties in Mathematics. I can assure you mine are still.
Eeng360 1 Chapter 2 Linear Systems Topics:  Review of Linear Systems Linear Time-Invariant Systems Impulse Response Transfer Functions Distortionless.
Chapter 2 Ideal Sampling and Nyquist Theorem
Lecture 1.4. Sampling. Kotelnikov-Nyquist Theorem.
Sampling and DSP Instructor: Dr. Mike Turi Department of Computer Science & Computer Engineering Pacific Lutheran University.
Prof. Brian L. Evans Dept. of Electrical and Computer Engineering The University of Texas at Austin EE445S Real-Time Digital Signal Processing Lab Spring.
Signals & systems Ch.3 Fourier Transform of Signals and LTI System
Chapter4. Sampling of Continuous-Time Signals
Echivalarea sistemelor analogice cu sisteme digitale
Sampling and Aliasing Prof. Brian L. Evans
Module 3 Pulse Modulation.
Chapter 3 Sampling.
SAMPLING & ALIASING.
Sampling rate conversion by a rational factor
Sampling and Reconstruction
Signals and Systems Lecture 20
Zhongguo Liu Biomedical Engineering
لجنة الهندسة الكهربائية
Lecture 10 Digital to Analog (D-to-A) Conversion
Changing the Sampling Rate
Lecture 4 Sampling & Aliasing
Sampling and the Discrete Fourier Transform
Signal and Systems Chapter 8: Modulation
Reconstruction of Bandlimited Signal From Samples
Chapter 2 Linear Systems
Signals and Systems Chapter 7: Sampling
Interpolation and Pulse Shaping
Chapter 2 Ideal Sampling and Nyquist Theorem
Rectangular Sampling.
Lesson Week 8 Fourier Transform of Time Functions (DC Signal, Periodic Signals, and Pulsed Cosine)
Chapter 9 Advanced Topics in DSP
Sampling Theorem 主講者:虞台文.
Chapter 3 Sampling.
Digital Signal Processing
Sampling and Aliasing.
ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals
DIGITAL CONTROL SYSTEM WEEK 3 NUMERICAL APPROXIMATION
State Space approach State Variables of a Dynamical System
Presentation transcript:

7.0 Sampling 7.1 The Sampling Theorem A link between Continuous-time/Discrete-time Systems x(t) y(t) h(t) x[n] y[n] h[n] Sampling x[n]=x(nT), T : sampling period

Sampling

Motivation: handling continuous-time signals/systems digitally using computing environment accurate, programmable, flexible, reproducible, powerful compatible to digital networks and relevant technologies all signals look the same when digitized, except at different rates, thus can be supported by a single network Question: under what kind of conditions can a continuous-time signal be uniquely specified by its discrete-time samples? See Fig. 7.1, p.515 of text Sampling Theorem

Recovery from Samples ?

Impulse Train Sampling See Fig. 7.2, p.516 of text See Fig. 4.14, p.300 of text

Impulse Train Sampling periodic spectrum, superposition of scaled, shifted replicas of X(jω) See Fig. 7.3, p.517 of text

Impulse Train Sampling Sampling Theorem (1/2) x(t) uniquely specified by its samples x(nT), n=0, 1, 2…… precisely reconstructed by an ideal lowpass filter with Gain T and cutoff frequency ωM < ωc < ωs- ωM applied on the impulse train of sample values See Fig. 7.4, p.519 of text

Impulse Train Sampling Sampling Theorem (2/2) if ωs ≤ 2 ωM spectrum overlapped, frequency components confused - -- aliasing effect can’t be reconstructed by lowpass filtering See Fig. 7.3, p.518 of text

Aliasing Effect

Continuous/Discrete Sinusoidals (p.35 of 1.0)

Sampling

Aliasing Effect

Sampling Thm

Practical Sampling

Practical Sampling

Impulse Train Sampling Practical Issues nonideal lowpass filters accurate enough for practical purposes determined by acceptable level of distortion oversampling ωs = 2 ωM + ∆ ω  sampled by pulse train with other pulse shapes signals practically not bandlimited : pre-filtering

Oversampling with Non-ideal Lowpass Filters

Signals not Bandlimited

Sampling with A Zero-order Hold holding the sampled value until the next sample taken modeled by an impulse train sampler followed by a system with rectangular impulse response

Sampling with A Zero-order Hold Reconstructed by a lowpass filter Hr(jω) See Fig. 7.6, 7.7, 7.8, p.521, 522 of text

Interpolation Impulse train sampling/ideal lowpass filtering See Fig. 7.10, p.524 of text

Ideal Interpolation

Interpolation Zero-order hold can be viewed as a “coarse” interpolation See Fig. 7.11, p.524 of text Sometimes additional lowpass filtering naturally applied e.g. viewed at a distance by human eyes, mosaic smoothed naturally See Fig. 7.12, p.525 of text

Interpolation Higher order holds zero-order : output discontinuous first-order : output continuous, discontinuous derivatives See Fig. 7.13, p.526, 527 of text second-order : continuous up to first derivative discontinuous second derivative

Aliasing Consider a signal x(t)=cos ω0t sampled at sampling frequency reconstructed by an ideal lowpass filter with xr(t) : reconstructed signal fixed ωs, varying ω0

Aliasing Consider a signal x(t)=cos ω0t when aliasing occurs, the original frequency ω0 takes on the identity of a lower frequency, ωs – ω0 w0 confused with not only ωs + ω0, but ωs – ω0 See Fig. 7.15, 7.16, p.529-531 of text

Aliasing Consider a signal x(t)=cos ω0t many xr(t) exist such that the question is to choose the right one if x(t) = cos(ω0t + ϕ) the impulses have extra phases ejϕ, e-jϕ

Sinusoidals (p.64 of 4.0)

Aliasing Consider a signal x(t)=cos ω0t (a) (b) (c) (d) phase also changed

Example 7.1 of Text

Examples Example 7.1, p.532 of text (Problem 7.39, p.571 of text) sampled and low-pass filtered

Example 7.1 of Text

Example 7.1 of Text

7.2 Discrete-time Processing of Continuous-time Signals Processing continuous-time signals digitally C/D Conversion xc(t) yc(t) A/D Converter D/C D/A Converter Discrete-time System xd[n]=xc(nT) yd[n]=yc(nT)

Sampling (p.2 of 7.0)

Formal Formulation/Analysis C/D Conversion impulse train sampling with sampling period T mapping the impulse train to a sequence with unity spacing normalization (or scaling) in time See Fig. 7.21, p.536 of text

Formal Formulation/Analysis Frequency Domain Representation ω for continuous-time, Ω for discrete-time, only in this section

Formal Formulation/Analysis Frequency Domain Relationships continuous-time (4.9) discrete-time (5.9)

C/D Conversion

Formal Formulation/Analysis Frequency Domain Relationships relationship See Fig. 7.22, p.537 of text

Formal Formulation/Analysis Frequency Domain Relationships Xd(ejΩ) is a frequency-scaled (by T) version of Xp(jω) xd[n] is a time-scaled (by 1/T) version of xp(t) Xd(ejΩ) periodic with period 2π xd[n] discrete in time Xp(jω) periodic with period 2π/T=ωs xp(t) obtained by impulse train sampling

Formal Formulation/Analysis D/C Conversion mapping a sequence to an impulse train lowpass filtering See Fig. 7.23, p.538 of text

Formal Formulation/Analysis Complete System See Fig. 7.24, 7.25, 7.26, p.538, 539, 540 of text equivalent to a continuous-time system if the sampling theorem is satisfied

Sampling (p.2 of 7.0)

Discrete-time Processing of Continuous-time Signals Note the complete system is linear and time-invariant if the sampling theorem is satisfied sampling process itself is NOT time-invariant

Examples Digital Differentiator band-limited differentiator discrete-time equivalent See Fig. 7.27, 7.28, p.541, 542 of text

Examples Delay yc(t)=xc(t-∆) discrete-time equivalent See Fig. 7.29, p.543 of text

Examples Delay ∆/T an integer ∆/T not an integer undefined in principle but makes sense in terms of sampling if the sampling theorem is satisfied e.g. ∆/T=1/2, half-sample delay See Fig. 7.30, p.544 of text

7.3 Change of Sampling Frequency Impulse Train Sampling of Discrete-time Signals Completely in parallel with impulse train sampling of continuous-time signals See Fig. 7.31, p.546 of text

Up/Down Sampling

(P.11 of 7.0)

Impulse Train Sampling of Discrete-time Signals Completely in parallel with impulse train sampling of continuous-time signals See Fig. 7.32, p.547 of text

 

Aliasing Effect (P.15 of 7.0)

Sampling (P.17 of 7.0)

Aliasing Effect (P.18 of 7.0)

Aliasing for Discrete-time Signals

Impulse Train Sampling of Discrete-time Signals Completely in parallel with impulse train sampling of continuous-time signals ωs > 2ωM, no aliasing x[n] can be exactly recovered from xp[n] by a lowpass filter With Gain N and cutoff frequency ωM < ωc < ωs- ωM See Fig. 7.33, p.548 of text ωs > 2ωM, aliasing occurs filter output xr[n] ≠ x[n] but xr[kN] = x[kN], k=0, ±1, ±2, ……

Impulse Train Sampling of Discrete-time Signals Interpolation h[n] : impulse response of the lowpass filter

Impulse Train Sampling of Discrete-time Signals Interpolation in general a practical filter hr[n] is used

Decimation/Interpolation Decimation: reducing the sampling frequency by a factor of N, downsampling deleting all zero’s between non-zero samples to produce a new sequence See Fig. 7.34, p.550 of text

Time Expansion (p.39 of 5.0) If n/k is an integer, k: positive integer See Fig. 5.13, p.377 of text See Fig. 5.14, p.378 of text

(p.40 of 5.0)

(p.41 of 5.0)

Time Expansion (p.42 of 5.0)

Decimation/Interpolation Decimation: reducing the sampling frequency by a factor of N, downsampling

Decimation/Interpolation Scaled in frequency inverse of time expansion property of discrete-time Fourier transform See Fig. 7.35, p. 551 of text decimation without introducing aliasing requires oversampling situation See an example in Fig. 7.36, p. 552 of text

Decimation/Interpolation Interpolation: increasing the sampling frequency by a factor of N, upsampling reverse the process in decimation from xb[n] construct xp[n] by inserting N-1 zero’s from xp[n] construct x[n] by lowpass filtering See Fig. 7.37, p. 553 of text Change of sampling frequency by a factor of N/M: first interpolating by N, then decimating by M

Decimation/Interpolation

Decimation/Interpolation

Examples Example 7.4/7.5, p.548, p.554 of text sampling x[n] without aliasing

Examples Example 7.4/7.5, p.548, p.554 of text maximum possible downsampling: using full band [-π, π]

Examples Example 7.4/7.5, p.548, p.554 of text

Problem 7.6, p.557 of text

Problem 7.20, p.560 of text : inserting one zero after each sample : decimation 2:1, extracting every second sample Which of (a)(b) corresponds to low-pass filtering with ?

Problem 7.20, p.560 of text (a) yes

Problem 7.20, p.560 of text (b) no

Problem 7.23, p.562 of text

Problem 7.23, p.562 of text

Problem 7.23, p.562 of text

Problem 7.24, p.562 of text 2

Problem 7.41, p.572 of text

Problem 7.41, p.572 of text

Problem 7.51, p.580 of text dual problem for frequency domain sampling