TOPICS MULTIPLIERLESS FILTER DESIGN ELEMENTARY SCHOOL ALGORITHM MULTIPLICATION
|
|
- Quentin Pitts
- 5 years ago
- Views:
Transcription
1 1 2 MULTIPLIERLESS FILTER DESIGN Realzaton of flters wthout full-fledged multplers Some sldes based on support materal by W. Wolf for hs book Modern VLSI Desgn, 3 rd edton. Partly based on followng papers: Hewltt, R.M. and E.S. Swartzlander, "Canoncal Sgned Dgt Representaton for FIR Dgtal Flters", IEEE Workshop on Sgnal Processng Systems, SPS 2, Lafayette, LA, pp , (2). Voronenko, Y. and M. Pueschel, Multplerless Multple Constant Multplcaton, ACM Transactons on Algorthms, Vol. 3(2), (May 27). Aksoy, L., P. Flores and J. Montero, A Tutoral on Multplerless Desgn of FIR Flters: Algorthms and Archtectures, Crcuts, Systems and Sgnal Processng, Vol.33(6), pp , (214). TOPICS Multpler wrap-up: Array multpler Booth multpler Flter structures: drect, transposed and hybrd forms Canoncal sgned dgt Optmal sngle and multple-constant multplcaton Choosng coeffcents 3 4 MULTIPLICATION ELEMENTARY SCHOOL ALGORITHM Dstngush between: Multplcaton of two varables Multplcaton of one varable by a constant (scalng) opportuntes of optmzaton Constants: Can be consdered as gven Can be specally chosen Implementaton: One-to-one Resource sharng In software, on processor wthout hardware multpler Unsgned numbers! 1 1 multplcand x 1 1 multpler partal product
2 5 ARRAY MULTIPLIER 6 ARRAY MULTIPLIER ORGANIZATION Array multpler s an effcent layout of a combnatonal (parallel-parallel) multpler. Array multplers may be ppelned to decrease clock perod at the expense of latency. multplcand multpler product 1 1 x skew array for rectangular layout y y1 y2 y3 7 UNSIGNED 4X4 ARRAY MULTIPLIER x3y3 x3y2 x2y3 x3y1 x2y2 x1y3 x3 x3y x2 x2y x2y1 x1y2 xy3 x1y1 xy2 x1 x1y x xy xy1 8 ARRAY MULTIPLIER COMPONENTS AND gates FULL ADDERs HALF ADDERs A B Carry n A B Full adder Half adder Sum Carry out Sum Carry out Fast multplcaton amounts to reducng the crtcal path. P7 P6 P5 P4 P3 P2 P1 P
3 9 2 S COMPLEMENT MULTIPLICATION (1) An n-bt number X, and an m-bt number Y: X n 2 n x n x m 2 m 1 m 12 2 Y y y 1 2 S COMPLEMENT MULTIPLICATION (2) Product: P XY x y m n 2 n 1 m 12 n 2 m 2 j xy m 2 n 2 n 1 m 1 yx n 1 xy m j 2 j 11 2 S COMPLEMENT MULTIPLICATION (3) x 2 n 2 n x 2 n k k Note that: and: Therefore: m 2 m 2 m 2 n 1 n 1 n 1 yx n 1 yx n 1 m 2 n m 2 n 1 n yx n S COMPLEMENT MULTIPLICATION (4) The product becomes: n 2 m 2 j P XY x y n m 2 n 1 m 12 xy j j n m 1 n 2 m 2 m 2 n 2 n 1 m 1 yx n 1 xy m
4 13 14 BAUGH-WOOLEY MULTIPLIER Algorthm for two s-complement multplcaton. Careful processng of partal products leads to: Array wth only addtons, no subtractons No hardware for sgn extensons n upper left corner Acheved by: Negaton of some partal products Injecton of ones n some array postons 1 y y1 y2 y3 BAUGH-WOOLEY SIGNED 4X4 ARRAY MULTIPLIER x3y3 x3y2 x2y3 x3y1 x2y2 x1y3 x3 x3y 1 x2y1 x1y2 xy3 x2 x2y x1y1 xy2 x1 x1y x xy xy1 P7 P6 P5 P4 P3 P2 P1 P 15 BOOTH MULTIPLIER Encodng scheme to reduce number of stages n multplcaton. Performs two bts of multplcaton at once; requres half the stages. Each stage s slghtly more complex than an adder. 16 The wanted product: x*y. BOOTH ENCODING Two s-complement form of multpler: y = -2 n y n 2 n-1 y n-1 2 n-2 y n-2... Rewrte usng 2 a = 2 a1-2 a : y = 2 n (y n-1 -y n ) 2 n-1 (y n-2 -y n-1 ) 2 n-2 (y n-3 -y n-2 ) 2 n-3 (y n-4 -y n-3 )... y = 2 n-1 (2(y n-1 -y n ) (y n-2 -y n-1 )) 2 n-3 (2(y n-3 -y n-2 ) (y n-4 -y n-3 ))... Consder frst two terms: by lookng at three bts of y, we can determne whether to add x, 2x,-x, -2x,or to partal product.
5 17 BOOTH ACTIONS y y -1 y -2 ncrement (2(y -1 y ) y -2 y -1 ) 1 1x 1 1x 1 1 2x 1-2x 1 1-1x 1 1-1x BOOTH EXAMPLE x = 111 (25 1 ), y = 1111 (-18 1 ). y 1 y y -1 = 1, P 1 = P - (1 111) = y 3 y 2 y 1 = 111, P 2 = P 1 = y 5 y 4 y 3 = 11, P 3 = P = (-45 1 ) x 4 x x 19 BOOTH STRUCTURE multplcand Left shft 2 multplcand 2 FIR-FILTER DIRECT FORM (1) FIR = fnte mpulse response Dfference equaton: Where s the crtcal path? How long s t as functon of N? Left shft 2 multplcand
6 21 FIR-FILTER DIRECT FORM (2) Use a bnary tree structure for the addtons: Crtcal path as functon of N? 22 CLASSICAL RETIMING It s allowed to push delay elements through a computaton: From nputs to outputs or From outputs to nputs Compute-and-then-delay s the same as delay-and-thencompute. Allowed n cyclc DFGs. 23 Generalzaton of classcal retmng. Cut-set = set of edges that cuts a graph n two when removed. Gven a cut-set of any DFG, the DFG s behavor remans unchanged f the same number of delays are added (removed) on ncomng edges as are removed (added) on outgong edges. CUT-SET RETIMING cut lne 24 FIR-FILTER DIRECT FORM (3) Reverse order of addtons:
7 25 CUT-SET RETIMED FIR-FILTER 26 FIR-FILTER TRANSPOSED FORM Computatonally equvalent to drect form Can be obtaned by systematcally applyng cut-set retmng. Now, all multplcatons share one nput 27 FIR FILTER HYBRID FORM The drect-form-mplementaton has all ts delays n the nput lne. The transposed-form mplementaton has all delays on the output lne. Hybrd-form mplementaton has part of the delays n the nput lne and part on the output lne. See paper by Aksoy et al. for more detals. 28 IIR = nfnte mpulse response Dfference equaton: IIR FILTER
8 29 IIR-FILTER DIRECT FORM 1 3 IIR-FILTER TRANSPOSED FORM 31 SCALING: BOUNDS ON ADDITIONS (1) Consder multplcaton of x by 71 = Addtons-only soluton: 71x = (x << 6) (x << 2) (x << 1) x (realzed by means of 3 shfts and 3 addtons; shfts by a constant costs only wres n hardware) Subtractons-only soluton: 71x = ((x << 7) x) (x << 5) (x << 4) (x << 3) (realzed by means of 4 shfts and 4 subtractons) 32 SCALING: BOUNDS ON ADDITIONS (2) In general, f b s the number of bts, z the number of zeros and o the number of ones (b = z o): The addtons-only soluton requres o 1 addtons. The subtractons-only soluton requres z 1 subtractons. There s always a soluton wth at most b/2 O(1) addtons or subtractons (just take the cheapest of the two solutons). The average cost s also b/2 O(1). Booth encodng has also the same cost. Can t be done better?
9 33 SIGNED POWER-OF-TWO REPRESENTATION Uses three-valued dgts nstead of bnary dgts: A at poston means a contrbuton of to the fnal value (as usual). A at poston means a contrbuton of to the fnal value. 34 CANONICAL SIGNED-DIGIT (CSD) Specal case of sgned-dgt power-of-two, wth mnmal number of non-zero dgts. Canoncal = unque encodng. When used to mnmze addtons n constant multplcaton, reduces number of operatons to b/3 O(1) n average, but stll b/2 O(1) n worst case. Example: Example: 35 TWO S COMPLEMENT TO CSD CONVERSION (1) Two s complement number: 36 2 S COMPLEMENT TO CSD CONVERSION (2) Target: Start from LSB and proceed to MSB usng table on next slde Dummy value (sgn extenson): Carry-n, ntalzed to. Hewltt & Swarzlander, Table 2
10 37 CSD NOT OPTIMAL CSD has mnmal number of non-zeros, but s stll not optmal for the sngle constant multplcaton problem. How come? 38 SINGLE-CONSTANT MULTIPLICATION Number of operatons can be reduced by allowng shftng and addng ntermedate results Example, goal s to multply by Voronenko & Pueschel, Fgure 2 3x add/sub 2x add/sub 39 MULTIPLE-CONSTANT MULTIPLICATION Even more opportuntes for optmzaton occur when multple constants can be optmzed at the same tme (thnk of the transposed form of a FIR flter). Example: Voronenko & Pueschel, Fgure 5 4 COMPUTATIONAL COMPLEXITY The optmzaton of the mplementaton for both the sngleconstant and multple-constant multplcaton problems s NPcomplete. Powerful heurstcs are avalable. Try SPIRAL on-lne applcaton:
11 41 CONSTANT MATRIX-VECTOR MULT. (1) Applcatons n hybrd mplementatons of FIR flters y 1 = 11*x 1 17*x 2 y 2 = 19*x 1 33*x 2 42 CONSTANT MATRIX-VECTOR MULT. (2) Optmzed wth depth constrant of 3: 7 add/sub Unoptmzed: 8 add/sub Aksoy et al., Fgure 3 Optmzed: 5 add/sub Aksoy et al., Fgure 5 43 CHOOSING THE COEFFICIENTS Untl now, the dscusson was about mplementng flters wth gven constant coeffcents as effcently as possble. Classcal approach starts from floatng-pont coeffcents as e.g. computed n Matlab and a blnd fxed-pont converson. It s even more nterestng to take cheap mplementaton as a crteron durng flter desgn. A problem descrpton could e.g. be: Gven a number T, construct a flter wth at most T non-zero bts n ts set of coeffcents whle at the same tme satsfyng the usual crtera such as bandwdth, pass band rpple, etc. See e.g. tools at:
CSE4210 Architecture and Hardware for DSP
4210 Archtecture and Hardware for DSP Lecture 1 Introducton & Number systems Admnstratve Stuff 4210 Archtecture and Hardware for DSP Text: VLSI Dgtal Sgnal Processng Systems: Desgn and Implementaton. K.
More informationA New Design of Multiplier using Modified Booth Algorithm and Reversible Gate Logic
Internatonal Journal of Computer Applcatons Technology and Research A New Desgn of Multpler usng Modfed Booth Algorthm and Reversble Gate Logc K.Nagarjun Department of ECE Vardhaman College of Engneerng,
More informationModule #6: Combinational Logic Design with VHDL Part 2 (Arithmetic)
ECOM4311 Dgtal Systems Desgn : Combnatonal Logc Desgn wth VHDL Part 2 (Arthmetc) - A crcut that compares dgtal values (.e., Equal, Greater Than, Less Than) Agenda 1. 2. Adders (Rpple Carry, Carry-Look-Ahead)
More informationDepartment of Electrical & Electronic Engineeing Imperial College London. E4.20 Digital IC Design. Median Filter Project Specification
Desgn Project Specfcaton Medan Flter Department of Electrcal & Electronc Engneeng Imperal College London E4.20 Dgtal IC Desgn Medan Flter Project Specfcaton A medan flter s used to remove nose from a sampled
More informationA Novel, Low-Power Array Multiplier Architecture
A Noel, Low-Power Array Multpler Archtecture by Ronak Bajaj, Saransh Chhabra, Sreehar Veeramachanen, MB Srnas n 9th Internatonal Symposum on Communcaton and Informaton Technology 29 (ISCIT 29) Songdo -
More informationContinued..& Multiplier
CS222: Computer Arthmetc : Adder Contnued..& Multpler Dr. A. Sahu Dept of Comp. Sc. & Engg. Indan Insttute of Technology Guwahat 1 Outlne Adder Unversal Use (N bt addton) RppleCarry Adder, Full Adder,
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationA High-Performance and Energy-Efficient FIR Adaptive Filter using Approximate Distributed Arithmetic Circuits
SUBMITTED FOR REVIEW 1 A Hgh-Performance and Energy-Effcent FIR Adaptve Flter usng Approxmate Dstrbuted Arthmetc Crcuts Honglan Jang, Lebo Lu, Peter Jonker, Duncan Ellott, Fabrzo Lombard, Fellow, IEEE
More informationImplementation of Parallel Multiplier Accumulator based on Radix-2 Modified Booth Algorithm Shashi Prabha Singh 1 Uma Sharma 2
IJSRD - Internatonal Journal for Scentfc Research & Development Vol. 3, Issue 05, 2015 ISSN (onlne): 2321-0613 Implementaton of Parallel Multpler Accumulator based on Radx-2 Modfed Booth Algorthm Shash
More informationPower Efficient Design and Implementation of a Novel Constant Correction Truncated Multiplier
APSIPA ASC 11 X an Power Effcent Desgn and Implementaton of a Novel Constant Correcton Truncated Multpler Yu Ren, Dong Wang, Lebo Lu, Shouy Yn and Shaojun We Tsnghua Unversty, Bejng E-mal: reneereny@gmal.com
More informationLecture 4: Adders. Computer Systems Laboratory Stanford University
Lecture 4: Adders Computer Systems Laboratory Stanford Unversty horowtz@stanford.edu Copyrght 2004 by Mark Horowtz (w/ Fgures from Hgh-Performance Mcroprocessor Desgn IEEE And Fgures from Bora Nkolc 1
More informationApplication of Nonbinary LDPC Codes for Communication over Fading Channels Using Higher Order Modulations
Applcaton of Nonbnary LDPC Codes for Communcaton over Fadng Channels Usng Hgher Order Modulatons Rong-Hu Peng and Rong-Rong Chen Department of Electrcal and Computer Engneerng Unversty of Utah Ths work
More informationChapter 6. BCH Codes
Wreless Informaton Transmsson System Lab Chapter 6 BCH Codes Insttute of Communcatons Engneerng Natonal Sun Yat-sen Unversty Outlne Bnary Prmtve BCH Codes Decodng of the BCH Codes Implementaton of Galos
More informationBit Juggling. Representing Information. representations. - Some other bits. - Representing information using bits - Number. Chapter
Representng Informaton 1 1 1 1 Bt Jugglng - Representng nformaton usng bts - Number representatons - Some other bts Chapter 3.1-3.3 REMINDER: Problem Set #1 s now posted and s due next Wednesday L3 Encodng
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationHigh Performance Rotation Architectures Based on the Radix-4 CORDIC Algorithm
IEEE TRANSACTIONS ON COMPUTERS, VOL. 46, NO. 8, AUGUST 997 855 Hgh Performance Rotaton Archtectures Based on the Radx-4 CORDIC Algorthm Elsardo Antelo, Julo Vllalba, Javer D. Bruguera, and Emlo L. Zapata
More informationSuppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl
RECURSIVE SPLINE INTERPOLATION METHOD FOR REAL TIME ENGINE CONTROL APPLICATIONS A. Stotsky Volvo Car Corporaton Engne Desgn and Development Dept. 97542, HA1N, SE- 405 31 Gothenburg Sweden. Emal: astotsky@volvocars.com
More informationNumbers. Principles Of Digital Design. Number Representations
Prncples Of Dgtal Desgn Numbers Number Representatons Decmal, Bnary Number System Complement Number System Fxed Pont and Floatng Pont Numbers Postonal Number System Each number s represented by a strng
More informationADVANCED MACHINE LEARNING ADVANCED MACHINE LEARNING
1 ADVANCED ACHINE LEARNING ADVANCED ACHINE LEARNING Non-lnear regresson technques 2 ADVANCED ACHINE LEARNING Regresson: Prncple N ap N-dm. nput x to a contnuous output y. Learn a functon of the type: N
More informationVariability-Driven Module Selection with Joint Design Time Optimization and Post-Silicon Tuning
Asa and South Pacfc Desgn Automaton Conference 2008 Varablty-Drven Module Selecton wth Jont Desgn Tme Optmzaton and Post-Slcon Tunng Feng Wang, Xaoxa Wu, Yuan Xe The Pennsylvana State Unversty Department
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationUnit 2: Binary Numbering Systems
Unt 2: Bnary Numberng Systems Defntons Number bases Numercal representatons. Integer fxed pont. Bnary 2 s complement BCD Addton-subtracton Alphanumercal representatons Basc Bblography Any book on dgtal
More informationCSC 411 / CSC D11 / CSC C11
18 Boostng s a general strategy for learnng classfers by combnng smpler ones. The dea of boostng s to take a weak classfer that s, any classfer that wll do at least slghtly better than chance and use t
More informationInterconnect Optimization for Deep-Submicron and Giga-Hertz ICs
Interconnect Optmzaton for Deep-Submcron and Gga-Hertz ICs Le He http://cadlab.cs.ucla.edu/~hele UCLA Computer Scence Department Los Angeles, CA 90095 Outlne Background and overvew LR-based STIS optmzaton
More informationSpeeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationAnalysis of Queuing Delay in Multimedia Gateway Call Routing
Analyss of Queung Delay n Multmeda ateway Call Routng Qwe Huang UTtarcom Inc, 33 Wood Ave. outh Iseln, NJ 08830, U..A Errol Lloyd Computer Informaton cences Department, Unv. of Delaware, Newark, DE 976,
More informationA Low Error and High Performance Multiplexer-Based Truncated Multiplier
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 18, NO. 1, DECEMBER 010 1767 A Low Error and Hgh Performance Multplexer-Based Truncated Multpler Chp-Hong Chang and Rav Kumar Satzoda
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationLINEAR TRANSFORMATION OF BINARY DECISION DIAGRAMS TROUGH SPECTRAL DOMAIN
LINEAR TRANSFORMATION OF BINARY DECISION DIAGRAMS TROUGH SPECTRAL DOMAIN Mlena Stankovc, Suzana Stokovc 2 Faculty of Electronc Engneerng, Unversty of Ns, A Medvedeva 4, 8 Ns, SERBIA, mstankovc@elfaknacyu,
More informationMA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials
MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationExercises. 18 Algorithms
18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)
More informationWhich Separator? Spring 1
Whch Separator? 6.034 - Sprng 1 Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng 3 Margn of a pont " # y (w $ + b) proportonal
More informationLogical Effort of Higher Valency Adders
Logcal Effort of gher Valency Adders Davd arrs arvey Mudd College E. Twelfth St. Claremont, CA Davd_arrs@hmc.edu Abstract gher valency parallel prefx adders reduce the number of logc levels at the expense
More informationTornado and Luby Transform Codes. Ashish Khisti Presentation October 22, 2003
Tornado and Luby Transform Codes Ashsh Khst 6.454 Presentaton October 22, 2003 Background: Erasure Channel Elas[956] studed the Erasure Channel β x x β β x 2 m x 2 k? Capacty of Noseless Erasure Channel
More informationBrousentsov s Ternary Principle, Bergman s Number System and Ternary Mirror-symmetrical Arithmetic
Brousentsov s Ternary Prncple, Bergman s Number System and Ternary Mrror-symmetrcal Arthmetc ALEXEY STAKHOV c Brtsh Computer Socety 00 P.O. Box 878, Vnntsa 7, Ukrane 07 Emal: anna@nest.vnnca.ua We consder
More informationLecture 5 Decoding Binary BCH Codes
Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture
More informationAdiabatic Sorption of Ammonia-Water System and Depicting in p-t-x Diagram
Adabatc Sorpton of Ammona-Water System and Depctng n p-t-x Dagram J. POSPISIL, Z. SKALA Faculty of Mechancal Engneerng Brno Unversty of Technology Techncka 2, Brno 61669 CZECH REPUBLIC Abstract: - Absorpton
More informationBit-Parallel Word-Serial Multiplier in GF(2 233 ) and Its VLSI Implementation. Dr. M. Ahmadi
Bt-Parallel Word-Seral Multpler n GF(2 233 ) and Its VLSI Implementaton Supervsors: Student: Dr. Huapeng Wu Dr. M. Ahmad Wenka Tang Contents Introducton to Fnte Feld Research Motvatons Proposed Multplers
More informationLecture 20: November 7
0-725/36-725: Convex Optmzaton Fall 205 Lecturer: Ryan Tbshran Lecture 20: November 7 Scrbes: Varsha Chnnaobreddy, Joon Sk Km, Lngyao Zhang Note: LaTeX template courtesy of UC Berkeley EECS dept. Dsclamer:
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationMultiline Overview. Karl Bois, PhD Lead SI Engineer Servers & Blades. December 5th, 2016
Multlne Overvew Karl Bos, PhD Lead SI Engneer Servers & Blades December 5th, 216 Why are we here? Orgnal Equpment Manufacturers (OEMs) and Orgnal Desgn Manufacturers (ODMs) have desgns that requre that
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationHIGH-SPEED MULTI OPERAND ADDITION UTILIZING FLAG BITS VIBHUTI DAVE DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING
HIGH-SPEED MULTI OPERAND ADDITION UTILIZING FLAG BITS BY VIBHUTI DAVE DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING Submtted n partal fulfllment of the requrements for the degree of Doctor of Phlosophy
More informationResearch Institute of Applied Mechanics and Electrodynamics (RIAME) & Moscow Aviation Institute (MAI) (Russia)
Team 36: Vacheslav Petukhov (RIAME), Roman Elnkov (MAI), Alexey Ivanyuhn (RIAME), Mkhal Konstantnov (MAI), Mn Then (MAI), Ilya Nkolchev (MAI), Den Nguyen Ngoc (MAI) Research Insttute of Appled Mechancs
More informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More informationAn Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
More informationSome Consequences. Example of Extended Euclidean Algorithm. The Fundamental Theorem of Arithmetic, II. Characterizing the GCD and LCM
Example of Extended Eucldean Algorthm Recall that gcd(84, 33) = gcd(33, 18) = gcd(18, 15) = gcd(15, 3) = gcd(3, 0) = 3 We work backwards to wrte 3 as a lnear combnaton of 84 and 33: 3 = 18 15 [Now 3 s
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationCOMBINATIONAL CIRCUITS
OMINTIONL IRUIT pplcatons Half dder ssumpton : Two one-bt bnary varables and 1 1 1 1 1 1 1 The truth table of the Half dder Parallel dder for -bt varables H Implementaton of the Half dder Least gnfcant
More informationCombinational Circuit Design
Combnatonal Crcut Desgn Part I: Desgn Procedure and Examles Part II : Arthmetc Crcuts Part III : Multlexer, Decoder, Encoder, Hammng Code Combnatonal Crcuts n nuts Combnatonal Crcuts m oututs A combnatonal
More informationNice plotting of proteins II
Nce plottng of protens II Fnal remark regardng effcency: It s possble to wrte the Newton representaton n a way that can be computed effcently, usng smlar bracketng that we made for the frst representaton
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationMAE140 - Linear Circuits - Fall 13 Midterm, October 31
Instructons ME140 - Lnear Crcuts - Fall 13 Mdterm, October 31 () Ths exam s open book. You may use whatever wrtten materals you choose, ncludng your class notes and textbook. You may use a hand calculator
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationAmiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business
Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of
More informationParallel MAC Based On Radix-4 & Radix-8 Booth Encodings
Shankey Goel. et al. / Internatonal Journal of Engneerng Scence an Technology (IJEST) Parallel MAC Base On Rax-4 & Rax-8 Booth Encongs SHAKE GOEL Stuent, Department of Electroncs & Communcaton Engneerng
More informationA Fast FPGA based Architecture for Determining the Sine and Cosine Value
Proc. of Int. Conf. on Advances n Communcaton, Network, and Computng, CNC A Fast FPGA based Archtecture for Determnng the Sne and Cosne Value Atanu Dey, Tanma Bhattacharyya, Abul Hasnat and Santanu Halder
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationA Reconfigurable System on Chip Implementation for Elliptic Curve Cryptography over GF(2 n )
Reconfgurable System on Chp Implementaton for Ellptc Curve Cryptography over GF( n ) Mchael Jung, M. Ernst, F. Madlener, S. Huss, R. lümel Integrated Crcuts and Systems Lab Computer Scence Department Darmstadt
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationContents 1 Basics of Convolutional Coding.
Contents 1 Bascs of Convolutonal Codng 1 Φ 11 Relatng G 1 wth the mpulse responses g j 1 ;j 12 TransformAnalyssn ConvolutonalCodes context 4 13 Constructng a convolutonal encoder structure from the generator
More informationMaximal Margin Classifier
CS81B/Stat41B: Advanced Topcs n Learnng & Decson Makng Mamal Margn Classfer Lecturer: Mchael Jordan Scrbes: Jana van Greunen Corrected verson - /1/004 1 References/Recommended Readng 1.1 Webstes www.kernel-machnes.org
More informationOutline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique
Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng
More informationAnalytical Gradient Evaluation of Cost Functions in. General Field Solvers: A Novel Approach for. Optimization of Microwave Structures
IMS 2 Workshop Analytcal Gradent Evaluaton of Cost Functons n General Feld Solvers: A Novel Approach for Optmzaton of Mcrowave Structures P. Harscher, S. Amar* and R. Vahldeck and J. Bornemann* Swss Federal
More informationBoise State University Department of Electrical and Computer Engineering ECE 212L Circuit Analysis and Design Lab
Bose State Unersty Department of Electrcal and omputer Engneerng EE 1L rcut Analyss and Desgn Lab Experment #8: The Integratng and Dfferentatng Op-Amp rcuts 1 Objectes The objectes of ths laboratory experment
More informationThe Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method
Journal of Electromagnetc Analyss and Applcatons, 04, 6, 0-08 Publshed Onlne September 04 n ScRes. http://www.scrp.org/journal/jemaa http://dx.do.org/0.46/jemaa.04.6000 The Exact Formulaton of the Inverse
More informationOn balancing multiple video streams with distributed QoS control in mobile communications
On balancng multple vdeo streams wth dstrbuted QoS control n moble communcatons Arjen van der Schaaf, José Angel Lso Arellano, and R. (Inald) L. Lagendjk TU Delft, Mekelweg 4, 68 CD Delft, The Netherlands
More information10.34 Numerical Methods Applied to Chemical Engineering Fall Homework #3: Systems of Nonlinear Equations and Optimization
10.34 Numercal Methods Appled to Chemcal Engneerng Fall 2015 Homework #3: Systems of Nonlnear Equatons and Optmzaton Problem 1 (30 ponts). A (homogeneous) azeotrope s a composton of a multcomponent mxture
More informationClock-Gating and Its Application to Low Power Design of Sequential Circuits
Clock-Gatng and Its Applcaton to Low Power Desgn of Sequental Crcuts ng WU Department of Electrcal Engneerng-Systems, Unversty of Southern Calforna Los Angeles, CA 989, USA, Phone: (23)74-448 Massoud PEDRAM
More informationLearning Theory: Lecture Notes
Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be
More informationBoise State University Department of Electrical and Computer Engineering ECE 212L Circuit Analysis and Design Lab
Bose State Unersty Department of Electrcal and omputer Engneerng EE 1L rcut Analyss and Desgn Lab Experment #8: The Integratng and Dfferentatng Op-Amp rcuts 1 Objectes The objectes of ths laboratory experment
More informationQuantum-Evolutionary Algorithms: A SW-HW approach
Proceedngs of the 5th WSEAS Int. Conf. on COMPUTATIONAL INTELLIGENCE, MAN-MACHINE SYSTEMS AND CYBERNETICS, Vence, Italy, November 0-, 006 333 Quantum-Evolutonary Algorthms: A SW-HW approach D. PORTO, A.
More informationCMAC: RECONSIDERING AN OLD NEURAL NETWORK. Gábor Horváth
CMAC: RECONSIDERING AN OLD NEURAL NEWORK Gábor Horváth Budapest Unversty of echnology and Economcs, Department of Measurement and Informaton Systems Magyar tudósok krt.. Budapest, Hungary H-7. Abstract:
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationNON-LINEAR CONVOLUTION: A NEW APPROACH FOR THE AURALIZATION OF DISTORTING SYSTEMS
NON-LINEAR CONVOLUTION: A NEW APPROAC FOR TE AURALIZATION OF DISTORTING SYSTEMS Angelo Farna, Alberto Belln and Enrco Armellon Industral Engneerng Dept., Unversty of Parma, Va delle Scenze 8/A Parma, 00
More informationImplementation and Study of Reversible Binary Comparators
Implementaton and Study of Reversble Bnary Comparators Harth M, C Vasanthanayak Abstract Reversble logc contans a feature of recoverng bt loss from unque nput-output mappng. Usng tradtonal (rreversble)
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationCOMPUTATIONALLY EFFICIENT WAVELET AFFINE INVARIANT FUNCTIONS FOR SHAPE RECOGNITION. Erdem Bala, Dept. of Electrical and Computer Engineering,
COMPUTATIONALLY EFFICIENT WAVELET AFFINE INVARIANT FUNCTIONS FOR SHAPE RECOGNITION Erdem Bala, Dept. of Electrcal and Computer Engneerng, Unversty of Delaware, 40 Evans Hall, Newar, DE, 976 A. Ens Cetn,
More informationA FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS
Shervn Haamn A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS INTRODUCTION Increasng computatons n applcatons has led to faster processng. o Use more cores n a chp
More informationIRO0140 Advanced space time-frequency signal processing
IRO4 Advanced space tme-frequency sgnal processng Lecture Toomas Ruuben Takng nto account propertes of the sgnals, we can group these as followng: Regular and random sgnals (are all sgnal parameters determned
More information5012: VLSI Signal Processing
5: VLSI Sgnal Processng Lecture 6 Fast Algortms for Dgtal Sgnal Processng VSP Lecture6 - Fast Algortms for DSP (cwlu@twns.ee.nctu.edu.tw) - Algortm Strengt Reducton Motvaton Te number of strong operatons,
More informationCHAPTER IV RESEARCH FINDING AND ANALYSIS
CHAPTER IV REEARCH FINDING AND ANALYI A. Descrpton of Research Fndngs To fnd out the dfference between the students who were taught by usng Mme Game and the students who were not taught by usng Mme Game
More information