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

Similar documents
ECE 8440 Unit 17. Parks- McClellan Algorithm

Other types of errors due to using a finite no. of bits: Round- off error due to rounding of products

Chap 4. Sampling of Continuous-Time Signals

EE123 Digital Signal Processing

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

Chapter 5 Frequency Domain Analysis of Systems

Chapter 5 Frequency Domain Analysis of Systems

Digital Signal Processing

IB Paper 6: Signal and Data Analysis

Sec$on The Use of Exponen$al Weigh$ng Exponen$al weigh$ng of a sequence x(n) is defined by. (equa$on 13.70)

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.

FROM ANALOGUE TO DIGITAL

Solutions to Problems in Chapter 4

ESE 531: Digital Signal Processing

ECE 8440 Unit Applica,ons (of Homomorphic Deconvolu,on) to Speech Processing

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

Class of waveform coders can be represented in this manner

EE482: Digital Signal Processing Applications

X. Chen More on Sampling

University of Illinois at Urbana-Champaign ECE 310: Digital Signal Processing

Bioelectrical Circuits: Lecture 9

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

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

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

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL and COMPUTER ENGINEERING

CITY UNIVERSITY LONDON. MSc in Information Engineering DIGITAL SIGNAL PROCESSING EPM746

Oversampling Converters

Discrete-Time David Johns and Ken Martin University of Toronto

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

Bridge between continuous time and discrete time signals

Massachusetts Institute of Technology

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

6.003: Signals and Systems. Sampling and Quantization

MEDE2500 Tutorial Nov-7

Quantization and Compensation in Sampled Interleaved Multi-Channel Systems

Data Converter Fundamentals

Finite Word Length Effects and Quantisation Noise. Professors A G Constantinides & L R Arnaut

CHAPTER 2 RANDOM PROCESSES IN DISCRETE TIME

ECE 8440 Unit 13 Sec0on Effects of Round- Off Noise in Digital Filters

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

Analysis of Finite Wordlength Effects

Digital Signal Processing IIR Filter Design via Bilinear Transform

ECG782: Multidimensional Digital Signal Processing

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

Multirate signal processing

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

ESE 531: Digital Signal Processing

Signals and Systems Spring 2004 Lecture #9

Periodic (Uniform) Sampling ELEC364 & ELEC442

Least Square Es?ma?on, Filtering, and Predic?on: ECE 5/639 Sta?s?cal Signal Processing II: Linear Es?ma?on

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

Lab 4: Quantization, Oversampling, and Noise Shaping

J. McNames Portland State University ECE 223 Sampling Ver

Random signals II. ÚPGM FIT VUT Brno,

EE123 Digital Signal Processing

Overview of Sampling Topics

Design of IIR filters

Chapter 7. Digital Control Systems

The Laplace Transform

Generation of bandlimited sync transitions for sine waveforms

EE40458 Nonlinearity & Noise. Yet another lecture from the road

Digital Filters Ying Sun

Optimum Ordering and Pole-Zero Pairing of the Cascade Form IIR. Digital Filter

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

Poles and Zeros in z-plane

Stochastic Processes. M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno

DIGITAL FILTERS Analysis, Design, and Applications by A. Antoniou ERRATA. Page 10, Table 1.1: The upper limit of the summation should be K.

Lecture 16: Filter Design: Impulse Invariance and Bilinear Transform

EE 224 Signals and Systems I Review 1/10

Homework 6 Solutions

Lecture 12 The Level Set Approach for Turbulent Premixed Combus=on

Signal and systems. Linear Systems. Luigi Palopoli. Signal and systems p. 1/5

Correlator I. Basics. Chapter Introduction. 8.2 Digitization Sampling. D. Anish Roshi

Filter Analysis and Design

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

Review: Continuous Fourier Transform

3F1 Random Processes Examples Paper (for all 6 lectures)

Digital Signal Processing

Atmospheric Flight Dynamics Example Exam 2 Solutions

EE 230 Lecture 40. Data Converters. Amplitude Quantization. Quantization Noise

Fourier Analysis of Signals Using the DFT

Timing Offset and Quantization Error Trade-off in Interleaved Multi-Channel Measurements. Joseph Gary McMichael

Principles of Communications

