Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science. OpenCourseWare 2006

Similar documents
EE123 Digital Signal Processing. Lecture 10 Practical ADC/DAC

Digital Signal Processing

ESE 531: Digital Signal Processing

PROBLEM SET 6. Note: This version is preliminary in that it does not yet have instructions for uploading the MATLAB problems.

Sampling of Continuous-Time Signals. Reference chapter 4 in Oppenheim and Schafer.

Lecture Outline. ESE 531: Digital Signal Processing. Anti-Aliasing Filter with ADC ADC. Oversampled ADC. Oversampled ADC

ESE 531: Digital Signal Processing

! Multi-Rate Filter Banks (con t) ! Data Converters. " Anti-aliasing " ADC. " Practical DAC. ! Noise Shaping

PROBLEM SET 5. Reminder: Quiz 1will be on March 6, during the regular class hour. Details to follow. z = e jω h[n] H(e jω ) H(z) DTFT.

Gábor C. Temes. School of Electrical Engineering and Computer Science Oregon State University. 1/25

II Year (04 Semester) EE6403 Discrete Time Systems and Signal Processing

Multirate Digital Signal Processing

Chapter 9. Chapter 9 275

Lecture Schedule: Week Date Lecture Title

Multirate DSP, part 3: ADC oversampling

Contents. Introduction 1 1 Suggested Reading 2 2 Equipment and Software Tools 2 3 Experiment 2

Ultra Wide Band Communications

EEE 309 Communication Theory

SAMPLING THEORY. Representing continuous signals with discrete numbers

Summary Last Lecture

Module 9: Multirate Digital Signal Processing Prof. Eliathamby Ambikairajah Dr. Tharmarajah Thiruvaran School of Electrical Engineering &

Time division multiplexing The block diagram for TDM is illustrated as shown in the figure

Lecture 4 Biosignal Processing. Digital Signal Processing and Analysis in Biomedical Systems

Frequency-Domain Sharing and Fourier Series

Chapter 2: Signal Representation

CHAPTER. delta-sigma modulators 1.0

Outline. Noise and Distortion. Noise basics Component and system noise Distortion INF4420. Jørgen Andreas Michaelsen Spring / 45 2 / 45

Fourier Methods of Spectral Estimation

2.1 BASIC CONCEPTS Basic Operations on Signals Time Shifting. Figure 2.2 Time shifting of a signal. Time Reversal.

EE 230 Lecture 39. Data Converters. Time and Amplitude Quantization

DISCRETE FOURIER TRANSFORM AND FILTER DESIGN

Signals and Systems. Lecture 13 Wednesday 6 th December 2017 DR TANIA STATHAKI

Signals and Systems Lecture 6: Fourier Applications

Digital Signal Processing

Outline. Discrete time signals. Impulse sampling z-transform Frequency response Stability INF4420. Jørgen Andreas Michaelsen Spring / 37 2 / 37

Lab 8. Signal Analysis Using Matlab Simulink

Chapter 2 DDSM and Applications

9.4 Temporal Channel Models

EE216B: VLSI Signal Processing. Wavelets. Prof. Dejan Marković Shortcomings of the Fourier Transform (FT)

Frequency Division Multiplexing Spring 2011 Lecture #14. Sinusoids and LTI Systems. Periodic Sequences. x[n] = x[n + N]

Signals and Systems Lecture 6: Fourier Applications

(i) Understanding the basic concepts of signal modeling, correlation, maximum likelihood estimation, least squares and iterative numerical methods

Compensation of Analog-to-Digital Converter Nonlinearities using Dither

CMPT 318: Lecture 4 Fundamentals of Digital Audio, Discrete-Time Signals

ELEC-C5230 Digitaalisen signaalinkäsittelyn perusteet

Measurements 2: Network Analysis

Continuous vs. Discrete signals. Sampling. Analog to Digital Conversion. CMPT 368: Lecture 4 Fundamentals of Digital Audio, Discrete-Time Signals

Cascaded Noise-Shaping Modulators for Oversampled Data Conversion

Comm 502: Communication Theory. Lecture 4. Line Coding M-ary PCM-Delta Modulation

Final Exam. EE313 Signals and Systems. Fall 1999, Prof. Brian L. Evans, Unique No

Fig 1 describes the proposed system. Keywords IIR, FIR, inverse Chebyshev, Elliptic, LMS, RLS.

EEE 309 Communication Theory

Theory of Telecommunications Networks

EE 351M Digital Signal Processing

Pulse Code Modulation

Copyright S. K. Mitra

System analysis and signal processing

Fourier Signal Analysis

