Computer arithmetic. Intensive Computation. Annalisa Massini 2017/2018
|
|
- Gordon Fisher
- 5 years ago
- Views:
Transcription
1 Comuter arithmetic Intensive Comutation Annalisa Massini 7/8
2 Intensive Comutation - 7/8 References Comuter Architecture - A Quantitative Aroach Hennessy Patterson Aendix J
3 Intensive Comutation - 7/8 3 Half adder and Full adder Adders are usually imlemented by combining multile coies of simle comonents The natural comonents for addition are half adders and full adders The half adder takes two bits a and b as inut and roduces a sum bit s and a carry bit c out as outut As logic equations, s ab ab and ab c out
4 Intensive Comutation - 7/8 4 Half adder and Full adder The full adder takes three bits a, b and c as inut and roduces a sum bit s and a carry bit c out as outut As logic equations, s abc abc abc abc ( a b) c and ( a b) c ab c out The half adder is a (,) adder, since it takes two inuts and roduces two oututs. The full adder is a (3,) adder, since it takes three inuts and roduces two oututs S
5 Intensive Comutation - 7/8 5 Rile-Carry Addition The rincial roblem in constructing an adder for n-bit numbers out of smaller ieces is roagating the carries from one iece to the next The most obvious way to solve this is with a rile-carry adder, consisting of n full adders a n- b n- a b a b a b S n- s s s
6 Intensive Comutation - 7/8 6 Rile-Carry Addition The time a circuit takes to roduce an outut is roortional to the maximum number of logic levels through which a signal travels Determining the exact relationshi between logic levels and timings is highly technology deendent a n- b n- a b a b a b S n- s s s
7 Intensive Comutation - 7/8 7 Rile-Carry Addition When comaring adders we will simly comare the number of logic levels in each one A rile-carry adder takes two levels to comute c from a and b. Then it takes two more levels to comute c from c, a, b, and so on, u to cn So, there are a total of n levels a n- b n- a b a b a b S n- s s s
8 Intensive Comutation - 7/8 8 Rile-Carry Addition Tyical values of n are 3 for integer arithmetic and 53 for double-recision floating oint The rile-carry adder is the slowest adder, but also the cheaest It can be built with only n simle cells, connected in a simle, regular way a n- b n- a b a b a b S n- s s s
9 Intensive Comutation - 7/8 9 Rile-Carry Addition The rile-carry adder is relatively slow it takes time O(n) But it is used because in technologies like CMOS, the constant factor is very small Short rile adders are often used as building blocks in larger adders a n- b n- a b a b a b S n- s s s
10 Intensive Comutation - 7/8 Rile-Carry Addition for Signed Numbers The most widely used system for reresenting integers is the two s comlement, where the MSB is considered associated with a negative weight The value of a two s comlement number an an aa is: n n a a a a n n a n- b n- a b a b a b S n- s s s
11 Intensive Comutation - 7/8 Rile-Carry Addition for Signed Numbers One reason for the oularity of two s comlement is that it makes signed addition easy Simly discard the carryout from the high order bit Subtraction is executed as an addition: A-B = A+(-B), recalling that X X a n- b n- a b a b a b S n- s s s
12 Intensive Comutation - 7/8 Rile-Carry Addition for Signed Numbers The Rile-Carry adder can be used also for subtraction acting on second oerand B and on C If line comlement is then oerand B is bit wise comlemented and C = b n- b b b comlement a n- a a a S n- s s s
13 Intensive Comutation - 7/8 3 Unsigned Multilication The simlest multilier comutes the roduct of two unsigned numbers, a n a n a and b n b n b, one bit at a time Register Product is initially Carry out Product n bits Shift Right A - Multilier n bits n bits B - Multilicand
14 Intensive Comutation - 7/8 4 Unsigned Multilication Each multily ste has two arts: (i) If the least-significant bit of A is, then register B, containing b n b n b, is added to P; otherwise, is added to P. The sum is laced back into P Carry out Product n bits Shift Right A - Multilier n bits n bits B - Multilicand
15 Intensive Comutation - 7/8 5 Unsigned Multilication (ii) Registers P and A are shifted right, with the carry-out of the sum being moved into the high-order bit of P, the low-order bit of P being moved into register A, and the rightmost bit of A (not used in the rest of the algorithm) being shifted out Carry out Product n bits Shift Right A - Multilier n bits n bits B - Multilicand
16 Intensive Comutation - 7/8 6 Unsigned Multilication Hence, we add the contents of P to either B or (deending on the low-order bit of A), relace P with the sum, and then shift both P and A one bit right After n stes, the roduct aears in registers P and A, with A holding the lower-order bits Carry out Product n bits Shift Right A - Multilier n bits n bits B - Multilicand
17 Intensive Comutation - 7/8 7 Signed Multilication To multily two s comlement numbers, the obvious aroach is to convert oerands to be nonnegative, do an unsigned multilication, and then (if the original oerands were of oosite signs) negate the result This requires extra time and hardware Carry out Product n bits Shift Right A - Multilier n bits n bits B - Multilicand
18 Intensive Comutation - 7/8 8 Signed Multilication A better aroach to multily A and B using the hardware below: If B is otentially negative but A is nonnegative, to convert the unsigned multilication algorithm into a two s comlement one we need that when P is shifted, it is shifted arithmetically Carry out Product n bits Shift Right A - Multilier n bits n bits B - Multilicand
19 Intensive Comutation - 7/8 9 Signed Multilication A better aroach to multily A and B using the hardware below: If A is negative, the method is Booth recoding that is based on the fact that any sequence of s in a binary number can be written as =.. - Carry out Product n bits Shift Right A - Multilier n bits n bits B - Multilicand
20 Intensive Comutation - 7/8 Signed Multilication Then, we relace a string of s in multilier with an initial subtract when we first see a one and then later add for the bit after the last one x + shift ( in multilier) + add ( in multilier) + add ( in multilier) + shift ( in multilier)
21 Intensive Comutation - 7/8 Signed Multilication Then, we relace a string of s in multilier with an initial subtract when we first see a one and then later add for the bit after the last one x + shift ( in multilier) + add ( in multilier) + add ( in multilier) + shift ( in multilier) x + shift ( in multilier) - sub(first in multl) + shift(mid string of s) + add(rior ste had last )
22 Intensive Comutation - 7/8 Signed Multilication Hence, to deal with negative values of A, all that is required is to sometimes subtract B from P, instead of adding either B or to P Rules: If the initial content of A is a n a, then ste (i) in the multilication algorithm becomes: If ai = and ai =, then add to P If ai = and ai =, then add B to P If ai = and ai =, then subtract B from P If ai = and ai =, then add to P For the first ste, when i =, take ai to be
23 Intensive Comutation - 7/8 3 Seeding U Integer Multilication Integer addition is the simlest oeration and the most imortant Even for rograms that don t do exlicit arithmetic, addition must be erformed to increment the rogram counter and to calculate addresses The delay of an N-bit rile-carry adder is: t rile = Nt FA where t FA is the delay of a full adder There are different techniques to increase the seed of integer oerations (that lead to faster floating oint) CLA
24 Intensive Comutation - 7/8 4 Seeding U Integer Multilication Methods that increase the seed of multilication can be divided into two classes: single adder multile adders In the simle multilier we described, each multilication ste asses through the single adder The amount of comutation in each ste deends on the used adder If the sace for many adders is available, then multilication seed can be imroved
25 Intensive Comutation - 7/8 5 Pielined arithmetic Consider the instruction ielining already described The rocessor goes through a reetitive cycle of fetching and rocessing instructions In the absence of hazards, the rocessor is continuously fetching instructions from sequential locations the ieline is ket full and a savings in time is achieved Similarly, a ielined ALU will save time if it is fed a stream of data from sequential locations A single, isolated oeration is not seeded u by ieline The seedu is achieved when a vector of oerands is resented to the units in the ALU
26 Intensive Comutation - 7/8 6 Pielined Addition For n bits oerands, a ieline adder consists of n stages of half adders Registers are inserted at each stage to synchronize the comutation At each clock cycle a new air of oerands is alied to the inuts of the adder a 3 b 3 HA HA HA HA HA HA HA HA HA s 3 a b a b a b HA s s s
27 Intensive Comutation - 7/8 7 Pielined Addition After n clock cycles, the sum of the first air of oerands is obtained The comuting time for a single sum is the same of the carry-rile adder A new sum is obtained at each clock cycle starting from the (n+)- th clock cycle a 3 b 3 HA HA HA HA HA HA HA HA HA a b a b a b HA s 3 s s s
28 Intensive Comutation - 7/8 8 Pielined Addition The number of HA is O(n ), whereas the circuit comlexity of the carry-rile adder is O(n) The added circuit comlexity ays off if long sequences of numbers are being added a 3 b 3 HA HA HA HA HA HA HA HA HA a b a b a b HA s 3 s s s
29 Intensive Comutation - 7/8 9 7 a3b Pielined Unsigned Multilication 6 3 a3b ab 5 3 a3b ab ab 4 3 a3 b3 a3b ab ab ab The roduct of two n bit oerands has length n 3 3 a b ab ab a b Result is obtained by executing n- sums a b ab a b a b a b a 3 b 3 HA HA a b 3 a 3 b a 3 b a 3 b a b a b a b a b a b a b HA a b a b 3 HA HA FA FA FA FA FA FA HA HA HA a b a b 3 a b HA
30 Intensive Comutation - 7/8 3 7 a3b Pielined Unsigned Multilication 6 3 a3b ab 5 3 a3b ab ab 4 3 a3 b3 a3b ab ab ab 3 3 a b ab ab a b a b ab a b a b a b a 3 b a 3 b a 3 b a 3 3 b a b a b a b a b a b a b a b a b 3 a b 3 a b HA HA HA FA FA FA a b 3 FA FA FA a b Inuts to the multilier are logical AND among airs of bits HA HA HA HA HA There are (n-) stages of FA or HA 7 HA
31 Intensive Comutation - 7/8 3 Pielined Unsigned Multilication After stage (n-) all bit roducts (AND) are added Last (n-) stages reresent a ielined adder Bit n- of the result is obtained as OR among the carries generated by the most left HA of each stage a 3 b a 3 b a 3 b a 3 3 b a b a b a b a b a b a b a b a b 3 a b 3 a b HA HA HA FA FA FA a b 3 FA FA FA HA HA HA HA HA HA a b
32 Intensive Comutation - 7/8 3 Pielined Unsigned Multilication After (n-) clock cycles, the roduct of the first air of oerands is obtained A new result is obtained at each clock cycle starting from the (n-)-th clock cycle a 3 b a 3 b a 3 b a 3 3 b a b a b a b a b a b a b a b a b 3 a b 3 a b HA HA HA FA FA FA a b 3 FA FA FA HA HA HA HA HA HA a b
33 Intensive Comutation - 7/8 33 Pielined Signed Multilication Signed numbers are extended to the length n of the roduct and used as oerands a 5 b a 4 b HA a 3 b FA a 4 b a 3 b a 3 b a b a b a b HA HA HA a b a b a b FA FA FA a b HA a b a b a b 3 a b 3 a b 3 FA FA FA a5b a4b3 a3b4 a b 5 a5b a4b a3b ab a b a5 b5 a5b a4b a3b ab ab ab a4 b4 a4b a3b ab ab a b a3 b3 a3b ab ab a b 3 3 a b ab ab a b a b ab a b a b a b a b 4 FA a b 5 FA a b 4 FA 5 4 3
34 Intensive Comutation - 7/8 34 Pielined Signed Multilication Partial roducts of length n are considered (the remaining art is ignored) All stages but the first consists of FAs a 5 b a 4 b a 4 b a 3 b a 3 b a b a b a b HA HA HA HA a 3 b a b a b a b FA FA FA FA a b 3 a b 3 a b 3 FA FA FA a b HA a b a b a5b a4b3 a3b4 a b 5 a5b a4b a3b ab a b a5 b5 a5b a4b a3b ab ab ab a4 b4 a4b a3b ab ab a b a3 b3 a3b ab ab a b 3 3 a b ab ab a b a b ab a b a b a b a b 4 FA a b 5 FA a b 4 FA 5 4 3
35 Intensive Comutation - 7/8 35 CIRCUIT AREA AND TIME EVALUATION
36 Intensive Comutation - 7/8 36 Circuit area and time To discuss about the time and area, it is useful the analytical model (unit-gate model) resented in A. Tyagi, A reduced-area scheme for carry-select adders, IEEE Trans. Comut., 993 They use a simlistic model for gate-count and gate-delay: Each gate excet EX-OR counts as one elementary gate An EX-OR gate is counted as two elementary gates, because in static (restoring) CMOS, an EX-OR gate is imlemented as two elementary gates (NAND) The delay through an elementary gate is counted as one gatedelay unit, but an EX-OR gate is two gate-delay units
37 Intensive Comutation - 7/8 37 Circuit area and time In this model we are ignoring the fanin and fanout of a gate This can lead to unfair comarisons for circuits containing gates with a large difference in fanin or fanout For instance, gates in the CLA adder have different fanin A carry-rile adder has no gates with fanin and fanout greater than The best comarison for a VLSI imlementation is actual area and time The gate-count and gate-delay comarisons may not always be consistent with the area-time comarisons
38 Intensive Comutation - 7/8 38 Circuit area and time To simlify we consider: Any gate (but the EX-OR) counts as one gate for both area and delay A gate and T gate An exclusive-or gate counts as two elementary gates for both area and delay A EX-OR =A gate and T EX-OR =T gate An m-inut gate counts as m gates for area and log m gates for delay A m-gate =(m-)a gate and T m-gate = log m T gate
39 Intensive Comutation - 7/8 39 Circuit area and time A half adder (HA) has: delay unit gates T HA = T gate area 3 unit gates A HA = 3 A gate
40 Intensive Comutation - 7/8 4 Circuit area and time A half adder (HA) has: delay unit gates T HA = T gate area 3 unit gates A HA = 3 A gate A full adder (FA) has: delay unit gates T FA = 4 T gate area 3 unit gates A FA = 7 A gate
41 Intensive Comutation - 7/8 4 Circuit area and time A half adder (HA) has: delay unit gates T HA = T gate area 3 unit gates A HA = 3 A gate A full adder (FA) has: delay unit gates T FA = 4 T gate = T HA area 3 unit gates A FA = 7 A gate = A HA + A gate S
42 Intensive Comutation - 7/8 4 Circuit area and time A carry-rile adder for n-bits oerands has: delay T CR-adder T CR-adder = n T FA = n T HA = 4n T gate area A CR-adder A CR-adder = n A FA = n A HA + n A gate = 7n A gate a n- b n- a b a b a b S n- s s s
Unit 1 - Computer Arithmetic
FIXD-POINT (FX) ARITHMTIC Unit 1 - Comuter Arithmetic INTGR NUMBRS n bit number: b n 1 b n 2 b 0 Decimal Value Range of values UNSIGND n 1 SIGND D = b i 2 i D = 2 n 1 b n 1 + b i 2 i n 2 i=0 i=0 [0, 2
More informationRound-off Errors and Computer Arithmetic - (1.2)
Round-off Errors and Comuter Arithmetic - (.). Round-off Errors: Round-off errors is roduced when a calculator or comuter is used to erform real number calculations. That is because the arithmetic erformed
More informationOutline. EECS150 - Digital Design Lecture 26 Error Correction Codes, Linear Feedback Shift Registers (LFSRs) Simple Error Detection Coding
Outline EECS150 - Digital Design Lecture 26 Error Correction Codes, Linear Feedback Shift Registers (LFSRs) Error detection using arity Hamming code for error detection/correction Linear Feedback Shift
More informationLaboratoire de l Informatique du Parallélisme
Laboratoire de l Informatique du Parallélisme Ecole Normale Suérieure de Lyon Unité de recherche associée au CNRS n 1398 Asynchronous Sub-Logarithmic Adders J.M. Muller, A. Tisserand and J.M. Vincent May
More informationEvaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models
Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models Ketan N. Patel, Igor L. Markov and John P. Hayes University of Michigan, Ann Arbor 48109-2122 {knatel,imarkov,jhayes}@eecs.umich.edu
More informationJohn Weatherwax. Analysis of Parallel Depth First Search Algorithms
Sulementary Discussions and Solutions to Selected Problems in: Introduction to Parallel Comuting by Viin Kumar, Ananth Grama, Anshul Guta, & George Karyis John Weatherwax Chater 8 Analysis of Parallel
More informationChapter 5. Digital Design and Computer Architecture, 2 nd Edition. David Money Harris and Sarah L. Harris. Chapter 5 <1>
Chapter 5 Digital Design and Computer Architecture, 2 nd Edition David Money Harris and Sarah L. Harris Chapter 5 Chapter 5 :: Topics Introduction Arithmetic Circuits umber Systems Sequential Building
More informationAnalysis of execution time for parallel algorithm to dertmine if it is worth the effort to code and debug in parallel
Performance Analysis Introduction Analysis of execution time for arallel algorithm to dertmine if it is worth the effort to code and debug in arallel Understanding barriers to high erformance and redict
More informationFor q 0; 1; : : : ; `? 1, we have m 0; 1; : : : ; q? 1. The set fh j(x) : j 0; 1; ; : : : ; `? 1g forms a basis for the tness functions dened on the i
Comuting with Haar Functions Sami Khuri Deartment of Mathematics and Comuter Science San Jose State University One Washington Square San Jose, CA 9519-0103, USA khuri@juiter.sjsu.edu Fax: (40)94-500 Keywords:
More informationLecture 8: Sequential Multipliers
Lecture 8: Sequential Multipliers ECE 645 Computer Arithmetic 3/25/08 ECE 645 Computer Arithmetic Lecture Roadmap Sequential Multipliers Unsigned Signed Radix-2 Booth Recoding High-Radix Multiplication
More informationShadow Computing: An Energy-Aware Fault Tolerant Computing Model
Shadow Comuting: An Energy-Aware Fault Tolerant Comuting Model Bryan Mills, Taieb Znati, Rami Melhem Deartment of Comuter Science University of Pittsburgh (bmills, znati, melhem)@cs.itt.edu Index Terms
More informationCMSC 425: Lecture 4 Geometry and Geometric Programming
CMSC 425: Lecture 4 Geometry and Geometric Programming Geometry for Game Programming and Grahics: For the next few lectures, we will discuss some of the basic elements of geometry. There are many areas
More informationCharacterizing the Behavior of a Probabilistic CMOS Switch Through Analytical Models and Its Verification Through Simulations
Characterizing the Behavior of a Probabilistic CMOS Switch Through Analytical Models and Its Verification Through Simulations PINAR KORKMAZ, BILGE E. S. AKGUL and KRISHNA V. PALEM Georgia Institute of
More informationDistributed Rule-Based Inference in the Presence of Redundant Information
istribution Statement : roved for ublic release; distribution is unlimited. istributed Rule-ased Inference in the Presence of Redundant Information June 8, 004 William J. Farrell III Lockheed Martin dvanced
More informationEE 457 HW 2 Arithmetic Designs Redekopp Puvvada Name: Due: See Website
EE 457 HW 2 rithmetic Desins Redeko uvvada Name: Due: ee Website core: lease ost any questions reardin HW roblems on iazza. Refer to your class notes Unit on Fast ddition. In this class we will count the
More informationPHYS 301 HOMEWORK #9-- SOLUTIONS
PHYS 0 HOMEWORK #9-- SOLUTIONS. We are asked to use Dirichlet' s theorem to determine the value of f (x) as defined below at x = 0, ± /, ± f(x) = 0, - < x
More informationLIMITATIONS OF RECEPTRON. XOR Problem The failure of the perceptron to successfully simple problem such as XOR (Minsky and Papert).
LIMITATIONS OF RECEPTRON XOR Problem The failure of the ercetron to successfully simle roblem such as XOR (Minsky and Paert). x y z x y z 0 0 0 0 0 0 Fig. 4. The exclusive-or logic symbol and function
More informationCryptanalysis of Pseudorandom Generators
CSE 206A: Lattice Algorithms and Alications Fall 2017 Crytanalysis of Pseudorandom Generators Instructor: Daniele Micciancio UCSD CSE As a motivating alication for the study of lattice in crytograhy we
More informationVLSI Design Issues. ECE 410, Prof. F. Salem/Prof. A. Mason notes update
VLSI Design Issues Scaling/Moore s Law has limits due to the hysics of material. Now L (L=20nm??) affects tx delays (seed), noise, heat (ower consumtion) Scaling increases density of txs and requires more
More informationMeshless Methods for Scientific Computing Final Project
Meshless Methods for Scientific Comuting Final Project D0051008 洪啟耀 Introduction Floating island becomes an imortant study in recent years, because the lands we can use are limit, so eole start thinking
More informationECE/CS 552: Introduction To Computer Architecture 1. Instructor:Mikko H Lipasti. Fall 2010 University i of Wisconsin-Madison
ECE/CS 552: Arithmetic I Instructor:Mikko H Lipasti Fall 2010 Univsity i of Wisconsin-Madison i Lecture notes partially based on set created by Mark Hill. Basic Arithmetic and the ALU Numb representations:
More informationMODELING THE RELIABILITY OF C4ISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL
Technical Sciences and Alied Mathematics MODELING THE RELIABILITY OF CISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL Cezar VASILESCU Regional Deartment of Defense Resources Management
More informationOn Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm
On Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm Gabriel Noriega, José Restreo, Víctor Guzmán, Maribel Giménez and José Aller Universidad Simón Bolívar Valle de Sartenejas,
More informationNumber representation
Number representation A number can be represented in binary in many ways. The most common number types to be represented are: Integers, positive integers one-complement, two-complement, sign-magnitude
More informationFault Tolerant Quantum Computing Robert Rogers, Thomas Sylwester, Abe Pauls
CIS 410/510, Introduction to Quantum Information Theory Due: June 8th, 2016 Sring 2016, University of Oregon Date: June 7, 2016 Fault Tolerant Quantum Comuting Robert Rogers, Thomas Sylwester, Abe Pauls
More informationDesign Constraint for Fine Grain Supply Voltage Control LSI
ASP-DAC 211 Designer s Forum Session 8D-3: State-of-The-Art SoCs and Design Methodologies Design Constraint for Fine Grain Suly Voltage Control LSI January 28, 211 Atsuki Inoue Platform Technologies Laboratories
More informationDesign of Sequential Circuits
Design of Sequential Circuits Seven Steps: Construct a state diagram (showing contents of flip flop and inputs with next state) Assign letter variables to each flip flop and each input and output variable
More informationFeedback-error control
Chater 4 Feedback-error control 4.1 Introduction This chater exlains the feedback-error (FBE) control scheme originally described by Kawato [, 87, 8]. FBE is a widely used neural network based controller
More informationUncorrelated Multilinear Principal Component Analysis for Unsupervised Multilinear Subspace Learning
TNN-2009-P-1186.R2 1 Uncorrelated Multilinear Princial Comonent Analysis for Unsuervised Multilinear Subsace Learning Haiing Lu, K. N. Plataniotis and A. N. Venetsanooulos The Edward S. Rogers Sr. Deartment
More informationCmpt 250 Unsigned Numbers January 11, 2008
Cmt 25 Unsined Numbers Januar, 28 These notes serve two uroses in the contet of Cmt 25: as we develo the basic desin of an inteer ALU, we ll review the basics of number reresentation and combinational
More information4. Score normalization technical details We now discuss the technical details of the score normalization method.
SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a non-technical descrition of the scoring rules
More information9. Datapath Design. Jacob Abraham. Department of Electrical and Computer Engineering The University of Texas at Austin VLSI Design Fall 2017
9. Datapath Design Jacob Abraham Department of Electrical and Computer Engineering The University of Texas at Austin VLSI Design Fall 2017 October 2, 2017 ECE Department, University of Texas at Austin
More informationBinary Multipliers. Reading: Study Chapter 3. The key trick of multiplication is memorizing a digit-to-digit table Everything else was just adding
Binary Multipliers The key trick of multiplication is memorizing a digit-to-digit table Everything else was just adding 2 3 4 5 6 7 8 9 2 3 4 5 6 7 8 9 2 2 4 6 8 2 4 6 8 3 3 6 9 2 5 8 2 24 27 4 4 8 2 6
More informationLinear diophantine equations for discrete tomography
Journal of X-Ray Science and Technology 10 001 59 66 59 IOS Press Linear diohantine euations for discrete tomograhy Yangbo Ye a,gewang b and Jiehua Zhu a a Deartment of Mathematics, The University of Iowa,
More informationECE260: Fundamentals of Computer Engineering
Data Representation & 2 s Complement James Moscola Dept. of Engineering & Computer Science York College of Pennsylvania Based on Computer Organization and Design, 5th Edition by Patterson & Hennessy Data
More informationSynthesis of Moore FSM with Expanded Coding Space
Volume 3 Issue, January 24 Synthesis of oore FS with Exanded Coding Sace Olena Hebda, Larysa Titarenko Institute of Comuter Engineering and Electronics University of Zielona Góra Zielona Góra, Poland Email:
More informationThe Euler Phi Function
The Euler Phi Function 7-3-2006 An arithmetic function takes ositive integers as inuts and roduces real or comlex numbers as oututs. If f is an arithmetic function, the divisor sum Dfn) is the sum of the
More informationAI*IA 2003 Fusion of Multiple Pattern Classifiers PART III
AI*IA 23 Fusion of Multile Pattern Classifiers PART III AI*IA 23 Tutorial on Fusion of Multile Pattern Classifiers by F. Roli 49 Methods for fusing multile classifiers Methods for fusing multile classifiers
More informationD.1 Deutsch-Jozsa algorithm
4 CHAPTER III. QUANTUM COMPUTATION Figure III.: Quantum circuit for Deutsch algorithm. [fig. from Nielsen & Chuang (00)] D Quantum algorithms D. Deutsch-Jozsa algorithm D..a Deutsch s algorithm In this
More informationConvex Optimization methods for Computing Channel Capacity
Convex Otimization methods for Comuting Channel Caacity Abhishek Sinha Laboratory for Information and Decision Systems (LIDS), MIT sinhaa@mit.edu May 15, 2014 We consider a classical comutational roblem
More informationrate~ If no additional source of holes were present, the excess
DIFFUSION OF CARRIERS Diffusion currents are resent in semiconductor devices which generate a satially non-uniform distribution of carriers. The most imortant examles are the -n junction and the biolar
More information5. PRESSURE AND VELOCITY SPRING Each component of momentum satisfies its own scalar-transport equation. For one cell:
5. PRESSURE AND VELOCITY SPRING 2019 5.1 The momentum equation 5.2 Pressure-velocity couling 5.3 Pressure-correction methods Summary References Examles 5.1 The Momentum Equation Each comonent of momentum
More informationGIVEN an input sequence x 0,..., x n 1 and the
1 Running Max/Min Filters using 1 + o(1) Comarisons er Samle Hao Yuan, Member, IEEE, and Mikhail J. Atallah, Fellow, IEEE Abstract A running max (or min) filter asks for the maximum or (minimum) elements
More informationRecent Developments in Multilayer Perceptron Neural Networks
Recent Develoments in Multilayer Percetron eural etworks Walter H. Delashmit Lockheed Martin Missiles and Fire Control Dallas, Texas 75265 walter.delashmit@lmco.com walter.delashmit@verizon.net Michael
More informationParallelism and Locality in Priority Queues. A. Ranade S. Cheng E. Deprit J. Jones S. Shih. University of California. Berkeley, CA 94720
Parallelism and Locality in Priority Queues A. Ranade S. Cheng E. Derit J. Jones S. Shih Comuter Science Division University of California Berkeley, CA 94720 Abstract We exlore two ways of incororating
More informationCombining Logistic Regression with Kriging for Mapping the Risk of Occurrence of Unexploded Ordnance (UXO)
Combining Logistic Regression with Kriging for Maing the Risk of Occurrence of Unexloded Ordnance (UXO) H. Saito (), P. Goovaerts (), S. A. McKenna (2) Environmental and Water Resources Engineering, Deartment
More informationSection 0.10: Complex Numbers from Precalculus Prerequisites a.k.a. Chapter 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative
Section 0.0: Comlex Numbers from Precalculus Prerequisites a.k.a. Chater 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative Commons Attribution-NonCommercial-ShareAlike.0 license.
More informationModeling and Estimation of Full-Chip Leakage Current Considering Within-Die Correlation
6.3 Modeling and Estimation of Full-Chi Leaage Current Considering Within-Die Correlation Khaled R. eloue, Navid Azizi, Farid N. Najm Deartment of ECE, University of Toronto,Toronto, Ontario, Canada {haled,nazizi,najm}@eecg.utoronto.ca
More informationPaper C Exact Volume Balance Versus Exact Mass Balance in Compositional Reservoir Simulation
Paer C Exact Volume Balance Versus Exact Mass Balance in Comositional Reservoir Simulation Submitted to Comutational Geosciences, December 2005. Exact Volume Balance Versus Exact Mass Balance in Comositional
More informationThe Noise Power Ratio - Theory and ADC Testing
The Noise Power Ratio - Theory and ADC Testing FH Irons, KJ Riley, and DM Hummels Abstract This aer develos theory behind the noise ower ratio (NPR) testing of ADCs. A mid-riser formulation is used for
More informationA Parallel Algorithm for Minimization of Finite Automata
A Parallel Algorithm for Minimization of Finite Automata B. Ravikumar X. Xiong Deartment of Comuter Science University of Rhode Island Kingston, RI 02881 E-mail: fravi,xiongg@cs.uri.edu Abstract In this
More informationFundamentals of Digital Design
Fundamentals of Digital Design Digital Radiation Measurement and Spectroscopy NE/RHP 537 1 Binary Number System The binary numeral system, or base-2 number system, is a numeral system that represents numeric
More informationA randomized sorting algorithm on the BSP model
A randomized sorting algorithm on the BSP model Alexandros V. Gerbessiotis a, Constantinos J. Siniolakis b a CS Deartment, New Jersey Institute of Technology, Newark, NJ 07102, USA b The American College
More informationResearch of PMU Optimal Placement in Power Systems
Proceedings of the 5th WSEAS/IASME Int. Conf. on SYSTEMS THEORY and SCIENTIFIC COMPUTATION, Malta, Setember 15-17, 2005 (38-43) Research of PMU Otimal Placement in Power Systems TIAN-TIAN CAI, QIAN AI
More informationAutomatic Generation and Integration of Equations of Motion for Linked Mechanical Systems
Automatic Generation and Integration of Equations of Motion for Linked Mechanical Systems D. Todd Griffith a, John L. Junkins a, and James D. Turner b a Deartment of Aerosace Engineering, Texas A&M University,
More informationAn Investigation on the Numerical Ill-conditioning of Hybrid State Estimators
An Investigation on the Numerical Ill-conditioning of Hybrid State Estimators S. K. Mallik, Student Member, IEEE, S. Chakrabarti, Senior Member, IEEE, S. N. Singh, Senior Member, IEEE Deartment of Electrical
More informationOptical Fibres - Dispersion Part 1
ECE 455 Lecture 05 1 Otical Fibres - Disersion Part 1 Stavros Iezekiel Deartment of Electrical and Comuter Engineering University of Cyrus HMY 445 Lecture 05 Fall Semester 016 ECE 455 Lecture 05 Otical
More informationIndirect Rotor Field Orientation Vector Control for Induction Motor Drives in the Absence of Current Sensors
Indirect Rotor Field Orientation Vector Control for Induction Motor Drives in the Absence of Current Sensors Z. S. WANG *, S. L. HO ** * College of Electrical Engineering, Zhejiang University, Hangzhou
More informationAdvanced Cryptography Midterm Exam
Advanced Crytograhy Midterm Exam Solution Serge Vaudenay 17.4.2012 duration: 3h00 any document is allowed a ocket calculator is allowed communication devices are not allowed the exam invigilators will
More informationSolved Problems. (a) (b) (c) Figure P4.1 Simple Classification Problems First we draw a line between each set of dark and light data points.
Solved Problems Solved Problems P Solve the three simle classification roblems shown in Figure P by drawing a decision boundary Find weight and bias values that result in single-neuron ercetrons with the
More informationCounters. We ll look at different kinds of counters and discuss how to build them
Counters We ll look at different kinds of counters and discuss how to build them These are not only examples of sequential analysis and design, but also real devices used in larger circuits 1 Introducing
More informationProof Nets and Boolean Circuits
Proof Nets and Boolean Circuits Kazushige Terui terui@nii.ac.j National Institute of Informatics, Tokyo 14/07/04, Turku.1/44 Motivation (1) Proofs-as-Programs (Curry-Howard) corresondence: Proofs = Programs
More informationLogic and Computer Design Fundamentals. Chapter 5 Arithmetic Functions and Circuits
Logic and Computer Design Fundamentals Chapter 5 Arithmetic Functions and Circuits Arithmetic functions Operate on binary vectors Use the same subfunction in each bit position Can design functional block
More informationEE 508 Lecture 13. Statistical Characterization of Filter Characteristics
EE 508 Lecture 3 Statistical Characterization of Filter Characteristics Comonents used to build filters are not recisely redictable L C Temerature Variations Manufacturing Variations Aging Model variations
More informationMultilayer Perceptron Neural Network (MLPs) For Analyzing the Properties of Jordan Oil Shale
World Alied Sciences Journal 5 (5): 546-552, 2008 ISSN 1818-4952 IDOSI Publications, 2008 Multilayer Percetron Neural Network (MLPs) For Analyzing the Proerties of Jordan Oil Shale 1 Jamal M. Nazzal, 2
More informationFactors Effect on the Saturation Parameter S and there Influences on the Gain Behavior of Ytterbium Doped Fiber Amplifier
Australian Journal of Basic and Alied Sciences, 5(12): 2010-2020, 2011 ISSN 1991-8178 Factors Effect on the Saturation Parameter S and there Influences on the Gain Behavior of Ytterbium Doed Fiber Amlifier
More informationSets of Real Numbers
Chater 4 Sets of Real Numbers 4. The Integers Z and their Proerties In our revious discussions about sets and functions the set of integers Z served as a key examle. Its ubiquitousness comes from the fact
More informationUNSIGNED BINARY NUMBERS DIGITAL ELECTRONICS SYSTEM DESIGN WHAT ABOUT NEGATIVE NUMBERS? BINARY ADDITION 11/9/2018
DIGITAL ELECTRONICS SYSTEM DESIGN LL 2018 PROFS. IRIS BAHAR & ROD BERESFORD NOVEMBER 9, 2018 LECTURE 19: BINARY ADDITION, UNSIGNED BINARY NUMBERS For the binary number b n-1 b n-2 b 1 b 0. b -1 b -2 b
More informationTree and Array Multipliers Ivor Page 1
Tree and Array Multipliers 1 Tree and Array Multipliers Ivor Page 1 11.1 Tree Multipliers In Figure 1 seven input operands are combined by a tree of CSAs. The final level of the tree is a carry-completion
More informationKnuth-Morris-Pratt Algorithm
Knuth-Morris-Pratt Algorithm The roblem of tring Matching Given a string, the roblem of string matching deals with finding whether a attern occurs in and if does occur then returning osition in where occurs.
More informationRadial Basis Function Networks: Algorithms
Radial Basis Function Networks: Algorithms Introduction to Neural Networks : Lecture 13 John A. Bullinaria, 2004 1. The RBF Maing 2. The RBF Network Architecture 3. Comutational Power of RBF Networks 4.
More informationThe goal differs from prime factorization. Prime factorization would initialize all divisors to be prime numbers instead of integers*
Quantum Algorithm Processor For Finding Exact Divisors Professor J R Burger Summary Wiring diagrams are given for a quantum algorithm processor in CMOS to compute, in parallel, all divisors of an n-bit
More informationCSE 311 Lecture 02: Logic, Equivalence, and Circuits. Emina Torlak and Kevin Zatloukal
CSE 311 Lecture 02: Logic, Equivalence, and Circuits Emina Torlak and Kevin Zatloukal 1 Toics Proositional logic A brief review of Lecture 01. Classifying comound roositions Converse, contraositive, and
More informationElliptic Curves and Cryptography
Ellitic Curves and Crytograhy Background in Ellitic Curves We'll now turn to the fascinating theory of ellitic curves. For simlicity, we'll restrict our discussion to ellitic curves over Z, where is a
More informationChapter 5 Arithmetic Circuits
Chapter 5 Arithmetic Circuits SKEE2263 Digital Systems Mun im/ismahani/izam {munim@utm.my,e-izam@utm.my,ismahani@fke.utm.my} February 11, 2016 Table of Contents 1 Iterative Designs 2 Adders 3 High-Speed
More informationChapter 7 Rational and Irrational Numbers
Chater 7 Rational and Irrational Numbers In this chater we first review the real line model for numbers, as discussed in Chater 2 of seventh grade, by recalling how the integers and then the rational numbers
More informationNUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:
NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two oerations defined on them, addition and multilication,
More informationNUMERICAL AND THEORETICAL INVESTIGATIONS ON DETONATION- INERT CONFINEMENT INTERACTIONS
NUMERICAL AND THEORETICAL INVESTIGATIONS ON DETONATION- INERT CONFINEMENT INTERACTIONS Tariq D. Aslam and John B. Bdzil Los Alamos National Laboratory Los Alamos, NM 87545 hone: 1-55-667-1367, fax: 1-55-667-6372
More informationSIMULATION OF DIFFUSION PROCESSES IN LABYRINTHIC DOMAINS BY USING CELLULAR AUTOMATA
SIMULATION OF DIFFUSION PROCESSES IN LABYRINTHIC DOMAINS BY USING CELLULAR AUTOMATA Udo Buschmann and Thorsten Rankel and Wolfgang Wiechert Deartment of Simulation University of Siegen Paul-Bonatz-Str.
More informationCMP 334: Seventh Class
CMP 334: Seventh Class Performance HW 5 solution Averages and weighted averages (review) Amdahl's law Ripple-carry adder circuits Binary addition Half-adder circuits Full-adder circuits Subtraction, negative
More informationAlgorithms for Air Traffic Flow Management under Stochastic Environments
Algorithms for Air Traffic Flow Management under Stochastic Environments Arnab Nilim and Laurent El Ghaoui Abstract A major ortion of the delay in the Air Traffic Management Systems (ATMS) in US arises
More informationSpin as Dynamic Variable or Why Parity is Broken
Sin as Dynamic Variable or Why Parity is Broken G. N. Golub golubgn@meta.ua There suggested a modification of the Dirac electron theory, eliminating its mathematical incomleteness. The modified Dirac electron,
More informationCOMPUTER SIMULATION OF A LABORATORY HYDRAULIC SYSTEM WITH MATLAB-SIMULINK
DVNCED ENGINEERING 4(20101, ISSN 1846-5900 COMPUTER SIMULTION OF LORTORY HYDRULIC SYSTEM WITH MTL-SIMULINK Grego, G. & Siminiati, D. bstract: The article resents some selected roblems related to modeling
More informationLecture 8. Sequential Multipliers
Lecture 8 Sequential Multipliers Required Reading Behrooz Parhami, Computer Arithmetic: Algorithms and Hardware Design Chapter 9, Basic Multiplication Scheme Chapter 10, High-Radix Multipliers Chapter
More informationNode-voltage method using virtual current sources technique for special cases
Node-oltage method using irtual current sources technique for secial cases George E. Chatzarakis and Marina D. Tortoreli Electrical and Electronics Engineering Deartments, School of Pedagogical and Technological
More informationarxiv: v2 [quant-ph] 2 Aug 2012
Qcomiler: quantum comilation with CSD method Y. G. Chen a, J. B. Wang a, a School of Physics, The University of Western Australia, Crawley WA 6009 arxiv:208.094v2 [quant-h] 2 Aug 202 Abstract In this aer,
More information0.6 Factoring 73. As always, the reader is encouraged to multiply out (3
0.6 Factoring 7 5. The G.C.F. of the terms in 81 16t is just 1 so there is nothing of substance to factor out from both terms. With just a difference of two terms, we are limited to fitting this olynomial
More informationCOMPUTERS ORGANIZATION 2ND YEAR COMPUTE SCIENCE MANAGEMENT ENGINEERING UNIT 3 - ARITMETHIC-LOGIC UNIT JOSÉ GARCÍA RODRÍGUEZ JOSÉ ANTONIO SERRA PÉREZ
OMUTERS ORGANIZATION 2ND YEAR OMUTE SIENE MANAGEMENT ENGINEERING UNIT 3 - ARITMETHI-LOGI UNIT JOSÉ GARÍA RODRÍGUEZ JOSÉ ANTONIO SERRA ÉREZ Tema 3. La Unidad entral de roceso. A.L.U. Arithmetic Logic Unit
More informationChurilova Maria Saint-Petersburg State Polytechnical University Department of Applied Mathematics
Churilova Maria Saint-Petersburg State Polytechnical University Deartment of Alied Mathematics Technology of EHIS (staming) alied to roduction of automotive arts The roblem described in this reort originated
More informationINF2270 Spring Philipp Häfliger. Lecture 8: Superscalar CPUs, Course Summary/Repetition (1/2)
INF2270 Spring 2010 Philipp Häfliger Summary/Repetition (1/2) content From Scalar to Superscalar Lecture Summary and Brief Repetition Binary numbers Boolean Algebra Combinational Logic Circuits Encoder/Decoder
More informationPOINTS ON CONICS MODULO p
POINTS ON CONICS MODULO TEAM 2: JONGMIN BAEK, ANAND DEOPURKAR, AND KATHERINE REDFIELD Abstract. We comute the number of integer oints on conics modulo, where is an odd rime. We extend our results to conics
More informationCost/Performance Tradeoff of n-select Square Root Implementations
Australian Computer Science Communications, Vol.22, No.4, 2, pp.9 6, IEEE Comp. Society Press Cost/Performance Tradeoff of n-select Square Root Implementations Wanming Chu and Yamin Li Computer Architecture
More informationUniversal Finite Memory Coding of Binary Sequences
Deartment of Electrical Engineering Systems Universal Finite Memory Coding of Binary Sequences Thesis submitted towards the degree of Master of Science in Electrical and Electronic Engineering in Tel-Aviv
More informationEfficient Hardware Architecture of SEED S-box for Smart Cards
JOURNL OF SEMICONDUCTOR TECHNOLOY ND SCIENCE VOL.4 NO.4 DECEMBER 4 37 Efficient Hardware rchitecture of SEED S-bo for Smart Cards Joon-Ho Hwang bstract This aer resents an efficient architecture that otimizes
More informationFinite-State Verification or Model Checking. Finite State Verification (FSV) or Model Checking
Finite-State Verification or Model Checking Finite State Verification (FSV) or Model Checking Holds the romise of roviding a cost effective way of verifying imortant roerties about a system Not all faults
More informationarxiv: v3 [cs.lg] 9 Feb 2016
NEURAL RANDOM-ACCESS MACHINES Karol Kurach & Marcin Andrychowicz & Ilya Sutskever Google {kkurach,marcina,ilyasu}@google.com ABSTRACT arxiv:1511.06392v3 [cs.lg] 9 Feb 2016 In this aer, we roose and investigate
More informationCOMPARISON OF VARIOUS OPTIMIZATION TECHNIQUES FOR DESIGN FIR DIGITAL FILTERS
NCCI 1 -National Conference on Comutational Instrumentation CSIO Chandigarh, INDIA, 19- March 1 COMPARISON OF VARIOUS OPIMIZAION ECHNIQUES FOR DESIGN FIR DIGIAL FILERS Amanjeet Panghal 1, Nitin Mittal,Devender
More information2.6 Primitive equations and vertical coordinates
Chater 2. The continuous equations 2.6 Primitive equations and vertical coordinates As Charney (1951) foresaw, most NWP modelers went back to using the rimitive equations, with the hydrostatic aroximation,
More informationPretest (Optional) Use as an additional pacing tool to guide instruction. August 21
Trimester 1 Pretest (Otional) Use as an additional acing tool to guide instruction. August 21 Beyond the Basic Facts In Trimester 1, Grade 7 focus on multilication. Daily Unit 1: The Number System Part
More informationMATHEMATICAL MODELLING OF THE WIRELESS COMMUNICATION NETWORK
Comuter Modelling and ew Technologies, 5, Vol.9, o., 3-39 Transort and Telecommunication Institute, Lomonosov, LV-9, Riga, Latvia MATHEMATICAL MODELLIG OF THE WIRELESS COMMUICATIO ETWORK M. KOPEETSK Deartment
More information