Digital Control & Digital Filters. Lectures 21 & 22

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

Lecture 3 January 23

ECEN 420 LINEAR CONTROL SYSTEMS. Lecture 2 Laplace Transform I 1/52

-Digital Signal Processing- FIR Filter Design. Lecture May-16

Line Spectra and their Applications

Massachusetts Institute of Technology

SIGNAL PROCESSING. B14 Option 4 lectures. Stephen Roberts

Lecture 8: Signal Reconstruction, DT vs CT Processing. 8.1 Reconstruction of a Band-limited Signal from its Samples

4.3 Analysis of Non-periodic Con6nuous-Time Signals. We view this non-periodic signal as a periodic signal with period as infinite large.

Problem Sheet 1 Examples of Random Processes

ECE 301 Division 1 Final Exam Solutions, 12/12/2011, 3:20-5:20pm in PHYS 114.

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM. COURSE: ECE 3084A (Prof. Michaels)

Lecture 3 - Design of Digital Filters

The Johns Hopkins University Department of Electrical and Computer Engineering Introduction to Linear Systems Fall 2002.

EE 5345 Biomedical Instrumentation Lecture 12: slides

Higher-Order Σ Modulators and the Σ Toolbox

Transcription:

ECE 8440 - Unit 4 Digital Processing of Analog Signals- - Non- Ideal Case (See sec8on 4.8) Before considering the non- ideal case, recall the ideal case: 1 Assump8ons involved in ideal case: - no aliasing - no quan8za8on errors in conver8ng from con8nuous 8me to discrete 8me - ideal impulse generator and ideal low- pass filters used in implemen8ng D/C converter - Realizable system used to approximate the ideal system is shown below: Figure 4.47 (b) Digital Processing of Analog Signals

Use of an8- aliasing filter: Recall figure from ECE 667 text (Ludeman): Ideally, the an8- aliasing filter should sa8sfy H aa (jω) = 1 H aa (jω) = 0 for (equa8on 4.118) for Ω < Ω c π T Ω > Ω c If an8- aliasing filter is ideal (and the D/C converter is ideal), then the overall frequency response between the input x c (t) and the output ŷ r (t) is H eff (jω) = H(e jωt ) H eff (jω) = 0 for for Ω < Ω c π T Ω > Ω c

However, since the an8- aliasing filter is not perfectly flat the actual overall frequency response of the above system is H eff (jω) H aa (jω)h(e jωt ) Note: The closer Ω c is to π/t the more difficult it is to approximate an ideal an8- aliasing filter over the desired filter's passband. 3 Problems with using "approximately ideal" an8- aliasing filters : - expensive - generally have highly non- linear phase. Alterna8ve approach: Step 1. "over- sample" the input so that so that the frequencies of interest in the signal, a\er sampling, sa8sfy ω < ω N << π Stated in terms of the analog input, select the sampling rate 1/T to sa8sfy π T Ω c > Ω N where Ω N is the highest frequency of interest in x c (t) and Ω c is the highest frequency that the "cheap" ("simple ) an8- aliasing filter passes. (See Figure 4.50 on next slide.) Assume that this involves a sampling rate that is M 8mes the Nyquist rate. That is, 1 T > M Ω N π

Step. Apply a sharp cut- off digital filter to remove high frequencies out of the range of interest. (The digital filter can also have linear phase.) 4

Step 3. Apply down- sampling by the value of M that is used in Step 1. 5 Figure 4.50 Use of oversampling followed by decima8on in C/D conversison. Analog- to- Digital Conversion (prac>cal realiza>on of C/D conversion) Non- ideal proper8es: - conversion cannot be performed instantaneously - therefore, a Sample/Hold circuit is typically used - quan8za8on error arise due to using a finite no. of bits to represent signals that have a con8nuous range of possible values If an A/D converter uses B output bits to represent a signal whose possible range of input values is from 0 to X m, the "step size" (resolu8on) of the converter is X m B = Δ

Similarly, if the A/D converter uses B+1 bits to represent inputs which can be posi8ve or nega8ve with magnitude up to X m, then the step size is 6 X m B+1 = X m B = Δ As can be seen in the figure below, the maximum quan8za8on error for an A/D converter with step size Δ is Δ (as long as the output is not forced into satura8on in the top or boeom levels). Offset binary Code 111 110 101 100 011 010 001 000 Figure 4.54 Typical quan8zer for A/D conversion

