On the circuit complexity of the standard and the Karatsuba methods of multiplying integers
|
|
- Thomas Lang
- 6 years ago
- Views:
Transcription
1 On the circit complexity of the standard and the Karatsba methods of mltiplying integers arxiv: v1 [cs.ds] 7 Feb 2016 Igor S. Sergeev The goal of the present paper is to obtain accrate estimates for the complexity of two practical mltiplication methods: standard (school) and Karatsba [1]. Here, complexity is the minimal possible nmber of gates in a logic circit implementing the reqired fnction over the basis {AND, OR, XOR, NAND, NOR, XNOR}. One can find pper estimates for the said methods e.g. in [2]. The standard method has complexity M(n) 6n 2 8n. In the case n = 2 k, the complexity K(n) of the Karatsba method can be dedced from the recrsion K(2n) 3K(n)+49n 8 as K(2 k ) k 49 2 k +4. We intend to show that the above estimates may be improved with the help of the reslt [3] stating that a sm of n bits may be compted via 4.5n operations instead of 5n as in the naive approach. The reslting bonds are M(n) 5.5n 2 6.5n 1+(n mod 2) and K(2 k ) k 38 2 k 81 5 Φ k Φ k+1 +20, (1) where {Φ k } is the Fibonacci seqence: Φ 1 = Φ 2 = 1, Φ k+2 = Φ k+1 +Φ k. Axiliary circits. The circits below are bilt from the following sbcircits: half-adders HA, HA ±, (3,2)-carry save adders (CSA) FA 3, FA 3, FA 0 3, SFA 3, SFA 3, (5,3)-CSA MDFA, MDFA (the MDFA circit was proposed in [3]). Specifically, they implement the fnctions: HA: (x 1, x 2 ) (; v), where x 1 +x 2 = 2+v; HA ± : (x 1, x 2 ) (; v), where x 1 x 2 = 2+v; FA 3 : (x 1, x 2, x 3 ) (; v), where x 1 +x 2 +x 3 = 2+v; FA 3: (x 1, x 2, x 3 ) (; v), where x 1 +x 2 x 3 = 2 v; FA 0 3 : (x 1, x 2, x 3 ) (; v), wherex 1 +x 2 x 3 = 2+v, ifx 1 +x 2 x 3 0; Translated from the Rssian original pblished in: Proc. of XXII Conf. Information means and technology (Moscow, November 18 20, 2014). Vol. 3. Moscow, MPEI, 2014, isserg@gmail.com 1
2 SFA 3 : (x 1, x 1 x 2, x 3 ) (; v), where x 1 +x 2 +x 3 = 2+v; SFA 3 : (x 1, x 1 x 2, x 3 ) (; v), where x 1 x 2 +x 3 = 2 v; MDFA: (x 1, x 1 y 1, x 2, x 2 y 2, z) ( 1, 1 2 ; v), where x 1 +y 1 + x 2 +y 2 +z = 2( )+v; MDFA : (x 1, x 1 y 1, x 2, x 2 y 2, z) ( 1, 1 2 ; v), where x 1 y 1 + x 2 y 2 +z = 2( 1 2 )+v. These circits are shown on Fig. 1. Gates AND,OR,XOR are denoted by symbols,,, respectively. Inverted inpts are marked by small circles. v HA x 2 x 3 x 1 x 1 z x 1 y 1 FA 3 x 2 x 2 y 2 MDFA 1 v v HA ± x 3 x 1 z x 1 y 1 FA 3 x 2 x 2 y 2 MDFA 1 v 1 2 x 1 x 3 x 1 x 2 SFA 3 v FA x 3 v Figre 1: Axiliary circits x 1 x 3 x 1 x 2 SFA 3 v Standard method. The first stage of the standard method of mltiplication of n-bit integers involves n 2 bit mltiplications. The next stage mltiple addition may be performed via smmation of bits in consective colmns (colmn is a set of bits of the same order). The smmation tilizes the aforementioned axiliary sbcircits. The reslt of a colmn smmation 2
3 is a bit of the prodct and a set of carries to the next order. Let s index colmns from 1 in increasing order. Then, after the first phase one has n n k bits in a k-th colmn, k = 1,...,2n 1. Consider the following rle of colmn smmation: if there exist 5 smmand bits, se MDFA; else, if there exist 3 smmand bits, se FA 3 ; else, if there exist 2 smmand bits, se HA. Denote by h(k) nmber of smmand bits in the k-th colmn after completion of smmation in all lower-order colmns. Clearly, h(1) = 1. Let s check by indction that h(k) = 2k 2 for 2 k n. Obviosly, the statement holds for k = 2. Assme, it also holds for k = t and consider smmation in the t-th colmn. By the declared strategy, smmation of 2t 2 bits involves t/2 1 circits MDFA, one circit HA, and in the case of odd t, one more circit FA 3. In total, it prodces t 1 carries to the next order. Hence, h(t+1) = t+1+t 1 = 2(t+1) 2, as reqired. By analogy, we conclde that h(n+1) = 2n 2 and h(2n k) = 2k+1 for 0 k n 2. For smmation in the (n+1)-th colmn one se the same set of circits as for the n-th colmn. For smmation in (2n k)-th colmn we se k/2 circits MDFA, and in the case of odd k 1 an additional circit FA 3. For k = 1 we need a circit SFA 3 instead of FA 3, since smmation in the previos colmn involves MDF A. The se of MDFA reqires a conversion to the special bit encoding (x,y) (x,x y). All MDFA otpts encoded this way may be connected to MDFA inpts of the same encoding, with the exception of the last MDFA, in the (2n 2)-th colmn. Therefore, to execte all smmations we need additionally q+1 XOR gates, where q is a nmber of MDFA. Therefore, if n 4, then the second stage of mltiplication tilizes n circits HA, n 3+2(n mod 2) circits FA 3, one circit SFA 3, q = (n 2 3n)/2+1 (n mod 2) circits MDFA and q +1 XOR gates (the nmber of MDFA is easy to derive from the nmber of (3,2)-CSA, since MDFA redces the total nmber of smmand bits by 2, FA 3 or SFA 3 redces it by 1; the nmber of smmand bits before smmation stage is n 2, and at the end it is 2n). Smming p the complexities of sbcircits we can bond the complexity M(n) of the mltiplication circit as M(n) 5,5n 2 6,5n 1+(n mod 2). The estimate holds also for 2 n 3. Karatsba method. Represent two m-bit mltiplication operands as A 1 2 n +B 1 and A 2 2 n +B 2, where n = m/2, 0 B i < 2 n, 0 A i < 2 m n. Then, the prodct may be compted by the formla: A 1 A 2 2 2n +((A 1 +B 1 )(A 2 +B 2 ) A 1 A 2 B 1 B 2 )2 n +B 1 B 2. 3
4 The implied circit consists of two addition circits compting A 1 +B 1 and A 2 + B 2, three mltiplication sbcircits for (n + 1)-bit, (m n)-bit and n-bit operands, and a sbcircit for the final addition-sbtraction. The strctre of this final addition is shown on the pattern below (see Fig. 2). Symbols + and denote smmand and sbtrahend bits, respectively. Colmns are indexed so that an index i corresponds to a bit with weight 2 i. Pairs of bits in brackets are missing when m is odd. (++) A 1 A 2 2 2n (A 1 +B 1 )(A 2 +B 2 )2 n ( ) A 1 A 2 2 n B 1 B 2 2 n B 1 B 2 4n 1 3n 1 2n 1 n 0 Fig. 2. Pattern of the final addition-sbtraction in the Karatsba method Consider the following colmn smmation rle for the final addition: if there exist 3 smmand bits and 2 sbtrahend bits, se MDFA ; else, if there exist 3 bits, se a sitable circit from the FA 3 family; else, if there exist 2 bits, se an appropriate circit from the HA family. Denote by h + (k), h (k) nmbers of smmand and sbtrahend bits in the k-th colmn after completion of smmation in all lower-order colmns. One can easily verify that h + (n) = h (n) = 2, h + (n+1) = h (n+1) = 3 and h + (k) = 3, h (k) = 4 for n+2 k 2m n 1. We se one FA 3 and one HAinthen-thcolmn, onemdfa andoneha ± inthe(n+1)-thcolmn, one MDFA and one FA 3 in any sbseqent colmn p to (2m n 1)-th. When m is odd, we have h + (k) = h (k) = 3 for k = 3n 1, 3n 2. Therefore, one MDFA and one HA ± shold be sed in the corresponding colmns. Frther, h + (3n) = 3, h (3n) = 2(seMDFA ), h + (3n+1) = 3, h (3n+ 1) = 1 (se SFA 3 and HA± ), h + (3n + 2) = 2, h (3n+2) = 1 (se FA 0 3, since the vale (A 1 +B 1 )(A 2 +B 2 ) A 1 A 2 B 1 B 2 is non-negative). At last, h + (k) = 2, h (k) = 0 for 3n+3 k 2m 1: se HA elsewhere, bt se XOR in the most significant colmn, since no carry is reqired there. As in the standard method, conversion to the special pair-of-bits encoding reqires q + 1 additional XOR gates, where q is the nmber of MDFA sbcircits. Now, we re going to estimate the complexity K(m) of the mltiplication circit. It s a common knowledge, that the complexity of the addition of two n-bit nmbers is 5n 3, the addition of an n-bit nmber and an (n 1)- bit nmber has complexity 5n 6 (see e.g. [2]). If m 10, then the final 4
5 Karatsba adder-sbtractor contains n 1 circits HA or HA ±, 2m 2n 1 circits FA 3, one circit SFA 3, one circit FA0 3, 2n circits MDFA and 2n+2 XOR gates. Note, that one can save some gates. Colmns indexed by n+i and 2n+i, for i = 0,...,n 1, contain identical pairs of bits (from smmands B 1 B 2, A 1 A 2 2 n and B 1 B 2 2 n, A 1 A 2 2 2n, respectively). Arrange the comptation process to pass these bits to the inpts of FA 3 in colmns indexed by n and n+2,...,2m n 1, and to the inpts of MDFA encoded by (x, x y) in other colmns (that is, in (n + 1)-th colmn, and in the case of odd m, also in (3n 2)-th and (3n 1)-th colmns). Ths, for i = 0 and 2 i n 1 2(m mod 2) we can save two gates XOR and ANDNOT via exploiting a CSA from Fig. 3a in a lower-order colmnandacsafromfig. 3binahigher-ordercolmn(CSA saredifferent since the signs of bits in low-order and high-order colmns are rearranged). For i = 1 and n 2(m mod 2) i n 1, one XOR gate is to be saved. x 1 x 3 x 2 Fig. 3a x 3 x 1 x 2 Fig. 3b So, the following recrrent formlae hold: K(2n 1) K(n+1)+K(n)+K(n 1)+38n 16, n 6, K(2n) K(n+1)+2K(n)+38n 2, n 5. (2) A halving iteration of the Karatsba method provides an advantage when m = 16 or m 18. Bonds on the complexity L(m) of mltiplication of m- bit nmbers for m 18 are collected in the Table 1 (symbol indicates vales obtained via Karatsba method). For the convenience of comparison, let s derive the complexity of the Karatsba mltiplication circit in an explicit form for m = 2 k. Denote K(2 k +2) X k = K(2 +1), A = 1 1 1, 38 2 k +36 b k = K(2 k ) k 2 5
6 Table 1: Bonds for the complexity of mltiplication of m-bit nmbers m L(m) m L(m) Recrrences (2) imply X k+1 AX k +b k for k 4. Via common calclations, we obtain (1) as the soltion of the latter ineqality (initial vales of the complexity shold be taken from the Table 1). Research spported in part by RFBR, grant a. References [1] A.A. Karatsba, Y.P. Ofman. Mltiplication of mltidigit nmbers on atomata. DAN USSR 145(2)(1962), (in Rssian). Eng. transl. in Soviet Phys. Dokl. 7 (1963), [2] S.B. Gashkov. Entertaining compter arithmetic. Fast algorithms for operations with nmbers and polynomials. Moscow, Librocom, 2012 (in Rssian). [3] E. Demenkov, A. Kojevnikov, A. Klikov, G. Yaroslavtsev. New pper bonds on the Boolean circit complexity of symmetric fnctions. Inf. Proc. Letters 110(7) (2010),
Introdction Finite elds play an increasingly important role in modern digital commnication systems. Typical areas of applications are cryptographic sc
A New Architectre for a Parallel Finite Field Mltiplier with Low Complexity Based on Composite Fields Christof Paar y IEEE Transactions on Compters, Jly 996, vol 45, no 7, pp 856-86 Abstract In this paper
More informationOn relative errors of floating-point operations: optimal bounds and applications
On relative errors of floating-point operations: optimal bonds and applications Clade-Pierre Jeannerod, Siegfried M. Rmp To cite this version: Clade-Pierre Jeannerod, Siegfried M. Rmp. On relative errors
More informationChapter 4 Supervised learning:
Chapter 4 Spervised learning: Mltilayer Networks II Madaline Other Feedforward Networks Mltiple adalines of a sort as hidden nodes Weight change follows minimm distrbance principle Adaptive mlti-layer
More informationOn relative errors of floating-point operations: optimal bounds and applications
On relative errors of floating-point operations: optimal bonds and applications Clade-Pierre Jeannerod, Siegfried M. Rmp To cite this version: Clade-Pierre Jeannerod, Siegfried M. Rmp. On relative errors
More informationReview. Combined Datapath
Review Topics:. A single cycle implementation 2. State Diagrams. A mltiple cycle implementation COSC 22: Compter Organization Instrctor: Dr. Amir Asif Department of Compter Science York University Handot
More informationConcepts Introduced. Digital Electronics. Logic Blocks. Truth Tables
Concepts Introdced Digital Electronics trth tables, logic eqations, and gates combinational logic seqential logic Digital electronics operate at either high or low voltage. Compters se a binary representation
More informationAPPENDIX B MATRIX NOTATION. The Definition of Matrix Notation is the Definition of Matrix Multiplication B.1 INTRODUCTION
APPENDIX B MAIX NOAION he Deinition o Matrix Notation is the Deinition o Matrix Mltiplication B. INODUCION { XE "Matrix Mltiplication" }{ XE "Matrix Notation" }he se o matrix notations is not necessary
More informationSTEP Support Programme. STEP III Hyperbolic Functions: Solutions
STEP Spport Programme STEP III Hyperbolic Fnctions: Soltions Start by sing the sbstittion t cosh x. This gives: sinh x cosh a cosh x cosh a sinh x t sinh x dt t dt t + ln t ln t + ln cosh a ln ln cosh
More information1. State-Space Linear Systems 2. Block Diagrams 3. Exercises
LECTURE 1 State-Space Linear Sstems This lectre introdces state-space linear sstems, which are the main focs of this book. Contents 1. State-Space Linear Sstems 2. Block Diagrams 3. Exercises 1.1 State-Space
More informationOPTIMUM EXPRESSION FOR COMPUTATION OF THE GRAVITY FIELD OF A POLYHEDRAL BODY WITH LINEARLY INCREASING DENSITY 1
OPTIMUM EXPRESSION FOR COMPUTATION OF THE GRAVITY FIEL OF A POLYHERAL BOY WITH LINEARLY INCREASING ENSITY 1 V. POHÁNKA2 Abstract The formla for the comptation of the gravity field of a polyhedral body
More informationLinear System Theory (Fall 2011): Homework 1. Solutions
Linear System Theory (Fall 20): Homework Soltions De Sep. 29, 20 Exercise (C.T. Chen: Ex.3-8). Consider a linear system with inpt and otpt y. Three experiments are performed on this system sing the inpts
More informationFEA Solution Procedure
EA Soltion Procedre (demonstrated with a -D bar element problem) EA Procedre for Static Analysis. Prepare the E model a. discretize (mesh) the strctre b. prescribe loads c. prescribe spports. Perform calclations
More informationSection 7.4: Integration of Rational Functions by Partial Fractions
Section 7.4: Integration of Rational Fnctions by Partial Fractions This is abot as complicated as it gets. The Method of Partial Fractions Ecept for a few very special cases, crrently we have no way to
More informationStep-Size Bounds Analysis of the Generalized Multidelay Adaptive Filter
WCE 007 Jly - 4 007 London UK Step-Size onds Analysis of the Generalized Mltidelay Adaptive Filter Jnghsi Lee and Hs Chang Hang Abstract In this paper we analyze the bonds of the fixed common step-size
More informationSign-reductions, p-adic valuations, binomial coefficients modulo p k and triangular symmetries
Sign-redctions, p-adic valations, binomial coefficients modlo p k and trianglar symmetries Mihai Prnesc Abstract According to a classical reslt of E. Kmmer, the p-adic valation v p applied to a binomial
More informationAssignment Fall 2014
Assignment 5.086 Fall 04 De: Wednesday, 0 December at 5 PM. Upload yor soltion to corse website as a zip file YOURNAME_ASSIGNMENT_5 which incldes the script for each qestion as well as all Matlab fnctions
More informationChapter 3 MATHEMATICAL MODELING OF DYNAMIC SYSTEMS
Chapter 3 MATHEMATICAL MODELING OF DYNAMIC SYSTEMS 3. System Modeling Mathematical Modeling In designing control systems we mst be able to model engineered system dynamics. The model of a dynamic system
More informationINPUT-OUTPUT APPROACH NUMERICAL EXAMPLES
INPUT-OUTPUT APPROACH NUMERICAL EXAMPLES EXERCISE s consider the linear dnamical sstem of order 2 with transfer fnction with Determine the gain 2 (H) of the inpt-otpt operator H associated with this sstem.
More informationUNCERTAINTY FOCUSED STRENGTH ANALYSIS MODEL
8th International DAAAM Baltic Conference "INDUSTRIAL ENGINEERING - 19-1 April 01, Tallinn, Estonia UNCERTAINTY FOCUSED STRENGTH ANALYSIS MODEL Põdra, P. & Laaneots, R. Abstract: Strength analysis is a
More informationDigital Image Processing. Lecture 8 (Enhancement in the Frequency domain) Bu-Ali Sina University Computer Engineering Dep.
Digital Image Processing Lectre 8 Enhancement in the Freqenc domain B-Ali Sina Uniersit Compter Engineering Dep. Fall 009 Image Enhancement In The Freqenc Domain Otline Jean Baptiste Joseph Forier The
More informationProblem Class 4. More State Machines (Problem Sheet 3 con t)
Problem Class 4 More State Machines (Problem Sheet 3 con t) Peter Cheng Department of Electrical & Electronic Engineering Imperial College London URL: www.ee.imperial.ac.k/pcheng/ee2_digital/ E-mail: p.cheng@imperial.ac.k
More informationAdvanced topics in Finite Element Method 3D truss structures. Jerzy Podgórski
Advanced topics in Finite Element Method 3D trss strctres Jerzy Podgórski Introdction Althogh 3D trss strctres have been arond for a long time, they have been sed very rarely ntil now. They are difficlt
More informationFOUNTAIN codes [3], [4] provide an efficient solution
Inactivation Decoding of LT and Raptor Codes: Analysis and Code Design Francisco Lázaro, Stdent Member, IEEE, Gianligi Liva, Senior Member, IEEE, Gerhard Bach, Fellow, IEEE arxiv:176.5814v1 [cs.it 19 Jn
More informationClassify by number of ports and examine the possible structures that result. Using only one-port elements, no more than two elements can be assembled.
Jnction elements in network models. Classify by nmber of ports and examine the possible strctres that reslt. Using only one-port elements, no more than two elements can be assembled. Combining two two-ports
More informationLecture Notes On THEORY OF COMPUTATION MODULE - 2 UNIT - 2
BIJU PATNAIK UNIVERSITY OF TECHNOLOGY, ODISHA Lectre Notes On THEORY OF COMPUTATION MODULE - 2 UNIT - 2 Prepared by, Dr. Sbhend Kmar Rath, BPUT, Odisha. Tring Machine- Miscellany UNIT 2 TURING MACHINE
More informationImage and Multidimensional Signal Processing
Image and Mltidimensional Signal Processing Professor William Hoff Dept of Electrical Engineering &Compter Science http://inside.mines.ed/~whoff/ Forier Transform Part : D discrete transforms 2 Overview
More informationLecture Notes: Finite Element Analysis, J.E. Akin, Rice University
9. TRUSS ANALYSIS... 1 9.1 PLANAR TRUSS... 1 9. SPACE TRUSS... 11 9.3 SUMMARY... 1 9.4 EXERCISES... 15 9. Trss analysis 9.1 Planar trss: The differential eqation for the eqilibrim of an elastic bar (above)
More information1. Tractable and Intractable Computational Problems So far in the course we have seen many problems that have polynomial-time solutions; that is, on
. Tractable and Intractable Comptational Problems So far in the corse we have seen many problems that have polynomial-time soltions; that is, on a problem instance of size n, the rnning time T (n) = O(n
More informationFast Path-Based Neural Branch Prediction
Fast Path-Based Neral Branch Prediction Daniel A. Jiménez http://camino.rtgers.ed Department of Compter Science Rtgers, The State University of New Jersey Overview The context: microarchitectre Branch
More informationConstructive Root Bound for k-ary Rational Input Numbers
Constrctive Root Bond for k-ary Rational Inpt Nmbers Sylvain Pion, Chee Yap To cite this version: Sylvain Pion, Chee Yap. Constrctive Root Bond for k-ary Rational Inpt Nmbers. 19th Annal ACM Symposim on
More informationWorst-case analysis of the LPT algorithm for single processor scheduling with time restrictions
OR Spectrm 06 38:53 540 DOI 0.007/s009-06-043-5 REGULAR ARTICLE Worst-case analysis of the LPT algorithm for single processor schedling with time restrictions Oliver ran Fan Chng Ron Graham Received: Janary
More informationApproximate Solution for the System of Non-linear Volterra Integral Equations of the Second Kind by using Block-by-block Method
Astralian Jornal of Basic and Applied Sciences, (1): 114-14, 008 ISSN 1991-8178 Approximate Soltion for the System of Non-linear Volterra Integral Eqations of the Second Kind by sing Block-by-block Method
More informationAdditional Gates COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals
Additional Gates COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals Presentation Outline Additional Gates and Symbols Universality of NAND and NOR gates NAND-NAND
More informationThe Lehmer matrix and its recursive analogue
The Lehmer matrix and its recrsive analoge Emrah Kilic, Pantelimon Stănică TOBB Economics and Technology University, Mathematics Department 0660 Sogtoz, Ankara, Trkey; ekilic@etedtr Naval Postgradate School,
More informationMEAN VALUE ESTIMATES OF z Ω(n) WHEN z 2.
MEAN VALUE ESTIMATES OF z Ωn WHEN z 2 KIM, SUNGJIN 1 Introdction Let n i m pei i be the prime factorization of n We denote Ωn by i m e i Then, for any fixed complex nmber z, we obtain a completely mltiplicative
More informationCubic graphs have bounded slope parameter
Cbic graphs have bonded slope parameter B. Keszegh, J. Pach, D. Pálvölgyi, and G. Tóth Agst 25, 2009 Abstract We show that every finite connected graph G with maximm degree three and with at least one
More informationNonlinear parametric optimization using cylindrical algebraic decomposition
Proceedings of the 44th IEEE Conference on Decision and Control, and the Eropean Control Conference 2005 Seville, Spain, December 12-15, 2005 TC08.5 Nonlinear parametric optimization sing cylindrical algebraic
More informationControl Systems
6.5 Control Systems Last Time: Introdction Motivation Corse Overview Project Math. Descriptions of Systems ~ Review Classification of Systems Linear Systems LTI Systems The notion of state and state variables
More informationRestricted Three-Body Problem in Different Coordinate Systems
Applied Mathematics 3 949-953 http://dx.doi.org/.436/am..394 Pblished Online September (http://www.scirp.org/jornal/am) Restricted Three-Body Problem in Different Coordinate Systems II-In Sidereal Spherical
More informationarxiv: v1 [hep-ph] 25 Mar 2014
Moleclar state Σ b Σ b in the copled-channel formalism S.M. Gerasyta and E.E. Matskevich Department of Physics, St. Petersbrg State Forest Technical University, Instittski Per. 5, St. Petersbrg 940, Rssia
More informationDigital Logic (2) Boolean Algebra
Digital Logic (2) Boolean Algebra Boolean algebra is the mathematics of digital systems. It was developed in 1850 s by George Boole. We will use Boolean algebra to minimize logic expressions. Karnaugh
More informationTechnical Note. ODiSI-B Sensor Strain Gage Factor Uncertainty
Technical Note EN-FY160 Revision November 30, 016 ODiSI-B Sensor Strain Gage Factor Uncertainty Abstract Lna has pdated or strain sensor calibration tool to spport NIST-traceable measrements, to compte
More informationStudy on the Mathematic Model of Product Modular System Orienting the Modular Design
Natre and Science, 2(, 2004, Zhong, et al, Stdy on the Mathematic Model Stdy on the Mathematic Model of Prodct Modlar Orienting the Modlar Design Shisheng Zhong 1, Jiang Li 1, Jin Li 2, Lin Lin 1 (1. College
More informationDifferentiation of Exponential Functions
Differentiation of Eponential Fnctions The net derivative rles that o will learn involve eponential fnctions. An eponential fnction is a fnction in the form of a constant raised to a variable power. The
More informationSimplified Identification Scheme for Structures on a Flexible Base
Simplified Identification Scheme for Strctres on a Flexible Base L.M. Star California State University, Long Beach G. Mylonais University of Patras, Greece J.P. Stewart University of California, Los Angeles
More informationUndecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words
Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words Trlogh Neary Institte of Neroinformatics, University of Zürich and ETH Zürich, Switzerland tneary@ini.phys.ethz.ch
More informationOptimal Control of a Heterogeneous Two Server System with Consideration for Power and Performance
Optimal Control of a Heterogeneos Two Server System with Consideration for Power and Performance by Jiazheng Li A thesis presented to the University of Waterloo in flfilment of the thesis reqirement for
More informationState Space Models Basic Concepts
Chapter 2 State Space Models Basic Concepts Related reading in Bay: Chapter Section Sbsection 1 (Models of Linear Systems) 1.1 1.1.1 1.1.2 1.1.3 1.1.5 1.2 1.2.1 1.2.2 1.3 In this Chapter we provide some
More informationPrediction of Transmission Distortion for Wireless Video Communication: Analysis
Prediction of Transmission Distortion for Wireless Video Commnication: Analysis Zhifeng Chen and Dapeng W Department of Electrical and Compter Engineering, University of Florida, Gainesville, Florida 326
More informationCombinational Logic. By : Ali Mustafa
Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output
More informationAn upper bound for the size of the largest antichain. in the poset of partitions of an integer. University of Georgia.
An pper bond for the size of the largest antichain in the poset of partitions of an integer E. Rodney Caneld Department of Compter Science University of Georgia Athens, GA 3060, USA erc@cs.ga.ed Konrad
More informationEfficient Transform Domain Transcoding: Intra Frame of H.264/AVC to JPEG
6 IEEE ransactions on Consmer Electronics, Vol. 57, No., Agst Efficient ransform Domain ranscoding: Intra Frame of H.6/AVC to JPEG Myonghoon Kim, Hoonae Lee, and Sanghoon Sll Abstract In this paper, we
More informationSareban: Evaluation of Three Common Algorithms for Structure Active Control
Engineering, Technology & Applied Science Research Vol. 7, No. 3, 2017, 1638-1646 1638 Evalation of Three Common Algorithms for Strctre Active Control Mohammad Sareban Department of Civil Engineering Shahrood
More informationFaster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections
Faster Inversion and Other Black Box Matrix Comptations Using Efficient Block Projections Wayne Eberly 1, Mark Giesbrecht, Pascal Giorgi,, Arne Storjohann, Gilles Villard (1) Department of Compter Science,
More informationXI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.
2017-18 XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL HALF ADDER 1. The circuit that performs addition within the Arithmetic and Logic Unit of the CPU are called adders. 2. A unit that adds two
More informationDesigning MIPS Processor
CSE 675.: Introdction to Compter Architectre Designing IPS Processor (lti-cycle) Presentation H Reading Assignment: 5.5,5.6 lti-cycle Design Principles Break p eection of each instrction into steps. The
More informationTopics: A multiple cycle implementation. Distributed Notes
COSC 22: Compter Organization Instrctor: Dr. Amir Asif Department of Compter Science York University Handot # lticycle Implementation of a IPS Processor Topics: A mltiple cycle implementation Distribted
More informationElements of Coordinate System Transformations
B Elements of Coordinate System Transformations Coordinate system transformation is a powerfl tool for solving many geometrical and kinematic problems that pertain to the design of gear ctting tools and
More informationReflections on a mismatched transmission line Reflections.doc (4/1/00) Introduction The transmission line equations are given by
Reflections on a mismatched transmission line Reflections.doc (4/1/00) Introdction The transmission line eqations are given by, I z, t V z t l z t I z, t V z, t c z t (1) (2) Where, c is the per-nit-length
More informationOn the tree cover number of a graph
On the tree cover nmber of a graph Chassidy Bozeman Minerva Catral Brendan Cook Oscar E. González Carolyn Reinhart Abstract Given a graph G, the tree cover nmber of the graph, denoted T (G), is the minimm
More informationDifference Constraints: An adequate Abstraction for Complexity Analysis of Imperative Programs
Difference Constraints: An adeqate Abstraction for Complexity Analysis of Imperative Programs Moritz Sinn, Florian Zleger, Helmt Veith TU Wien, Astria Abstract Difference constraints have been sed for
More informationXOR - XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.
XOR - XNOR Gates Lesson Objectives: In addition to AND, OR, NOT, NAND and NOR gates, exclusive-or (XOR) and exclusive-nor (XNOR) gates are also used in the design of digital circuits. These have special
More informationCHANNEL SELECTION WITH RAYLEIGH FADING: A MULTI-ARMED BANDIT FRAMEWORK. Wassim Jouini and Christophe Moy
CHANNEL SELECTION WITH RAYLEIGH FADING: A MULTI-ARMED BANDIT FRAMEWORK Wassim Joini and Christophe Moy SUPELEC, IETR, SCEE, Avene de la Bolaie, CS 47601, 5576 Cesson Sévigné, France. INSERM U96 - IFR140-
More informationIntroduction to Quantum Information Processing
Introdction to Qantm Information Processing Lectre 5 Richard Cleve Overview of Lectre 5 Review of some introdctory material: qantm states, operations, and simple qantm circits Commnication tasks: one qbit
More informationMove Blocking Strategies in Receding Horizon Control
Move Blocking Strategies in Receding Horizon Control Raphael Cagienard, Pascal Grieder, Eric C. Kerrigan and Manfred Morari Abstract In order to deal with the comptational brden of optimal control, it
More informationPulses on a Struck String
8.03 at ESG Spplemental Notes Plses on a Strck String These notes investigate specific eamples of transverse motion on a stretched string in cases where the string is at some time ndisplaced, bt with a
More informationOptimization in Predictive Control Algorithm
Latest rends in Circits, Systems, Sinal Processin and Atomatic Control Optimization in Predictive Control Alorithm JAN ANOŠ, MAREK KUBALČÍK omas Bata University in Zlín, Faclty of Applied Informatics Nám..
More informationIn Module 3, we have learned about Exclusive OR (XOR) gate. Boolean Expression AB + A B = Y also A B = Y. Logic Gate. Truth table
Module 8 In Module 3, we have learned about Exclusive OR (XOR) gate. Boolean Expression AB + A B = Y also A B = Y Logic Gate Truth table A B Y 0 0 0 0 1 1 1 0 1 1 1 0 In Module 3, we have learned about
More informationConvergence analysis of ant colony learning
Delft University of Technology Delft Center for Systems and Control Technical report 11-012 Convergence analysis of ant colony learning J van Ast R Babška and B De Schtter If yo want to cite this report
More informationI block CLK 1 CLK 2. Oscillator - Delay block. circuit. US Al. Jun.28,2011 P21 P11 P22 P12. PlN P2N. (19) United States
(19) United States c12) Patent Application Pblication Wang et al. 111111 1111111111111111111111111111111111111111111111111111111111111111111111111111 US 21227143Al (1) Pb. o.: US 212/27143 A1 (43) Pb.
More informationDESIGN AND SIMULATION OF SELF-TUNING PREDICTIVE CONTROL OF TIME-DELAY PROCESSES
DESIGN AND SIMULAION OF SELF-UNING PREDICIVE CONROL OF IME-DELAY PROCESSES Vladimír Bobál,, Marek Kbalčík and Petr Dostál, omas Bata University in Zlín Centre of Polymer Systems, University Institte Department
More informationStair Matrix and its Applications to Massive MIMO Uplink Data Detection
1 Stair Matrix and its Applications to Massive MIMO Uplink Data Detection Fan Jiang, Stdent Member, IEEE, Cheng Li, Senior Member, IEEE, Zijn Gong, Senior Member, IEEE, and Roy S, Stdent Member, IEEE Abstract
More informationL 1 -smoothing for the Ornstein-Uhlenbeck semigroup
L -smoothing for the Ornstein-Uhlenbeck semigrop K. Ball, F. Barthe, W. Bednorz, K. Oleszkiewicz and P. Wolff September, 00 Abstract Given a probability density, we estimate the rate of decay of the measre
More informationUniversal Scheme for Optimal Search and Stop
Universal Scheme for Optimal Search and Stop Sirin Nitinawarat Qalcomm Technologies, Inc. 5775 Morehose Drive San Diego, CA 92121, USA Email: sirin.nitinawarat@gmail.com Vengopal V. Veeravalli Coordinated
More informationWe automate the bivariate change-of-variables technique for bivariate continuous random variables with
INFORMS Jornal on Compting Vol. 4, No., Winter 0, pp. 9 ISSN 09-9856 (print) ISSN 56-558 (online) http://dx.doi.org/0.87/ijoc.046 0 INFORMS Atomating Biariate Transformations Jeff X. Yang, John H. Drew,
More informationBLOOM S TAXONOMY. Following Bloom s Taxonomy to Assess Students
BLOOM S TAXONOMY Topic Following Bloom s Taonomy to Assess Stdents Smmary A handot for stdents to eplain Bloom s taonomy that is sed for item writing and test constrction to test stdents to see if they
More informationPREDICTABILITY OF SOLID STATE ZENER REFERENCES
PREDICTABILITY OF SOLID STATE ZENER REFERENCES David Deaver Flke Corporation PO Box 99 Everett, WA 986 45-446-6434 David.Deaver@Flke.com Abstract - With the advent of ISO/IEC 175 and the growth in laboratory
More informationAffine Invariant Total Variation Models
Affine Invariant Total Variation Models Helen Balinsky, Alexander Balinsky Media Technologies aboratory HP aboratories Bristol HP-7-94 Jne 6, 7* Total Variation, affine restoration, Sobolev ineqality,
More informationDepartment of Industrial Engineering Statistical Quality Control presented by Dr. Eng. Abed Schokry
Department of Indstrial Engineering Statistical Qality Control presented by Dr. Eng. Abed Schokry Department of Indstrial Engineering Statistical Qality Control C and U Chart presented by Dr. Eng. Abed
More informationWhen are Two Numerical Polynomials Relatively Prime?
J Symbolic Comptation (1998) 26, 677 689 Article No sy980234 When are Two Nmerical Polynomials Relatively Prime? BERNHARD BECKERMANN AND GEORGE LABAHN Laboratoire d Analyse Nmériqe et d Optimisation, Université
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT2: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 4 Following the slides of Dr. Ahmed H. Madian محرم 439 ه Winter 28
More informationSecond-Order Wave Equation
Second-Order Wave Eqation A. Salih Department of Aerospace Engineering Indian Institte of Space Science and Technology, Thirvananthapram 3 December 016 1 Introdction The classical wave eqation is a second-order
More informationModel Discrimination of Polynomial Systems via Stochastic Inputs
Model Discrimination of Polynomial Systems via Stochastic Inpts D. Georgiev and E. Klavins Abstract Systems biologists are often faced with competing models for a given experimental system. Unfortnately,
More informationThe Coset Distribution of Triple-Error-Correcting Binary Primitive BCH Codes
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 5, NO., APRIL 00 177 The Coset Distribtion of iple-error-correcting Binary Primitive BCH Codes Pascale Charpin, Member, IEEE, TorHelleseth, Fellow, IEEE, VictorA.
More informationNetwork Coding for Multiple Unicasts: An Approach based on Linear Optimization
Network Coding for Mltiple Unicasts: An Approach based on Linear Optimization Danail Traskov, Niranjan Ratnakar, Desmond S. Ln, Ralf Koetter, and Mriel Médard Abstract In this paper we consider the application
More informationV. Hadron quantum numbers
V. Hadron qantm nmbers Characteristics of a hadron: 1) Mass 2) Qantm nmbers arising from space-time symmetries : total spin J, parity P, charge conjgation C. Common notation: 1 -- + 2 J P (e.g. for proton:
More informationEXERCISES WAVE EQUATION. In Problems 1 and 2 solve the heat equation (1) subject to the given conditions. Assume a rod of length L.
.4 WAVE EQUATION 445 EXERCISES.3 In Problems and solve the heat eqation () sbject to the given conditions. Assme a rod of length.. (, t), (, t) (, ),, > >. (, t), (, t) (, ) ( ) 3. Find the temperatre
More informationNonlinear predictive control of dynamic systems represented by Wiener Hammerstein models
Nonlinear Dn (26) 86:93 24 DOI.7/s7-6-2957- ORIGINAL PAPER Nonlinear predictive control of dnamic sstems represented b Wiener Hammerstein models Maciej Ławrńcz Received: 7 December 25 / Accepted: 2 Jl
More informationRemarks on strongly convex stochastic processes
Aeqat. Math. 86 (01), 91 98 c The Athor(s) 01. This article is pblished with open access at Springerlink.com 0001-9054/1/010091-8 pblished online November 7, 01 DOI 10.1007/s00010-01-016-9 Aeqationes Mathematicae
More informationRECHERCHÉS. P. S. Laplace
RECHERCHÉS Sr le calcl intégral ax différences infiniment petìtes, & ax différences finies. P. S. Laplace Mélanges de philosophie et mathématiqe de la Société royale de Trin, 4, pp. 273-345, 1766 96 I.
More information1. Introduction 1.1. Background and previous results. Ramanujan introduced his zeta function in 1916 [11]. Following Ramanujan, let.
IDENTITIES FOR THE RAMANUJAN ZETA FUNCTION MATHEW ROGERS Abstract. We prove formlas for special vales of the Ramanjan ta zeta fnction. Or formlas show that L(, k) is a period in the sense of Kontsevich
More informationB-469 Simplified Copositive and Lagrangian Relaxations for Linearly Constrained Quadratic Optimization Problems in Continuous and Binary Variables
B-469 Simplified Copositive and Lagrangian Relaxations for Linearly Constrained Qadratic Optimization Problems in Continos and Binary Variables Naohiko Arima, Snyong Kim and Masakaz Kojima October 2012,
More informationChapter 2 Difficulties associated with corners
Chapter Difficlties associated with corners This chapter is aimed at resolving the problems revealed in Chapter, which are cased b corners and/or discontinos bondar conditions. The first section introdces
More informationFRTN10 Exercise 12. Synthesis by Convex Optimization
FRTN Exercise 2. 2. We want to design a controller C for the stable SISO process P as shown in Figre 2. sing the Yola parametrization and convex optimization. To do this, the control loop mst first be
More informationDiscontinuous Fluctuation Distribution for Time-Dependent Problems
Discontinos Flctation Distribtion for Time-Dependent Problems Matthew Hbbard School of Compting, University of Leeds, Leeds, LS2 9JT, UK meh@comp.leeds.ac.k Introdction For some years now, the flctation
More informationSystem identification of buildings equipped with closed-loop control devices
System identification of bildings eqipped with closed-loop control devices Akira Mita a, Masako Kamibayashi b a Keio University, 3-14-1 Hiyoshi, Kohok-k, Yokohama 223-8522, Japan b East Japan Railway Company
More informationVNVe 2017/ Final project
VNVe 2017/2018 - Final project Athor s name Febrary 21, 2018 Solve all examples and send yor final soltion (pdf file) and all sorce codes (LaTex, MATLAB,, ++, etc.) to e-mail address satek@fit.vtbr.cz
More informationFixed points for discrete logarithms
Fixed points for discrete logarithms Mariana Levin 1, Carl Pomerance 2, and and K. Sondararajan 3 1 Gradate Grop in Science and Mathematics Edcation University of California Berkeley, CA 94720, USA levin@berkeley.ed
More informationMulti-Voltage Floorplan Design with Optimal Voltage Assignment
Mlti-Voltage Floorplan Design with Optimal Voltage Assignment ABSTRACT Qian Zaichen Department of CSE The Chinese University of Hong Kong Shatin,N.T., Hong Kong zcqian@cse.chk.ed.hk In this paper, we stdy
More informationSTABILIZATIO ON OF LONGITUDINAL AIRCRAFT MOTION USING MODEL PREDICTIVE CONTROL AND EXACT LINEARIZATION
8 TH INTERNATIONAL CONGRESS OF THE AERONAUTICAL SCIENCES STABILIZATIO ON OF LONGITUDINAL AIRCRAFT MOTION USING MODEL PREDICTIVE CONTROL AND EXACT LINEARIZATION Čeliovsý S.*, Hospodář P.** *CTU Prage, Faclty
More information