ECE4270 Fundamentals of DSP Lecture 20. Fixed-Point Arithmetic in FIR and IIR Filters (part I) Overview of Lecture. Overflow. FIR Digital Filter

Similar documents
DSP Configurations. responded with: thus the system function for this filter would be


Analysis of Finite Wordlength Effects

Lecture 19 IIR Filters

Discrete-time signals and systems

DSP Design Lecture 2. Fredrik Edman.

ECE503: Digital Signal Processing Lecture 6

FINITE PRECISION EFFECTS 1. FLOATING POINT VERSUS FIXED POINT 3. TYPES OF FINITE PRECISION EFFECTS 4. FACTORS INFLUENCING FINITE PRECISION EFFECTS

Analog vs. discrete signals

Digital Filter Structures. Basic IIR Digital Filter Structures. of an LTI digital filter is given by the convolution sum or, by the linear constant

Digital Signal Processing Lecture 9 - Design of Digital Filters - FIR

Discrete-Time Systems

EE 123: Digital Signal Processing Spring Lecture 23 April 10

Lecture 7 - IIR Filters

Digital Signal Processing Lecture 4

The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Final May 4, 2012

E : Lecture 1 Introduction

Lecture 11 FIR Filters

z-transforms Definition of the z-transform Chapter

Wiener Filtering. EE264: Lecture 12

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

Digital Signal Processing Lecture 5

Numbering Systems. Computational Platforms. Scaling and Round-off Noise. Special Purpose. here that is dedicated architecture

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

3 Finite Wordlength Effects

DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A

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

DFT & Fast Fourier Transform PART-A. 7. Calculate the number of multiplications needed in the calculation of DFT and FFT with 64 point sequence.

ELEG 305: Digital Signal Processing

An Fir-Filter Example: Hanning Filter

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

Massachusetts Institute of Technology

Digital Signal Processing

2. Typical Discrete-Time Systems All-Pass Systems (5.5) 2.2. Minimum-Phase Systems (5.6) 2.3. Generalized Linear-Phase Systems (5.

REAL TIME DIGITAL SIGNAL PROCESSING

EEL3135: Homework #4

Ch. 7: Z-transform Reading

Oversampling Converters

ECE 438 Exam 2 Solutions, 11/08/2006.

Lecture 18: Stability

ECE503: Digital Signal Processing Lecture 5

LECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)

Lab 4: Quantization, Oversampling, and Noise Shaping

EE482: Digital Signal Processing Applications

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

UNIT - III PART A. 2. Mention any two techniques for digitizing the transfer function of an analog filter?

Linear Convolution Using FFT

Homework #1 Solution

Z Transform (Part - II)

Introduction to DSP Time Domain Representation of Signals and Systems

Optimum Ordering and Pole-Zero Pairing. Optimum Ordering and Pole-Zero Pairing Consider the scaled cascade structure shown below

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Lecture 7 Discrete Systems

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

Let H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )

Design IIR Filters Using Cascaded Biquads

Digital Signal Processing Lecture 8 - Filter Design - IIR

EE 521: Instrumentation and Measurements

Detailed Solutions to Exercises

Lecture 5 - Assembly Programming(II), Intro to Digital Filters

IT DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A

ELEG 305: Digital Signal Processing

EE 5345 Biomedical Instrumentation Lecture 12: slides

( ) John A. Quinn Lecture. ESE 531: Digital Signal Processing. Lecture Outline. Frequency Response of LTI System. Example: Zero on Real Axis

EE123 Digital Signal Processing

Question Bank. UNIT 1 Part-A

EE538 Final Exam Fall 2007 Mon, Dec 10, 8-10 am RHPH 127 Dec. 10, Cover Sheet

CMPT 889: Lecture 5 Filters

Vel Tech High Tech Dr.Ranagarajan Dr.Sakunthala Engineering College Department of ECE

Digital Filters. Linearity and Time Invariance. Linear Time-Invariant (LTI) Filters: CMPT 889: Lecture 5 Filters

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF INFORMATION TECHNOLOGY. Academic Year

UNIT-II Z-TRANSFORM. This expression is also called a one sided z-transform. This non causal sequence produces positive powers of z in X (z).

Chapter 7: The z-transform

