5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

LEUCEMIA MIELOIDE AGUDA TIPO 0
You have been given a mission and a code. Use the code to complete the mission and you will save the world from obliteration…
1 Vorlesung Informatik 2 Algorithmen und Datenstrukturen (Parallel Algorithms) Robin Pomplun.
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 1 Embedded Computing.
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 5 Author: Julia Richards and R. Scott Hawley.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
1 Chapter 40 - Physiology and Pathophysiology of Diuretic Action Copyright © 2013 Elsevier Inc. All rights reserved.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
Factors, Primes & Composite Numbers
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
Chapter 3: Top-Down Design with Functions Problem Solving & Program Design in C Sixth Edition By Jeri R. Hanly & Elliot B. Koffman.
2 pt 3 pt 4 pt 5pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2pt 3 pt 4pt 5 pt 1pt 2pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4pt 5 pt 1pt Two-step linear equations Variables.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
Multiplying binomials You will have 20 seconds to answer each of the following multiplication problems. If you get hung up, go to the next problem when.
0 - 0.
ALGEBRAIC EXPRESSIONS
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
MULTIPLICATION EQUATIONS 1. SOLVE FOR X 3. WHAT EVER YOU DO TO ONE SIDE YOU HAVE TO DO TO THE OTHER 2. DIVIDE BY THE NUMBER IN FRONT OF THE VARIABLE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Addition Facts
Year 6 mental test 5 second questions
1 Interprocess Communication 1. Ways of passing information 2. Guarded critical activities (e.g. updating shared data) 3. Proper sequencing in case of.
ZMQS ZMQS
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
Digital Filter Banks The digital filter bank is set of bandpass filters with either a common input or a summed output An M-band analysis filter bank is.
ABC Technology Project
TV Show Trivia Princeton Puzzle Hunt Do NOT flip over your answer sheet!
© S Haughton more than 3?
25 July, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
25 July, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
25 July, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
© Charles van Marrewijk, An Introduction to Geographical Economics Brakman, Garretsen, and Van Marrewijk.
“Start-to-End” Simulations Imaging of Single Molecules at the European XFEL Igor Zagorodnov S2E Meeting DESY 10. February 2014.
Twenty Questions Subject: Twenty Questions
Linking Verb? Action Verb or. Question 1 Define the term: action verb.
Squares and Square Root WALK. Solve each problem REVIEW:
Basel-ICU-Journal Challenge18/20/ Basel-ICU-Journal Challenge8/20/2014.
Duplex Fractions, f(x), and composite functions. [f(x) = Find f -1 (x)] A.[3x – 5 ] B.[3x – 15 ] C.[1.5x – 7.5 ] D.[Option 4]
Energy & Green Urbanism Markku Lappalainen Aalto University.
© 2012 National Heart Foundation of Australia. Slide 2.
Lets play bingo!!. Calculate: MEAN Calculate: MEDIAN
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
This, that, these, those Number your paper from 1-10.
Chapter 5 Test Review Sections 5-1 through 5-4.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
1 First EMRAS II Technical Meeting IAEA Headquarters, Vienna, 19–23 January 2009.
The op-amp Differentiator
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
Week 1.
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Figure Essential Cell Biology (© Garland Science 2010)
1 Unit 1 Kinematics Chapter 1 Day
PSSA Preparation.
How Cells Obtain Energy from Food
Computer Vision Lecture 7: The Fourier Transform
Presentation transcript:

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst Parallel Implementation of IIR Filters

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 2 Outline IIR Filters Implementation Methods – Look Ahead – Block-State – Incremental Block-State – Extra buffer Comparison All-pass Filters Conclusion and Future Work

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 3 IIR Filters Input Output

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 4 Describing Filters Transfer Function: Difference Equation: State space form:

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 5 Implementation We want: Sample rates exceeding processing rates This means parallel inputs and outputs, also called block implementations Implementations which scale well

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 6 Clustered Look Ahead Increase the size of the recursive loop The order of the filter increases Might become unstable nn-2n-1n n-P-1 n-P P

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 7 Scattered Look Ahead Increase the size of the recursive loop The order of the filter increases Remains stable Can be implemented with P parallel filters Non-recursive part can be decomposed nn-2n-1nn-2Pn-P PP

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 8 Block-State The state space form can be rewritten into a state space form using input and output vectors:

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 9 Block-State Architecture Input Output State

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 10 State update

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 11 Block-State

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 12 Incremental Block-State

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 13 Transform a Mealey into a Moore Machine Filter order increases by one P - 1 multipliers saved for Block-State P - P div I multipliers saved for Incremental Block-State Extra buffer State Output State Output

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 14 Comparison Efficiency: The number of multipliers used by an implementation compared to the theoretical optimum number. A single input, single output implementation of an IIR filter of order N requires 2 N + 1 multipliers. Therefore the theoretical optimum for an implementation handling P simultaneous inputs and outputs is P (2 N + 1) multipliers.

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 15 Efficiencies Scattered Look ahead Block-state Incremental Block-state Incremental Block-state with extra buffer

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 16 Efficiencies Scattered Look ahead Block-state Incremental Block-state Incremental Block-state with extra buffer N=8N=16 N=32N=64

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 17 All-pass Filters Also called phase shifters Theoretical optimum is P N

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 18 Conclusion Efficient block implementations for IIR filters exist These implementations can be used for all- pass filters Theoretically there is room for improvement in implementing all-pass filters

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 19 Future Work Finding more efficient all-pass implementations Adaptive Equalizers Other signal processing algorithms

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 20 Questions?

5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 21 Farewell Thang