Analysis of Quan>za>on Errors due to A/D Conversion If the perfectly represented discrete 8me signal is x(n) and the actual output of the A/D converter is ˆx(n), then the A/D quan8za8on error e(n) is defined as e(n) = ˆx(n) x(n). Feeding the output of an A/D converter into the digital filter effec8vely introduces a noise component (due to quan8za8on) along with the desired input signal 7 Size of quan8za8on error: As seen on the previous page, the quan8za8on error range is: Δ < e n ( ) < Δ This range of error values is valid as long as the input signal stays within the allowed range. For a mid- tread A/D converter as shown on the previous slide, this condi8on is X m Δ (Refer to fig. 4.54 ) ( ) < x ( n) < ( X m Δ ) Figure 4.56 Addi8ve noise model for quan8zer. If x(n) exceeds this range, then larger, "clipping" quan8za8on errors occur.

In order to perform a sta8s8cal evalua8on of the effect of A/D quan8za8on errors, several assump8ons are typically made: 8 1. e(n) is the realiza8on of sta8onary random process. e(n) is uncorrelated with the input x(n) 3. e(n) is uncorrelated with e(m) for n m. That is, e(n) is a "white noise" process 4. e(n) has a uniform probability density func8on These assump8ons are reasonable when: Figure 4.58 Probability density Func8on of quan8za8on error for a Rounding quan8er such as that of Figure 4.54. the input signal is "sufficiently complex" (e.g., speech, music) (example of "not sufficiently complex": a step func8on or a low order polynomial, such as a line) the input amplitude typically traverses many quan8za8on steps from sample to sample.

The second condi8on (transversal of many quan8za8on steps) becomes easier to sa8sfy as the number of quan8za8on levels is increased, as seen in the figure below. 9 Note the "clipping'' error in part c of the figure. (a) Unquan8zed samples of the signal x(n)=.99kcos(π/10) (b) Quan8zed samples of signal in part (a) with a 3- bit quan8zer (c) Quan8za8on error sequence for 3- bit quan8za8on of signal of part (a) (d) Quan8za8on error sequence for 8- bit quan8za8on of signal of part (a) Figure 4.57 Example of quan8za8on noise

Sta8s8cal representa8on of quan8za8on errors: If the above assump8on that e(n) is uniformly distributed is valid, then the mean value of e(n) is 0, and the variance of e(n) can be found as follows: Δ/ 1 σ e = e Δ Δ/ Since Δ = X m, B de = Δ 1 10 σ e = 1 X m 1 B = X B m 1 O\en the effect of quan8za8on error is expressed in terms of db of the signal- to- noise ra8o: σ SNR = 10log x 10 σ e σ = 10log x 10 X m B / 1 1 B σ = 10log x 10 X m In other to have an input signal to the A/D whose typical input values span the en8re input range of the A/D, but for which there liele chance of clipping, we would typically adjust the input level to sa8sfy: X m = 4σ x

Then the resul8ng SNR becomes 1 SNR = 10log 10 B X m = 10log 10 [3 B ] X m 4 = 10[log 10 (3) + (B )log 10 ()] = 10[.477 + (B )(.301)] = 6.0B 1.5db 6B 1.5db 11 Therefore, each addi8onal bit in an A/D output contributes approximately 6 db to the SNR performance. Example: If 90-96 db of SNR is required (as in high quality music recording), then the required no. of bits in the A/D output can be calculated as 90 + 1.5 B = = 15. 6 (for 90 db SNR) or B = 96 + 1.5 = 16. 6 (for 96 db SNR)

D/A Conversion Recall that the ideal D/C conversion process can be represented in the 8me domain as 1 x r (t) = n= sin[ π (t nt)] x(n) T π (t nt) T (equa8on 4.140) (This is the "reconstruc8on formula" which is a by- product of developing the Sampling Theorem.) Mathema8cally, this is equivalent to genera8ng a train of analog impulse scaled by x(n), then feeding the pulse train into an ideal low- pass filter, as shown below and derived on the next slide. Figure 4.7(a) Block diagram of an deal bandlimited signal reconstruc8on system. (b) Frequency response of an ideal reconstruc8on filter.