DISCRETE-TIME SIGNAL PROCESSING

UNIT 1. SIGNALS AND SYSTEM

ECE-S Introduction to Digital Signal Processing Lecture 3C Properties of Autocorrelation and Correlation

ELC 4351: Digital Signal Processing

Use: Analysis of systems, simple convolution, shorthand for e jw, stability. Motivation easier to write. Or X(z) = Z {x(n)}

CHANNEL PROCESSING TWIN DETECTORS CHANNEL PROCESSING TWIN DETECTORS CHANNEL PROCESSING TWIN DETECTORS CHANNEL PROCESSING TWIN DETECTORS

Transform analysis of LTI systems Oppenheim and Schafer, Second edition pp For LTI systems we can write

DSP-I DSP-I DSP-I DSP-I

Discrete Time Systems

APPLIED SIGNAL PROCESSING

Lecture 4: FT Pairs, Random Signals and z-transform

Lecture 3 Matlab Simulink Minimum Phase, Maximum Phase and Linear Phase Systems

HARDWARE IMPLEMENTATION OF FIR/IIR DIGITAL FILTERS USING INTEGRAL STOCHASTIC COMPUTATION. Arash Ardakani, François Leduc-Primeau and Warren J.

Topic 7: Filter types and structures

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches

Digital Filter Structures

Introduction to Digital Signal Processing

Practical Considerations in Fixed-Point FIR Filter Implementations

Part III Spectrum Estimation

Discrete Time Systems

Lecture 8 Finite Impulse Response Filters

Convolution. Define a mathematical operation on discrete-time signals called convolution, represented by *. Given two discrete-time signals x 1, x 2,

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

# FIR. [ ] = b k. # [ ]x[ n " k] [ ] = h k. x[ n] = Ae j" e j# ˆ n Complex exponential input. [ ]Ae j" e j ˆ. ˆ )Ae j# e j ˆ. y n. y n.

Digital Filters Ying Sun

Discrete-Time Signals & Systems

University of Waterloo Department of Electrical and Computer Engineering ECE 413 Digital Signal Processing. Spring Home Assignment 2 Solutions

Transcription:

ECE4270 Fundamentals of DSP Lecture 20 Fixed-Point Arithmetic in FIR and IIR Filters (part I) School of ECE Center for Signal and Information Processing Georgia Institute of Technology Overview of Lecture Two s-complement arithmetic Overflow Issues in FIR implementation: Quantizing filter coefficients Roundoff noise and Scaling Introduction to IIR Filter Structures and Quantization Coefficient Quantization effects in IIR filters Overflow Overflow can occur in two ways: Accumulator overflows due to additions Taking 16 bits out of the wrong part of a product Overflow can be prevented by: ore precision - use larger accumulator Saturation arithmetic - clip accumulator at largest value Shift products to the right to discard low-order bits. This results in loss of precision. y[n] h[k]x[n k] FIR Digital Filter accumulation (((h[0]x[n] h[1]x[n 1]) ) h[]x[n ]) To implement this filter, we must do multiply followed by accumulation (AC). 1

Linear oise odel Error is uncorrelated with the input. Error is uniformly distributed over the interval ( / 2) e[n] ( / 2). Error is stationary white noise, (i.e. flat spectrum) P e ( ) e 2 2 12, Roundoff oise in FIR Filters Using the AC instruction with quantized coefficients and quantized input, we can compute (Assume unquantized y[n] h[k]x[n k] input and coefficients) This sum of products can be computed with 32-bit precision; i.e., with no quantization of the partial sums. The result is usually quantized to 15 bits + sign. y ˆ [n] Q 15 y[n] y[n] e[n] The resulting noise power in the output is therefore e 2 2 /12 2 30 /12 FIR Digital Filter with Quantized Output Absolute Scaling an FIR Digital Filter x[n] h[0] h[1] h[2] h[ 1] h[] 32-bit accumulation y[n] Q 15 y ˆ [n] Q 15 y[n] Q 15 h[k]x[n k] y[n] e[n] x[n] h[0] h[1] h[2] h[ 1] h[] y[n] In this case, noise is added directly to the output. e[n] y ˆ [n] y ˆ [n] y[n] h[k]x[n k] y[n] h[k]x[n k] h[k] x[n k] y[n] max x[n] h[k] 1 no overflow 2

