Filter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design
|
|
- Pierce Carpenter
- 5 years ago
- Views:
Transcription
1 Filter desig Desig cosideratios: a framework C ı p ı p H(f) Aalysis of fiite wordlegth effects: I practice oe should check that the quatisatio used i the implemetatio does ot degrade the performace of the filter to a poit where it is uusable. Implemetatio: The filter is implemeted i software or hardware. The criteria for selectig the implemetatio method ivolve issues such as real-time performace, complexity, processig requiremets, ad availability of equipmet. Fiite impulse respose (FIR) filter desig A FIR filter is characterised by the equatios ı s Passbad f p f s Trasitio bad The desig of a digital filter ivolves five steps: Stopbad Specificatio: The characteristics of the filter ofte have to be specified i the frequecy domai. For example, for frequecy selective filters (lowpass, highpass, badpass, etc.) the specificatio usually ivolves tolerace limits as show above. Coefficiet calculatio: Approximatio methods have to be used to calculate the values hœk for a FIR implemetatio, or a k, b k for a IIR implemetatio. Equivaletly, this ivolves fidig a filter which has H.z/ satisfyig the requiremets. Realisatio: This ivolves covertig H.z/ ito a suitable filter structure. Block or flow diagrams are ofte used to depict filter structures, ad show the computatioal procedure for implemetig the digital filter. f yœ D H.z/ D kd hœkxœ kd hœkz k : The followig are useful properties of FIR filters: They are always stable the system fuctio cotais o poles. This is particularly useful for adaptive filters. They ca have a exactly liear phase respose. The result is o frequecy dispersio, which is good for pulse ad data trasmissio. Fiite legth register effects are simpler to aalyse ad of less cosequece tha for IIR filters. They are very simple to implemet, ad all DSP processors have architectures that are suited to FIR filterig. For large N (may filter taps), the FFT ca be used to improve performace. k
2 Of these, the liear phase property is probably the most importat. A filter is said to have a geeralised liear phase respose if its frequecy respose ca be expressed i the form H.e j! / D A.e j! /e j!cjˇ where ad ˇ are costats, ad A.e j! / is a real fuctio of!. If this is the case, the If A is positive, the the phase is Cosider for example the case of a odd umber of samples i hœ, ad eve symmetry. The frequecy respose for N D 7 is H.e j! / D 6 hœe j! D D hœ C hœe j! C hœe j! C hœ3e j 3! C hœ4e j 4! C hœ5e j 5! C hœ6e j 6! D e j 3!.hŒe j 3! C hœe j! C hœe j! C hœ3 C hœ4e j! ^H.e j! / D ˇ!: C hœ5e j! C hœ6e j 3! /: If A is egative, the ^H.e j! / D C ˇ I either case, the phase is a liear fuctio of!.!: It is commo to restrict the filter to havig a real-valued impulse respose hœ, sice this greatly simplifies the computatioal complexity i the implemetatio of the filter. A FIR system has liear phase if the impulse respose satisfies either the eve symmetric coditio or the odd symmetric coditio hœ D hœn ; hœ D hœn : The system has differet characteristics depedig o whether N is eve or odd. Furthermore, it ca be show that all liear phase filters must satisfy oe of these coditios. Thus there are exactly four types of liear phase filters. The specified symmetry property meas that hœ D hœ6, hœ D hœ5, ad hœ D hœ4, so H.e j! / D e j 3!.hŒ.e j 3! C e j 3! / C hœ.e j! C e j! / C hœ.e j! C e j! / C hœ3/ D e j 3!.hŒ cos.3!/ C hœ cos.!/ C hœ cos.!// D e j 3! 3 aœ cos.!/; D where aœ D hœ3, ad aœ D hœ3 for D ; ; 3. The resultig filter clearly has a liear phase respose for real hœ. It is quite simple to show that i geeral for odd values of N the frequecy respose is.n /= H.e j! / D e j!.n /= D aœ cos.!/; for a set of real-valued coefficiets aœ; : : : ; aœ.n /=. As differet values for aœ are selected, differet liear-phase filters are obtaied. 3 4
3 The cases of N odd ad hœ atisymmetric are similar to that preseted, ad the frequecy resposes are summarised i the followig table: Symmetry N H.e j! / Type h [] N /= Eve Odd e j!.n /= D aœ cos.! / N= Eve Eve e j!.n /= bœ cos.!. =// D.N /= Odd Odd e j Œ!.N /= = D aœ si.! / 3 N= Odd Eve e j Œ!.N /= = bœ si.!. =// 4 Recall that eve symmetry implies hœ D hœn ad odd symmetry hœ D hœn. Examples of filters satisfyig each of these symmetry coditios are: D h [] h 3 [] h 4 [] The ceter of symmetry is idicated by the dotted lie. The process of liear-phase filter desig ivolves choosig the aœ values to obtai a filter with a desired frequecy respose. This is ot always possible, however the frequecy respose for a type II filter, for example, has the property that it is always zero for! D, ad is therefore ot appropriate for a highpass filter. Similarly, filters of type 3 ad 4 itroduce a 9 ı phase shift, ad have a frequecy respose that is always zero at! D which makes them usuitable for as lowpass filters. Additioally, the type 3 respose is always zero at! D, makig it usuitable as a highpass filter. The type I filter is the most versatile of the four. Liear phase filters ca be thought of i a differet way. Recall that a liear phase characteristic simply correspods to a time shift or delay. Cosider ow a real FIR filter with a impulse respose that satisfies the eve symmetry coditio hœ D hœ : 5 6
4 hœ H.e j! / Recall from the properties of the Fourier trasform this filter has a real-valued frequecy respose A.e j! /. Delayig this impulse respose by.n /= results i a causal filter with frequecy respose This filter therefore has liear phase. hœ ^H.e j! / H.e j! / D A.e j! /e j!.n /= : 4 6 jh.e j! /j 5. Widow method for FIR filter desig Assume that the desired filter respose H d.e j! / is kow. Usig the iverse Fourier trasform we ca determie h d Œ, the desired uit sample respose. I the widow method, a FIR filter is obtaied by multiplyig a widow wœ with h d Œ to obtai a fiite duratio hœ of legth N. This is required sice h d Œ will i geeral be a ifiite duratio sequece, ad the correspodig filter will therefore ot be realisable. If h d Œ is eve or odd symmetric ad wœ is eve symmetric, the h d ŒwŒ is a liear phase filter. Two importat desig criteria are the legth ad shape of the widow wœ. To see how these factors ifluece the desig, cosider the multiplicatio operatio i the frequecy domai: sice hœ D h d ŒwŒ, H.e j! / D H d.e j! / W.e j! /: The followig plot demostrates the covolutio operatio. I each case the dotted lie idicates the desired respose H d.e j! /. W.e j.! / / H.e j! / From this, ote that! θ The mailobe width of W.e j! / affects the trasitio width of H.e j! /. Icreasig the legth N of hœ reduces the mailobe width ad hece the 3 3 7
5 trasitio width of the overall respose. The sidelobes of W.e j! / affect the passbad ad stopbad tolerace of H.e j! /. This ca be cotrolled by chagig the shape of the widow. Chagig N does ot affect the sidelobe behaviour. Some commoly used widows for filter desig are Rectagular: < N wœ D : otherwise Bartlett (triagular): ˆ< =N N= wœ D =N N= < N ˆ: otherwise Haig: < :5 :5 cos.=n / N wœ D : otherwise Hammig: < :54 :46 cos.=n / N wœ D : otherwise Kaiser: < I Œˇ. Œ. /= / = N wœ D : otherwise Examples of five of these widows are show below: wœ wœ.5 N/ N.5 Rectagular Triagular N/ N Haig Hammig Blackma All widows trade off a reductio i sidelobe level agaist a icrease i mailobe width. This is demostrated below i a plot of the frequecy respose of each of the widows: log jw.e j! /j log jw.e j! /j 5 5 Rectagular Triagular Haig Hammig Blackma Some importat widow characteristics are compared i the followig table: 9
6 Widow Peak sidelobe Mailobe Peak approximatio amplitude (db) trasitio width error (db) Rectagular 3 4=.N C / Bartlett 5 =N 5 Haig 3 =N 44 Hammig 4 =N 53 The Kaiser widow has a umber of parameters that ca be used to explicitly tue the characteristics. I practice, the widow shape is chose first based o passbad ad stopbad tolerace requiremets. The widow size is the determied based o trasitio width requiremets. To determie h d Œ from H d.e j! / oe ca sample H d.e j! / closely ad use a large iverse DFT.. Frequecy samplig method for FIR filter desig I this desig method, the desired frequecy respose H d.e j! / is sampled at equally-spaced poits, ad the result is iverse discrete Fourier trasformed. Specifically, lettig HŒk D H d.e j! /ˇˇ!D k N ; k D ; : : : ; N ; the uit sample respose of the filter is hœ D IDFT.HŒk/, so a filter with real-valued coefficiets is required, the additioal costraits have to be eforced. The actual frequecy respose H.e j! / of the filter hœ still has to be determied. The z-trasform of the impulse respose is " # N H.z/ D hœz D HŒke j k=n z N D D N D N kd kd D HŒk D kd e j k=n z z N HŒk e j k=n z Evaluatig o the uit circle z D e j! gives the frequecy respose H.e j! / D e j!n N kd : HŒk e j k=n e j! : This expressio ca be used to fid the actual frequecy respose of the filter obtaied, which ca be compared with the desired respose. The method described oly guaratees correct frequecy respose values at the poits that were sampled. This sometimes leads to excessive ripple at itermediate poits: hœ D N kd HŒke j k=n : The resultig filter will have a frequecy respose that is exactly the same as the origial respose at the samplig istats. Note that it is also ecessary to specify the phase of the desired respose H d.e j! /, ad it is usually chose to be a liear fuctio of frequecy to esure a liear phase filter. Additioally, if
7 .. jh.e j! j..6.4 jh.e j! j Actual Desired. Actual Desired Oe way of addressig this problem is to allow trasitio samples i the regio where discotiuities i H d.e j! / occur: T T By leavig the value of the trasitio sample ucostraied, oe ca to some extet optimise the filter to miimise the ripple. Empirically, with three trasitio samples a stopbad atteuatio of db is achievable. Recall however that for hœ real we require eve or odd symmetry i the impulse respose, so the values are ot etirely ucostraied. T 3.3 Optimum approximatios of FIR filters Passbad Trasitio bad Stopbad This effectively icreases the trasitio width ad ca decrease the ripple, as observed below: This method of filter desig attempts to fid the filter of legth N that optimises a give desig objective. I this case the objective is chose to be the miimisatio of max! je.ej! /j where E.e j! / is a weighted error fuctio E.e j! / D W.e j! /ŒH d.e j! / H.e j! /: The miimisatio is performed over the filter coefficiets hœ. I practice, the desig problem ca be specified as follows: give ı p, ı s, f p, ad f s, determie hœ such that the desig specificatio is satisfied with the smallest possible N. The optimal (or miimax) desig method therefore yields 3 4
8 the shortest filter that meets a required frequecy respose over the etire frequecy rage. It is widely used i practice. Solutios to this optimisatio problem have bee explored i the literature, ad may implemetatios of the method are available. It turs out that whe max je.e j! /j is miimised, the resultig filter respose will have equiripple passbad ad stopbad, with the ripple alteratig i sig betwee two equal amplitude levels: jh.e j! j The maxima ad miima are kow as extrema. For liear phase lowpass filters, for example, there are either r C or r C extrema, where r D.N C /= (for type filters) or r D N= (for type filters). For a give set of filter specificatios, the locatios of the extremal frequecies, apart from those at bad edges, are ot kow a priori. Thus the mai problem i the optimal method is to fid the locatios of the extremal frequecies. Numerous algorithms exist to do this. Oce the locatios of the extremal frequecies are kow, it is simple to specify the actual frequecy respose, ad hece fid the impulse respose for the filter. 3 Ifiite impulse respose (IIR) filter desig A IIR filter has ozero values of the impulse respose for all values of, eve as!. To implemet such a filter usig a FIR structure therefore requires a ifiite umber of calculatios. However, i may cases IIR filters ca be realised usig LCCDEs ad computed recursively. Example: A filter with the ifiite impulse respose hœ D.=/ uœ has z-trasform Therefore, yœ D =yœ H.z/ D =z D Y.z/.z/ : C xœ, ad yœ is easy to calculate. IIR filter structures ca therefore be far more computatioally efficiet tha FIR filters, particularly for log impulse resposes. FIR filters are stable for hœ bouded, ad ca be made to have a liear phase respose. IIR filters, o the other had, are stable if the poles are iside the uit circle, ad have a phase respose that is difficult to specify. The geeral approach take is to specify the magitude respose, ad regard the phase as acceptable. This is a disadvatage of IIR filters. IIR filter desig is discussed i most DSP texts. 5 6
Chapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More informationSpectral leakage and windowing
EEL33: Discrete-Time Sigals ad Systems Spectral leakage ad widowig. Itroductio Spectral leakage ad widowig I these otes, we itroduce the idea of widowig for reducig the effects of spectral leakage, ad
More informationEE123 Digital Signal Processing
Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add
More informationLinear Time-Invariant Systems
9/9/00 LIEAR TIE-IVARIAT SYSTES Uit, d Part Liear Time-Ivariat Sstems A importat class of discrete-time sstem cosists of those that are Liear Priciple of superpositio Time-ivariat dela of the iput sequece
More informationThe following algorithms have been tested as a method of converting an I.F. from 16 to 512 MHz to 31 real 16 MHz USB channels:
DBE Memo#1 MARK 5 MEMO #18 MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS 1886 November 19, 24 Telephoe: 978-692-4764 Fax: 781-981-59 To: From: Mark 5 Developmet Group
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationCIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)
CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig
More informationConsider the following population data for the state of California. Year Population
Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationOptimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method
Volume VI, Issue III, March 7 ISSN 78-5 Optimum Solutio of Quadratic Programmig Problem: By Wolfe s Modified Simple Method Kalpaa Lokhade, P. G. Khot & N. W. Khobragade, Departmet of Mathematics, MJP Educatioal
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationEE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control
EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,
More informationMath Section 2.2 Polynomial Functions
Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably
More informationNumerical Methods Lecture 6 - Curve Fitting Techniques
Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationCh 9.3 Geometric Sequences and Series Lessons
Ch 9.3 Geometric Sequeces ad Series Lessos SKILLS OBJECTIVES Recogize a geometric sequece. Fid the geeral, th term of a geometric sequece. Evaluate a fiite geometric series. Evaluate a ifiite geometric
More informationLecture 28: Data Link Layer
Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
More informationSection 7.2: Direction Fields and Euler s Methods
Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More informationLecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein
068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig
More informationCivil Engineering Computation
Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso
More information( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb
Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More informationData diverse software fault tolerance techniques
Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the
More informationCounting Regions in the Plane and More 1
Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationAppendix D. Controller Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);
More informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationFundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le
Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:
More informationAn (or ) is a sequence in which each term after the first differs from the preceding term by a fixed constant, called the.
Sectio.2 Arithmetic Sequeces ad Series -.2 Arithmetic Sequeces ad Series Arithmetic Sequeces Arithmetic Series Key Terms: arithmetic sequece (arithmetic progressio), commo differece, arithmetic series
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationNTH, GEOMETRIC, AND TELESCOPING TEST
NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few
More informationDesigning a learning system
CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try
More information1.1 1-D Spectra via Method of Stationary Phase
1.1 1-D SPECTRA VIA METHOD OF STATIONARY PHASE 1 1.1 1-D Spectra via Method of Statioary Phase Now we cosider a differet approximatio of the Fourier trasform that is valid for certai 1-D fuctios at large
More informationn n B. How many subsets of C are there of cardinality n. We are selecting elements for such a
4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
More informationOptimal Mapped Mesh on the Circle
Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationAlpha Individual Solutions MAΘ National Convention 2013
Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationHash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative
More informationK-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns
K-NET bus The K-Net bus is based o the SPI bus but it allows to addressig may differet turrets like the I 2 C bus. The K-Net is 6 a wires bus (4 for SPI wires ad 2 additioal wires for request ad ackowledge
More informationOutline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis
Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis
More informationCSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)
CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a
More informationOCR Statistics 1. Working with data. Section 3: Measures of spread
Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.
More information9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4
1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationEM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS
EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit
More informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical
More informationFPGA IMPLEMENTATION OF BASE-N LOGARITHM. Salvador E. Tropea
FPGA IMPLEMENTATION OF BASE-N LOGARITHM Salvador E. Tropea Electróica e Iformática Istituto Nacioal de Tecología Idustrial Bueos Aires, Argetia email: salvador@iti.gov.ar ABSTRACT I this work, we preset
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More information1. Introduction o Microscopic property responsible for MRI Show and discuss graphics that go from macro to H nucleus with N-S pole
Page 1 Very Quick Itroductio to MRI The poit of this itroductio is to give the studet a sufficietly accurate metal picture of MRI to help uderstad its impact o image registratio. The two major aspects
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationWhich movie we can suggest to Anne?
ECOLE CENTRALE SUPELEC MASTER DSBI DECISION MODELING TUTORIAL COLLABORATIVE FILTERING AS A MODEL OF GROUP DECISION-MAKING You kow that the low-tech way to get recommedatios for products, movies, or etertaiig
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationOutline. Applications of FFT in Communications. Fundamental FFT Algorithms. FFT Circuit Design Architectures. Conclusions
FFT Circuit Desig Outlie Applicatios of FFT i Commuicatios Fudametal FFT Algorithms FFT Circuit Desig Architectures Coclusios DAB Receiver Tuer OFDM Demodulator Chael Decoder Mpeg Audio Decoder 56/5/ 4/48
More informationSolution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions:
CS 604 Data Structures Midterm Sprig, 00 VIRG INIA POLYTECHNIC INSTITUTE AND STATE U T PROSI M UNI VERSI TY Istructios: Prit your ame i the space provided below. This examiatio is closed book ad closed
More informationAN OPTIMIZATION NETWORK FOR MATRIX INVERSION
397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio
More informationImpact of thin film metrology on the lithographic performance of 193nm bottom antireflective coatings
Impact of thi film metrology o the lithographic performace of 193m bottom atireflective coatigs Chris A. Mack a, Dale Harriso b, Cristia Rivas b, ad Phillip Walsh b a Lithoguru.com, Austi, TX b MetroSol,
More information1. SWITCHING FUNDAMENTALS
. SWITCING FUNDMENTLS Switchig is the provisio of a o-demad coectio betwee two ed poits. Two distict switchig techiques are employed i commuicatio etwors-- circuit switchig ad pacet switchig. Circuit switchig
More informationDescriptive Statistics Summary Lists
Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard
More informationFINITE DIFFERENCE TIME DOMAIN METHOD (FDTD)
FINIT DIFFRNC TIM DOMAIN MTOD (FDTD) The FDTD method, proposed b Yee, 1966, is aother umerical method, used widel for the solutio of M problems. It is used to solve ope-regio scatterig, radiatio, diffusio,
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationSD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.
SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that
More informationOptimized Aperiodic Concentric Ring Arrays
24th Aual Review of Progress i Applied Computatioal Electromagetics March 30 - April 4, 2008 - iagara Falls, Caada 2008 ACES Optimized Aperiodic Cocetric Rig Arrays Rady L Haupt The Pesylvaia State Uiversity
More informationPrecise Psychoacoustic Correction Method Based on Calculation of JND Level
Vol. 116 (2009) ACTA PHYSICA POLONICA A No. 3 Optical ad Acoustical Methods i Sciece ad Techology Precise Psychoacoustic Correctio Method Based o Calculatio of JND Level Z. Piotrowski Faculty of Electroics,
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationChapter 3. Floating Point Arithmetic
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 3 Floatig Poit Arithmetic Review - Multiplicatio 0 1 1 0 = 6 multiplicad 32-bit ALU shift product right multiplier add
More informationModule 8-7: Pascal s Triangle and the Binomial Theorem
Module 8-7: Pascal s Triagle ad the Biomial Theorem Gregory V. Bard April 5, 017 A Note about Notatio Just to recall, all of the followig mea the same thig: ( 7 7C 4 C4 7 7C4 5 4 ad they are (all proouced
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationSAMPLE VERSUS POPULATION. Population - consists of all possible measurements that can be made on a particular item or procedure.
SAMPLE VERSUS POPULATION Populatio - cosists of all possible measuremets that ca be made o a particular item or procedure. Ofte a populatio has a ifiite umber of data elemets Geerally expese to determie
More informationA General Framework for Accurate Statistical Timing Analysis Considering Correlations
A Geeral Framework for Accurate Statistical Timig Aalysis Cosiderig Correlatios 7.4 Vishal Khadelwal Departmet of ECE Uiversity of Marylad-College Park vishalk@glue.umd.edu Akur Srivastava Departmet of
More informationTO design and improve heuristic search algorithms for
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION O the Ladscape of Combiatorial Optimisatio Problems Mohammad-H. Tayarai-N. ad Adam Prügel-Beett Abstract This paper carries out a compariso of the fitess ladscape
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More information