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

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

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

Chapter 5 Frequency Domain Analysis of Systems

Chapter 5 Frequency Domain Analysis of Systems

6.003: Signals and Systems. Sampling and Quantization

EE123 Digital Signal Processing

ESE 531: Digital Signal Processing

FROM ANALOGUE TO DIGITAL

Homework: 4.50 & 4.51 of the attachment Tutorial Problems: 7.41, 7.44, 7.47, Signals & Systems Sampling P1

Analog Digital Sampling & Discrete Time Discrete Values & Noise Digital-to-Analog Conversion Analog-to-Digital Conversion

Discrete-time Signals and Systems in

ESE 531: Digital Signal Processing

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.

X. Chen More on Sampling

Chapter 2: Problem Solutions

EE 224 Signals and Systems I Review 1/10

Chap 4. Sampling of Continuous-Time Signals

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.

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

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

EEO 401 Digital Signal Processing Prof. Mark Fowler

EE123 Digital Signal Processing

Digital Signal Processing. Midterm 1 Solution

ELEN 4810 Midterm Exam

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL and COMPUTER ENGINEERING

Review: Continuous Fourier Transform

CHAPTER 2 RANDOM PROCESSES IN DISCRETE TIME

Signals, Instruments, and Systems W5. Introduction to Signal Processing Sampling, Reconstruction, and Filters

Review of Discrete-Time System

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

Periodic (Uniform) Sampling ELEC364 & ELEC442

Principles of Communications

Overview of Sampling Topics

ECGR4124 Digital Signal Processing Midterm Spring 2010

Discrete-Time Signals and Systems. Efficient Computation of the DFT: FFT Algorithms. Analog-to-Digital Conversion. Sampling Process.

IB Paper 6: Signal and Data Analysis

Bridge between continuous time and discrete time signals

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

ETSF15 Analog/Digital. Stefan Höst

Sistemas de Aquisição de Dados. Mestrado Integrado em Eng. Física Tecnológica 2016/17 Aula 3, 3rd September

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

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

J. McNames Portland State University ECE 223 Sampling Ver

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

Sampling اهمتسیس و اهلانگیس یرهطم لضفلاوبا دیس فیرش یتعنص هاگشناد رتویپماک هدکشناد

Multirate signal processing

EE 521: Instrumentation and Measurements

Sinc Functions. Continuous-Time Rectangular Pulse

Stability Condition in Terms of the Pole Locations

CMPT 889: Lecture 3 Fundamentals of Digital Audio, Discrete-Time Signals

Sensors. Chapter Signal Conditioning

ESE 531: Digital Signal Processing

E : Lecture 1 Introduction

Class of waveform coders can be represented in this manner

Multirate Digital Signal Processing

Grades will be determined by the correctness of your answers (explanations are not required).

Digital Baseband Systems. Reference: Digital Communications John G. Proakis

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

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

EECE 301 Signals & Systems Prof. Mark Fowler

Principles of Communications Lecture 8: Baseband Communication Systems. Chih-Wei Liu 劉志尉 National Chiao Tung University