Sinusoidal Scaling for an FIR Filter Assume that the input is a sinusoid x[n] cos( 0 n) Then the output is y[n] H e j 0 cos 0 n H e j 0 Therefore, if we want y[n] 1, then we must guarantee that He j 1 for all This scaling is appropriate for most narrowband input signals. Conclusions on FIR Coefficient quantization can modify the zero locations and therefore the frequency response. This is usually not severe for linear phase filters Using the AC instruction, we can avoid roundoff (quantization) until the very end of the computation Scaling must be used to avoid overflow IIR Filter Structures and Quantization IIR filters are more complicated with regard to the effects of quantization. any different equivalent structures Coefficient sensitivity may be high Feedback is inherent in IIR structures Possibility of instability Roundoff noise is shaped by filter Some analysis is possible, but given the power of software tools such as ATLAB, an empirical approach is often most effective. Fixed-Point Implementation Issues We need to represent coefficient and signal values by integers in a fixed range. Quantization errors in coefficients imply shifts of poles and zeros (even instability). For a given word-length, the quantization error is fixed in size. Therefore, signal values should be maintained as large as possible to maximize SR. If signal values get too large, additions can overflow (or clip), thereby creating large errors. Thus, fixed-point implementations require careful attention to scaling the signal values. 3

Cascade Form b H(z) 0k b 1k z 1 b 2k z 2 s 1 a 1k z 1 a 2k z 2 k1 w k [n] a 1k w k [n 1] a 2k w k [n 2] y k1 [n] y k [n] b 0k w k [n] b 1k w k [n 1] b 2k w k [n 2] Cascade Implementation y 0 [n] x[n], y[n] y s [n] Direct Form II (flow graph) w[n] a k w[n k] x[n] y[n] b k w[n k] k1 Equivalent Direct Form The cascade form groups zeros and poles in pairs (second-order factors). These can be multiplied out to obtain single numerator and denominator polynomials in the direct forms I and II. b H(z) 0k b 1k z 1 b 2k z 2 s 1 a 1k z 1 a 2k z 2 k1 b k z k 1 a k z k k1 4

16-Bit Quantized Coefficients Quantized umerator Coefficients ˆ b k b k 0.01004671277613 0.01004028320312-0.04940368759854-0.04940795898438 0.15047336191420 0.15048217773438-0.31987136089868-0.31988525390625 0.53335872862212 0.53335571289062-0.71133037924498-0.71133422851562 0.78462412594880 0.78463745117188-0.71133037924498-0.71133422851562 0.53335872862212 0.53335571289062-0.31987136089868-0.31988525390625 0.15047336191420 0.15048217773438-0.04940368759854-0.04940795898438 0.01004671277613 0.01004028320312 Quantized Denominator Coefficients ˆ a k 1.00000000000000 1.00000000000000-5.22295000000000-5.22265625000000 16.76588243738500 16.76562500000000-36.82056676783901-36.82031250000000 62.25444673309200 62.25390625000000-82.41640461036937-82.41796875000000 88.36682598383915 88.36718750000000-76.16156361479057-76.16015625000000 53.16012384772395 53.16015625000000-29.04773747211416-29.04687500000000 12.21807179345019 12.21875000000000-3.51452513378527-3.51562500000000 0.62178984772852 0.62109375000000 a k o Quantization 5

16-Bit Quantized Direct Form 16-Bit Quantized Cascade Form Direct Form I IIR Filter Linear oise odel H(z) 1 b k z k a k z k k1 B(z) A(z) y[n] a k y[n k] b k x[n k] k1 Each noise source has power e 2 2 2B /12 The noise sources are independent so their powers add. 6

Linear System with a White oise Input x[n] xx [m] x 2 [m] LTI System h[n],h(e j ) y [n] yy [m] x 2 c hh [m] xx (e j ) x 2 yy (e j ) x 2 C hh (e j ) yy [m] xx [m]c hh [m] x 2 [m] c hh [m] x 2 c hh [m] c hh [m] h[m k] h [k] h[m]h [m] k yy (e j ) xx (e j )C hh (e j ) x 2 C hh (e j ) C hh (e j ) H(e j )H (e j ) H(e j ) 2 7