On Event Signal Reconstruction in Wireless Sensor Networks

EELE 4310: Digital Signal Processing (DSP)

Digital Signal Processing (Subject Code: 7EC2)

B.Tech III Year II Semester (R13) Regular & Supplementary Examinations May/June 2017 DIGITAL SIGNAL PROCESSING (Common to ECE and EIE)

Sensors, Signals and Noise

Analog-to-Digital Converters

Chapter 7 Filter Design Techniques. Filter Design Techniques

EC 2301 Digital communication Question bank

ME scope Application Note 01 The FFT, Leakage, and Windowing

Chapter 2: Digitization of Sound

Laboratory Assignment 2 Signal Sampling, Manipulation, and Playback

EE 470 Signals and Systems

Baseband Compensation Techniques for Bandpass Nonlinearities

Lab.3. Tutorial : (draft) Introduction to CODECs

Speech Coding in the Frequency Domain

EE247 Lecture 26. This lecture is taped on Wed. Nov. 28 th due to conflict of regular class hours with a meeting

Music 270a: Fundamentals of Digital Audio and Discrete-Time Signals

Revision of Lecture 2

5650 chapter4. November 6, 2015

Lecture 10. Digital Modulation

SIGNALS AND SYSTEMS LABORATORY 13: Digital Communication

DFT: Discrete Fourier Transform & Linear Signal Processing

ULTRASONIC SIGNAL PROCESSING TOOLBOX User Manual v1.0

ECE 556 BASICS OF DIGITAL SPEECH PROCESSING. Assıst.Prof.Dr. Selma ÖZAYDIN Spring Term-2017 Lecture 2

Berkeley. Mixers: An Overview. Prof. Ali M. Niknejad. U.C. Berkeley Copyright c 2014 by Ali M. Niknejad

Digital Signal Processing

Digital Signal Processing

Outline. Introduction to Biosignal Processing. Overview of Signals. Measurement Systems. -Filtering -Acquisition Systems (Quantisation and Sampling)

Antennas and Propagation. Chapter 6b: Path Models Rayleigh, Rician Fading, MIMO

The Case for Oversampling

Digital Signal Processing:

Статистическая обработка сигналов. Введение

Signal Processing. Naureen Ghani. December 9, 2017

CDMA Mobile Radio Networks

Noise estimation and power spectrum analysis using different window techniques

INF4420. ΔΣ data converters. Jørgen Andreas Michaelsen Spring 2012

Crossing Game Strategies

Chapter 7 Spread-Spectrum Modulation

Continuous time and Discrete time Signals and Systems

Sampling and Signal Processing

Understanding Digital Signal Processing

Communications I (ELCN 306)

Transcription:

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.341: Discrete-Time Signal Processing OpenCourseWare 2006 Lecture 6 Quantization and Oversampled Noise Shaping Reading: Sections 4.8-4.9 in Oppenheim, Schafer & Buck (OSB). While the title of the course is Discrete-Time Signal Processing, practical implementations for many of the discussed systems rely on discrete-value data representations as well. This business of representing discrte-time signals using finite precision will be the focus of the lecture. The topic plays a key role in the problems of analog-to-digital and digital-to-analog conversion. So far we ve explicitly studied C/D and D/C conversion, and within this context we have looked at how CT signals are processed by a DT system. In practice, however, a common scheme for operating in discrete-time on continuous-time signals consists of a sample-and-hold stage, followed by digitization of the resulting analog signal. This overall scheme is depicted in OSB Figure 4.45, and the effect of the sample-and-hold block is illustrated in OSB Figure 4.46(b). Decomposing the system in OSB Figure 4.45 into a more easily analyzable conceptual representation, we arrive at OSB Figure 4.47, which contains the familiar C/D block. Typical behavior of the quantizer and coder blocks from the figure are illustrated in OSB Figure 4.48 for 3-bit uniform quantization. With a uniform quantization scheme, representing x[n] using B + 1 bits means that the signal is quantized to 2 B+1 levels, so if x[n] has maximum value X M such that X M x[n] < +X M, these 2 B+1 levels must cover the range ±X M. This implies that the spacing between adjacent quantization levels is therefore = X M 2 B. The question then arises of how to analyze the error introduced by the process of quantization. Since a quantizer is generally a highly nonlinear system, we instead choose to use an additive noise model in its place, as depicted in OSB Figure 4.50. While the appropriateness of using such a model is perhaps best evaluated on a case-by-case basis, we ll see that this model does allow us to conveniently analyze the effects of signal quantization for a number of systems. The output of a quantizer ˆx[n] is represented in the additive noise model as ˆx[n] = x[n] + e[n], where e[n] is the additive noise source. We ll now discuss the statistics of e[n]. As a starting point, we know that e[n] cannot take on values greater than /2 or less than /2. It 1