This pulse train can be represented as x s (t) = x(n)δ(t nt) (equa8on 4.). n= The impulse response of an ideal low- pass filter having cutoff equal to π/t and with gain of T is h r (t) = sin(πt / T) πt / T. (equa8on 4.4) 13 Figure 4.7 (c) Impulse response of an Ideal reconstruc8on filter. The response of this low- pass filter to the input x s (t) is x r (t) = x s (τ) h r (t τ)dτ = x(n)δ(τ nt) h r (t τ)dτ n= = x(n) n= = x(n)h r (t nt) n= δ(τ nt)h r (t τ)dτ (equivalent to equa8on 4.5)

To obtain a frequency domain descrip8on of the ideal reconstruc8on process, take the con8nuous 8me Fourier Transform of of the output x r (t): X r (jω) = x r (t)e jωt dt = x(n)h r (t nt) n= = x(n) n= e jωt h r (t nt)e jωt dt dt 14 If we let τ = t nt, the above can be wrieen as = x(n) n= h r (τ)e jω(τ+nt) dτ = x(n) e jωnt h r (τ)e jωτ dτ n= = x(n) e jωnt H r (jω) n= = X(e jω )H r (jω) So where H r (jω) is an ideal low- pass filter with gain = T, as was shown previously in figure 4.7. Since X r (jω) = X(e jω )H r (jω) ω = ΩT, the above equa8on can be wrieen as X (equa8on 4.8) r (jω) = X(e jωt )H r (jω)

15 D/A converters A D/A converter is a prac8cal realiza8on (and approxima8on) of the ideal D/C converter. A typical D/A converter uses a zero- order hold to preserve the most recent analog conversion value, as shown in the figure below.

The opera8on of a zero- order hold can be represented mathema8cally as x o (t) = n= x(n)h o (t nt) 16 where h o (t) = 1, and h o (t) = 0, 0 < t < T otherwise It is useful to note that the genera8on of x o (t) from x(n) can also be represented by a convolu8on of a weighted impulse train with h o (t): x o (t) = h o (t) * n= x(n)δ(t nt) = x(n)h o (t nt). n= To view the effect of the zero- order hold in the frequency domain, take the Fourier Transform of h o (t): H o (jω) = = h o (t)e jωt dt = 1 e jωt dt e jωt T jω 0 = e jωt = jωt e e jωt jω T 0 e jωt 1 jω = = 1 e jωt jω ΩT sin Ω e jωt (equa8on 4.150)

To compensate for the frequency response contribu8ons by the zero- order hold, we can append the following compensated reconstruc8on filter to the output of a D/A converter which u8lizes zero- order hold. H r (jω) = T H o (jω) = ΩT/ sin(ωt/) ejωt/ for Ω < π T (equa8on 4.151) 17 = 0 otherwise Figure 4.63 (a) Frequency Response of zero- order- hold with ideal interpola8ng filter. (b) Ideal compensated recon- structed filter for use with zero- order- hold output. The "compensated reconstruc8on filter H r (jω) is cascaded with the A/D converter to compensate for the frequency shaping inherent in the zero- order hold, as shown in the figure below. (c) Figure 4.64 Physical configura8on for D/A conversion.

For a signal processing system consis8ng the following units: - an8- aliasing filter, H aa (jω) - A/D conversion - linear filtering, H(e jω ) = H(e jωt ) - D/A conversion using zero- order hold, H o (jω) - compensated reconstruc8on filter that compensates for zero- order hold, H r (jω) 18 The overall frequency response between the con8nuous- 8me and the con8nuous- 8me output is H eff (jω) = H r (jω)h o (jω)h(e jωt )H aa (jω) Recall: The output of the A/D converter includes A/D quan8za8on noise and can be represented as ˆx(n) = x(n) + e(n) where x(n) is the unquan8zed signal value and e(n) is the A/D quan8za8on error. To be shown later: If the A/D quan8za8on error is a white noise signal with variance σ e (n) = Δ 1 then the power spectrum of the output noise due to A/D quan8za8on is P e (jω) = H r (jω)h o (jω)h(e jωt ) σ e