Recursive Average The recursive average is a very efficient way to obtain a time-weighted average by low-pass filtering the signal. y[n] = (1-a)y[n-1]

Slides:



Advertisements
Similar presentations
Equivalent Fractions Scott Foresman 7.7.
Advertisements

Laws of Indices or Powers © Christine Crisp. Laws of Indices Generalizing this, we get: Multiplying with Indices e.g.1 e.g.2.
1 The 2-to-4 decoder is a block which decodes the 2-bit binary inputs and produces four output All but one outputs are zero One output corresponding to.
Programmable FIR Filter Design
ES 112 Project 2 bit ALU.
Class Exercise 1A.
Digital Signal Processing – Chapter 11 Introduction to the Design of Discrete Filters Prof. Yasser Mostafa Kadah
ECE734 VLSI Arrays for Digital Signal Processing Algorithm Representations and Iteration Bound.
CHAPTER 4 Image Enhancement in Frequency Domain
Figure5.2 Half-adder.
Computer ArchitectureFall 2008 © August 25, CS 447 – Computer Architecture Lecture 3 Computer Arithmetic (1)
1  1998 Morgan Kaufmann Publishers Chapter Four Arithmetic for Computers.
Prepared by: Hind J. Zourob Heba M. Matter Supervisor: Dr. Hatem El-Aydi Faculty Of Engineering Communications & Control Engineering.
Finite Impuse Response Filters. Filters A filter is a system that processes a signal in some desired fashion. –A continuous-time signal or continuous.
Chapter 4: Sampling of Continuous-Time Signals
ELEN 5346/4304 DSP and Filter Design Fall Lecture 12: Number representation and Quantization effects Instructor: Dr. Gleb V. Tcheslavski Contact:
Sine Wave Generation on the XUP Virtex-II Pro Development System Steven Wasson ECE 443 – Hardware Design in VHDL Assignment 3 – Sine Wave Generation October.
Figure 5.1. Conversion from decimal to binary.. Table 5.1. Numbers in different systems.
Figure 5.1. Conversion from decimal to binary.. Table 5.1. Numbers in different systems.
Chapter 6 Digital Filter Structures
Floating Point Numbers Expressions Scanner Input Algorithms to Programs Shirley Moore CS 1401 Spring 2013 February 12, 2013.
Dividing and Reducing Monomials
Lecture 4 Multiplier using FPGA 2007/09/28 Prof. C.M. Kyung.
Equivalent Fractions Mrs. Walker 4th Grade.
1 Combinational Logic Design Digital Computer Logic Kashif Bashir
DSP Processors We have seen that the Multiply and Accumulate (MAC) operation is very prevalent in DSP computation computation of energy MA filters AR filters.
APPENDIX D R ANDOM N UMBER G ENERATION Organization of chapter in ISSO* – General description and linear congruential generators Criteria for “good” random.
Lecture notes Reading: Section 3.4, 3.5, 3.6 Multiplication
1 Multiplying fractions: Created by James Harris
Terra Nova Practice Lesson 10 Multiplying and Dividing Fractions.
Multiplying Fractions. When we multiply a fraction by an integer we: multiply by the numerator and divide by the denominator For example, × = 54.
Software Defined Radio PhD Program on Electrical Engineering Sampling Theory and Quantization José Vieira.
ABE425 Engineering Measurement Systems Fourier Transform, Sampling theorem, Convolution and Digital Filters Dr. Tony E. Grift Dept. of Agricultural.
CO5023 Introduction to Digital Circuits. What do we know so far? How to represent numbers (integers and floating point) in binary How to convert between.
KEYBOARD INTERFACING Keyboards are organized in a matrix of rows and columns The CPU accesses both rows and columns through ports. ƒTherefore, with two.
Under-Graduate Project Adviser: Prof. An-Yeu Wu Mentor: 詹承洲 第二組 溫仁揚 溫昌懌.
Recursive Architectures for 2DLNS Multiplication RESEARCH CENTRE FOR INTEGRATED MICROSYSTEMS - UNIVERSITY OF WINDSOR 11 Recursive Architectures for 2DLNS.
When you compare two fractions, you decide which is greater or which is less. If the fractions have common denominators, compare their numerators. The.
Chapter 6 Discrete-Time System. 2/90  Operation of discrete time system 1. Discrete time system where and are multiplier D is delay element Fig. 6-1.
Integer Review If you are combining two numbers with: SAME SIGNS YOU ADDTAKE THE SIGN OF THE LARGER NUMBER DIFFERENT SIGNS YOU SUBTRACT TAKE THE SIGN.
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.
Signed Arithmetic TYWu. Verilog 2001 Verilog 1995 provides only one signed data type, integer. Verilog 2001 provides a very rich set of new signed data.
George Mason University Class Exercise 1B. 2ECE 448 – FPGA and ASIC Design with VHDL Rules If you believe that you know a correct answer, please raise.
Resource Sharing in LegUp. Resource Sharing in High Level Synthesis Resource Sharing is a well-known technique in HLS to reduce circuit area by sharing.
In this lesson you are going to learn how to divide fractions by multiplying by the reciprocal.
Fractions Introduction and Review. Simplifying Fractions Divide the numerator (top) and denominator (bottom) by the same number Repeat, as needed 12 ÷
EE 445S Real-Time Digital Signal Processing Lab Fall 2013 Lab 3 IIR Filters Chao Jia Debarati Kundu Andrew Mark.
CHAPTER 1 INTRODUCTION NUMBER SYSTEMS AND CONVERSION
Linear Constant-coefficient Difference Equations
Equivalent Fractions And Simplest Form 6.NS.4.
Lecture #17 INTRODUCTION TO THE FAST FOURIER TRANSFORM ALGORITHM
Lect5 A framework for digital filter design
Reconstruction of Bandlimited Signal From Samples
Multiplying and Dividing Integers
Equivalent Fractions Lesson 3-4.
Fractions, Decimals & Percentages
1-8 Multiplying and Dividing Integers
Data Wordlength Reduction for Low-Power Signal Processing Software
Division and Modulo 15 Q A = Dividend B = Divisor Q = Quotient = A/B
Which fraction is the same as ?
Chapter5: Synchronous Sequential Logic – Part 4
95-1 Under-Graduate Project Fixed-point Analysis
Algorithms An algorithm is a set of instructions used to solve a specific problem In order to be useful, an algorithm must have the following properties:
Chapter 7 Finite Impulse Response(FIR) Filter Design
Converting between Percentages, Decimals and Fractions
Slope intercept form is:
Dividing negative fractions
8. Communication Systems
Presentation transcript:

Recursive Average The recursive average is a very efficient way to obtain a time-weighted average by low-pass filtering the signal. y[n] = (1-a)y[n-1] + ax[n] Consider the output for a step input if a =  Output initialized to 0

Recursive Average By careful choice of a, we can create extremely efficient integer versions in software and hardware. Choose a to be N/2 n, where n ≥ 0 and 0 < N < 2 n 1-a is then 1 – N/2 n The accumulator width is generally larger than the input and output widths Exercise – implement in Verilog Let a = 5/8 (0.625) x, y are 8-bit unsigned values Keep 8 bits of fractional precision in accumulator NO multiplies or divides!

Simulation Results Note that accumulator value is still increasing after y=254. Will it ever get to 255?