x[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn

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

Continuous Fourier transform of a Gaussian Function

2A1H Time-Frequency Analysis II

Discrete-Time David Johns and Ken Martin University of Toronto

EE5713 : Advanced Digital Communications

Grades will be determined by the correctness of your answers (explanations are not required).

Cast of Characters. Some Symbols, Functions, and Variables Used in the Book

Analysis of Finite Wordlength Effects

Poles and Zeros in z-plane

NAME: ht () 1 2π. Hj0 ( ) dω Find the value of BW for the system having the following impulse response.

ECE Unit 4. Realizable system used to approximate the ideal system is shown below: Figure 4.47 (b) Digital Processing of Analog Signals

Oversampling Converters

Sampling. Alejandro Ribeiro. February 8, 2018

Continuous and Discrete Time Signals and Systems

Digital Signal Processing

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

Lecture 3 January 23

Nyquist sampling a bandlimited function. Sampling: The connection from CT to DT. Impulse Train sampling. Interpolation: Signal Reconstruction

Chapter 7: IIR Filter Design Techniques

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

MEDE2500 Tutorial Nov-7

MULTIRATE SYSTEMS. work load, lower filter order, lower coefficient sensitivity and noise,

EE 435. Lecture 32. Spectral Performance Windowing

Quantization and Compensation in Sampled Interleaved Multi-Channel Systems

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

Continuous-Time Fourier Transform

1.1 SPECIAL FUNCTIONS USED IN SIGNAL PROCESSING. δ(t) = for t = 0, = 0 for t 0. δ(t)dt = 1. (1.1)

The Discrete-Time Fourier

Radar Systems Engineering Lecture 3 Review of Signals, Systems and Digital Signal Processing

Digital Signal Processing IIR Filter Design via Bilinear Transform

INTRODUCTION TO DELTA-SIGMA ADCS

VID3: Sampling and Quantization

Responses of Digital Filters Chapter Intended Learning Outcomes:

Lecture 13: Discrete Time Fourier Transform (DTFT)

Introduction to Digital Signal Processing

DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010

Signals and Systems Spring 2004 Lecture #9

UNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems.

Transcription:

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

1. Sampling & Reconstruction DSP must interact with an analog world: A to D D to A x(t) x[n] y[n] y(t) ADC DSP DAC Antialias filter Sample and hold Reconstruction filter Sensor WORLD Actuator 2

Sampling: Frequency Domain Sampling: CT signal DT signal by recording values at sampling instants : Discrete What is the relationship of the spectra? i.e. relate and g n [ ] = g a ( nt) G a Continuous Sampling period T samp.freq. T = 2π/T rad/sec ( j) = g a ( t)e jt dt G(e jω ) = in rad/second 3 g[ n]e jωn ω in rad/sample CTFT DTFT

CT delta fn Sampling DT signals have same content as CT signals gated by an impulse train: g a (t) p(t) = δ t nt n= t ( ) T 3T g p (t) = g a (t) p(t) is a CT signal with the same information as DT sequence g[n] t g p (t) sampled signal: still continuous - but discrete values t 4

Spectra of sampled signals Given CT Spectrum G p g p t ( j) = F g p t Compare to DTFT ( ) = g a ( nt) δ( t nt) n= n { ( )} = g a nt n G p ( j) = g a ( nt)e jnt ( )F δ t nt { ( )} by linearity ( ) = g n G e jω n [ ]e jωn i.e. G( e jω ) = G p ( j) T =ω π /Τ = T /2 π ω 5

Spectra of sampled signals Also, note that But so p t ( ) = 1 T p t n ( ) = δ( t nt) is periodic, thus has Fourier Series: e j 2π Qc ( T )kt k = 1 T /2 T T /2 k= F e j 0 t x t ( ) G p = 1 T { } = X j 0 j k p( t)e j2πkt /T dt ( ( )) shift in ( ) ( ) = T 1 G a j( k T ) frequency - scaled sum of shifted replicas of G a (j) by multiples of sampling frequency T 6

So: g a t p t = CT and DT Spectra or ( ) = G p j k G( e jt ) = T 1 G a j k T G e jω DTFT ( ) G a ( j) ( ) P( j) g p t g n ( ) G p ( j) ( ) [ ] G e jω ( ) T =ω = 1 T G a j ω T k 2π k M Μ 2 Τ Τ M/T 4π 2π T 7 ( ( )) ( ( )) Μ T CTFT g a (t) is bandlimited @ Μ Τ 2 Τ shifted/scaled copies @ = T = 2π ω = = 2π T 2π 4π ω

Aliasing Sampled analog signal has spectrum: G p (j) G a (j) Τ Μ Μ Τ + Μ Τ Μ g a (t) is bandlimited to ± M rad/sec When sampling frequency T is large... no overlap between aliases can recover g a (t) from g p (t) by low-pass filtering alias of baseband signal 8 Τ

The Nyquist Limit If bandlimit M is too large, or sampling rate T is too small, aliases will overlap: G p (j) Τ Spectral effect cannot be filtered out cannot recover g a (t) Avoid by: Μ Τ Μ Μ Τ Sampling theorum T M M T 2 M i.e. bandlimit g a (t) at T 2 Nyquist frequency 9

Anti-Alias Filter To understand speech, need ~ 3.4 khz 8 khz sampling rate (i.e. up to 4 khz) Limit of hearing ~20 khz 44.1 khz sampling rate for CDs Must remove energy above Nyquist with LPF before sampling: Anti-alias filter A to D Anti-alias filter Sample & hold ADC 10 space for filter rolloff M

Sampling Bandpass Signals Signal is not always in baseband around = 0... may be some higher : M Η L L H Bandwidth Δ = H L If aliases from sampling don t overlap, no aliasing distortion, can still recover M/T T T /2 Basic limit: T /2 bandwidth Δ T 2 T 11

Reconstruction To turn g[n] back to g^ a (t): make a continuous impulse train g^ p (t) lowpass filter to extract baseband g^ a (t) g[n] n g^ p (t) t g^ a (t) t G a (e jω ) π G p (j) G a (j) Ideal reconstruction filter is brickwall Τ /2 i.e. sinc - not realizable (especially analog!) use something with finite transition band... ^ ^ ω 12

2. Quantization Course so far has been about discrete-time i.e. quantization of time Computer representation of signals also quantizes level (e.g. 16 bit integer word) Level quantization introduces an error between ideal & actual signal noise Resolution (# bits) affects data size quantization critical for compression smallest data coarsest quantization 13

Quantization Quantization is performed in A-to-D: Quantization has simple transfer curve: Quantized signal { } x ˆ = Q x Quantization error e = x x ˆ 14

Quantization noise Can usually model quantization as additive white noise: i.e. uncorrelated with self or signal x x[n] + - e[n] x[n] ^ bits cut off by quantization; hard amplitude limit 15

Quantization SNR Common measure of noise is Signal-to-Noise ratio (SNR) in db: 2 σ SNR =10 log x 10 σ db 2 e signal power noise power When x >> 1 LSB, quantization noise has ~ uniform distribution: σ e 2 = ε2 12 (quantizer step = ε) 16

Quantization SNR Now, σ 2 x is limited by dynamic range of converter (to avoid clipping) e.g. b+1 bit resolution (including sign) output levels vary -2 b ε.. (2 b -1)ε = R FS where full-scale range 2.. R FS 2 ε R FS = 2 b+1 ε 2 σ SNR =10log x 10 2 R FS 2 2b 4 12 = 6b +16.8 20log 10 R FS σ x 2 i.e. ~ 6 db SNR per bit 17 depends on signal ( )

Coefficient Quantization Quantization affects not just signal but filter constants too.. depending on implementation.. may have different resolution Some coefficients are very sensitive to small changes e.g. poles near unit circle high-q pole becomes unstable 18