may furthermore seem reasonable that the distribution of e[n] is uniform for many signals encountered in practice. The full set of assumptions made by the additive noise model are discussed in Section 4.8.3 of OSB. Briefly, they are: e[n] is a sample sequence of a stationary random process. e[n] is uncorreletaed with x[n]. e[n] is a white-noise process. The probability distribution of e[n] is uniform over the range /2 to /2, as illustrated in OSB Figure 4.52. The expected value of e[n] is therefore and its variance is E{e[n]} = 0, σe 2 =. Because it is a white-noise process, its autocorrelation is and its power spectral density is The total noise power is therefore φ ee [m] = σ[m], Φ ee (e jω ) =. 1 π dω = φ ee [0]. 2φ π Now that we ve introduced and analyzed this additive noise model, take a few seconds to think about how systems such as this one might be replaced by something like the following system, which typically uses less-expensive analog hardware: 2

As a further teaser, consider that a related configuration appears in a number of applications in practice, such as the AD73311 CODEC and many compact disk players: A common theme in each of these systems is that sampling rate conversion is used to help mitigate quantization effects. But how exactly does the process of rate conversion affect quantization noise? We ll use the system depicted in OSB Figure 4.56 and its corresponding linear noise model (OSB Figure 4.57) to address this question. The total noise power at ˆx[n] in OSB Figure 4.57 is, according to the linear noise model, φ ee [0] = 2. When this signal is lowpass filtered by the ideal LPF with ω c = φ/m, the total noise power is divided by M, resulting in a 3

total noise power of 2 M after lowpass filtering. As long as no aliasing occurs, the total noise power at the output of a compressor-by-m is the same as that of its input signal, so we know that the total noise power at the output of the system is Total noise power at output of system in OSB Figure 4.57 =. M Furthermore, the resulting noise at the output of the system is still a white-noise process, and its PSD is Φ ee (e jω ) = M. This is demonstrated graphically in OSB Figures 4.59 and 4.60. Note that when M is doubled, the total noise power is halved. Since = X M 2 B, XM 2 4 B =. Therefore, doubling M corresponds to halving the total noise power, which implies 1 X 2 2 B X 2 4 (B+ 2 M M ) = =. 2 A doubling of M, then, has the same effect in terms of total noise power as adding an extra half-bit of precision to the quantizer. We ll now discuss noise shaping, a method for further controlling quantization noise which has the ability to reduce in-band noise to a still greater degree. Let s first consider the system in OSB Figure 4.68 and its associated additive noise model (OSB Figure 4.69). The system in OSB Figure 4.68 implements what might be considered a first logical stab at designing a linear system to reduce the effects of quantization noise. Looking at OSB Figure 4.69 for further insight, the system works by first obtaining the error signal e[n], delaying it, and then using it to pre-compensate the input signal so that as long as e[n] is changing very slowly, it is mostly cancelled at y[n] by this pre-compensation. (Removing the delay block would cause the error at y[n] to be exactly 0, but it would also prevent the system from being physically realizable.) Exactly how slowly does e[n] need to be changing so that it is singificantly reduced? The question can be answered by determining how the system responds at y[n] to an input at e[n]. Using superposition, ŷ[n] = 0, and so y[n] = e[n] e[n 1]. The deterministic transfer function from e[n] to y[n] is therefore Y (e jω ) = 1 e jω, E(e jω ) with magnitude-squared response Y (e jω ) 2 ( ( = 1 e jω 1 e jω = 2 2 cos ω = 4 sin 2 (ω/2). E(e jω ) 1 4

The PSD of the noise at the system output then becomes Φ êê (e jω ) = 4 sin 2 (ω/2), as depicted in OSB Figure 4.64. Lowpass filtering the resulting signal by an ideal LPF with ω c = φ/m and compressing by M eliminates out-of-band noise and therefore reduces the overall noise power. This result is shown in OSB Figure 4.65, and a number of implementations of this type of cascaded system are discussed in OSB. Note that in practice, higher-order noise shaping systems are often designed to provide more detailed control of the resultant noise power spectrum. There are a number of practical issues associated with implementing such systems, and challenges in many of these cases relate to the additive noise model as an analytically convenient but nonetheless approximate representation. In parting, consider OSB Table 4.2, which compares the order of a noise shaper p and oversampling factor M to the equivalent reduction in quantizer bits. 5