Part III The Arithmetic/Logic Unit. Oct Computer Architecture, The Arithmetic/Logic Unit Slide 1
|
|
- Arleen Doyle
- 5 years ago
- Views:
Transcription
1 Part III The Arithmetic/Logic Unit Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 1
2 About This Presentation This presentation is intended to support the use of the textbook Computer Architecture: From Microprocessors to Supercomputers, Oxford University Press, 25, ISBN X. It is updated regularly by the author as part of his teaching of the upper-division course ECE 154, Introduction to Computer Architecture, at the University of California, Santa Barbara. Instructors can use these slides freely in classroom teaching and for other educational purposes. Any other use is strictly prohibited. Behrooz Parhami Edition Released Revised Revised Revised Revised First July 23 July 24 July 25 Mar. 26 Jan. 27 Jan. 28 Jan. 29 Jan. 211 Oct. 214 Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 2
3 III The Arithmetic/Logic Unit Overview of computer arithmetic and ALU design: Review representation methods for signed integers Discuss algorithms & hardware for arithmetic ops Consider floating-point representation & arithmetic Topics in This Part Chapter 9 Chapter 1 Chapter 11 Chapter 12 Number Representation Adders and Simple ALUs Multipliers and Dividers Floating-Point Arithmetic Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 3
4 Preview of Arithmetic Unit in the Data Path Incr PC Next PC PC Next addr (PC) Instr cache inst jta rd 31 imm rs rt 1 2 Reg file / 16 (rs) (rt) 32 SE / 1 ALUOvfl Ovfl ALU Func ALU out Data addr Data in Data cache Register writeback Data out 1 2 op fn Register input Br&Jump RegDst RegWrite ALUSrc ALUFunc DataRead DataWrite RegInSrc Instruction fetch Reg access / decode ALU operation Data access Fig Key elements of the single-cycle MicroMIPS data path. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 4
5 9 Number Representation Arguably the most important topic in computer arithmetic: Affects system compatibility and ease of arithmetic Two s complement, flp, and unconventional methods Topics in This Chapter 9.1 Positional Number Systems 9.2 Digit Sets and Encodings 9.3 Number-Radix Conversion 9.4 Signed Integers 9.5 Fixed-Point Numbers 9.6 Floating-Point Numbers Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 5
6 Unsigned Binary Integers Turn x notches counterclockwise to add x Inside: Natural number Outside: 4-bit encoding Turn y notches clockwise to subtract y Figure 9.1 Schematic representation of 4-bit code for integers in [, 15]. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 6
7 9.2 Digit Sets and Encodings Conventional and unconventional digit sets Decimal digits in [, 9]; 4-bit BCD, 8-bit ASCII Hexadecimal, or hex for short: digits -9 & a-f Conventional ternary digit set in [, 2] Conventional digit set for radix r is [, r 1] Symmetric ternary digit set in [ 1, 1] Conventional binary digit set in [, 1] Redundant digit set [, 2], encoded in 2 bits ( ) two and ( ) two represent 22 Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 7
8 9.4 Signed Integers We dealt with representing the natural numbers Signed or directed whole numbers = integers {..., -3, -2, -1,, 1, 2, 3,... } Signed-magnitude representation +27 in 8-bit signed-magnitude binary code in 8-bit signed-magnitude binary code in 2-digit decimal code with BCD digits Biased representation Represent the interval of numbers [-N, P] by the unsigned interval [, P + N]; i.e., by adding N to every number Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 8
9 Two s-complement Representation With k bits, numbers in the range [ 2 k 1, 2 k 1 1] represented. Negation is performed by inverting all bits and adding Turn x notches counterclockwise to add x _ Turn 16 y notches counterclockwise to add y (subtract y) Figure 9.5 Schematic representation of 4-bit 2 s-complement code for integers in [ 8, +7]. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 9
10 Two s-complement Addition and Subtraction x k / c in Adder k / x y y k / Add Sub k / y or y c out Figure 9.6 Binary adder used as 2 s-complement adder/subtractor. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 1
11 9.5 Fixed-Point Numbers Positional representation: k whole and l fractional digits Value of a number: x = (x k 1 x k 2... x 1 x. x 1 x 2... x l ) r = S x i r i For example: = (1.11) two = (1 2 1 ) + ( 2 ) + ( 2-1 ) + (1 2-2 ) + (1 2-3 ) Numbers in the range [, r k ulp] representable, where ulp = r l Fixed-point arithmetic same as integer arithmetic (radix point implied, not explicit) Two s complement properties (including sign change) hold here as well: (1.11) 2 s-compl = ( 2 1 ) + (1 2 ) + ( 2 1 ) + (1 2 2 ) + (1 2 3 ) = (11.11) 2 s-compl = ( ) + (1 2 ) + ( 2 1 ) + (1 2 2 ) + (1 2 3 ) =.625 Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 11
12 Fixed-Point 2 s-complement Numbers _ Figure 9.7 Schematic representation of 4-bit 2 s-complement encoding for (1 + 3)-bit fixed-point numbers in the range [ 1, +7/8]. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 12
13 9.6 Floating-Point Numbers Useful for applications where very large and very small numbers are needed simultaneously Fixed-point representation must sacrifice precision for small values to represent large values x = (. 11) two Small number y = (11. ) two Large number Neither y 2 nor y / x is representable in the format above Floating-point representation is like scientific notation: -2 = = Sign Significand Exponent base Exponent Also, 7E-9 Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 13
14 ANSI/IEEE Standard Floating-Point Format (IEEE 754) Revision (IEEE 754R) was completed in 28: The revised version includes 16-bit and 128-bit binary formats, as well as 64- and 128-bit decimal formats 8 bits, bias = 127, 126 to 127 Short (32-bit) format 23 bits for fractional part (plus hidden 1 in integer part) Short exponent range is 127 to 128 but the two extreme values are reserved for special operands (similarly for the long format) Sign Exponent 11 bits, bias = 123, 122 to 123 Significand 52 bits for fractional part (plus hidden 1 in integer part) Long (64-bit) format Figure 9.8 The two ANSI/IEEE standard floating-point formats. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 14
15 1 Adders and Simple ALUs Addition is the most important arith operation in computers: Even the simplest computers must have an adder An adder, plus a little extra logic, forms a simple ALU Topics in This Chapter 1.1 Simple Adders 1.2 Carry Propagation Networks 1.3 Counting and Incrementation 1.4 Design of Fast Adders 1.5 Logic and Shift Operations 1.6 Multifunction ALUs Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 15
16 1.1 Simple Adders Inputs Outputs x y c s c x s HA y Digit-set interpretation: {, 1} + {, 1} = {, 2} + {, 1} Inputs x y c in c out s x y Figures 1.1/1.2 Outputs c out FA s Binary half-adder (HA) and full-adder (FA). c in Digit-set interpretation: {, 1} + {, 1} + {, 1} = {, 2} + {, 1} Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 16
17 Ripple-Carry Adder: Slow But Simple x 31 y 31 x y 1 1 x y c 32 c out c 31 c 2 c 1 FA... FA FA Critical path c c in s 31 s 1 s Figure 1.4 Ripple-carry binary adder with 32-bit inputs and output. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 17
18 1.2 Carry Propagation Networks g i p i Carry is: x i y i annihilated or killed propagated generated (impossible) g i = x i y i p i = x i y i g k-1 p k-1 g k-2 p k-2 g i+1 p i g i p i g 1 p 1 g p c Carry network c k c k-1 c k c i+1 c i c 1 c Figure 1.5 The main part of an adder is the carry network. The rest is just a set of gates to produce the g and p signals and the sum bits. s i Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 18
19 1.4 Design of Fast Adders Carries can be computed directly without propagation For example, by unrolling the equation for c 3, we get: c 3 = g 2 p 2 c 2 = g 2 p 2 g 1 p 2 p 1 g p 2 p 1 p c We define generate and propagate signals for a block extending from bit position a to bit position b as follows: g [a,b] = g b p b g b 1 p b p b 1 g b 2... p b p b 1 p a+1 g a p [a,b] = p b p b 1... p a+1 p a Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 19
20 Carry-Lookahead Logic with 4-Bit Block p i+3 g i+3 p i+2 g i+2 p i+1 g i+1 p i g i c i p [i, i+3] g [i, i+3] Block signal generation Intermeidte carries c i+3 c i+2 c i+1 Figure 1.13 Blocks needed in the design of carry-lookahead adders with four-way grouping of bits. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 2
21 Carry Look-Ahead Adder 418_4 21
22 16-bit CLA Adder 418_4 22
23 1.5 Logic and Shift Operations Conceptually, shifts can be implemented by multiplexing Right Left, x[3, 2] Shift amount, x[31, 1] 5 x[31, ] 6 6-bit code specifying shift direction & amount Right-shifted values..., x[31] x[3, ], x[31, ] Multiplexer x[1, ], Left-shifted values x[], Figure 1.15 Multiplexer-based logical shifting unit. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 23
24 Arithmetic Shifts Purpose: Multiplication and division by powers of 2 sra $t,$s1,2 # $t ($s1) right-shifted by 2 srav $t,$s1,$s # $t ($s1) right-shifted by ($s) R op rs rt ALU instruction Unused Source register rd Destination register sh Shift amount fn sra = R op rs rt ALU instruction Amount register Source register rd Destination register sh fn 1 Unused srav = Figure 1.16 The two arithmetic shift instructions of MiniMIPS. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 24
25 Practical Shifting in Multiple Stages No shift 1 Logical left 1 Logical right 1 1 Arith right 2 x[31, ] x[3, ],, x[31, 1] Multiplexer 32 x[31], x[31, 1] ( or 4)-bit shift y[31, ] ( or 2)-bit shift z[31, ] ( or 1)-bit shift (a) Single-bit shifter (b) Shifting by up to 7 bits Figure 1.17 Multistage shifting in a barrel shifter. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 25
26 1.6 Multifunction ALUs Arith fn (add, sub,...) Operand 1 Arith unit Result Operand 2 Logic unit 1 Select fn type (logic or arith) Logic fn (AND, OR,...) General structure of a simple arithmetic/logic unit. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 26
27 Constant amount Variable amount Const Var 5 Amount Shift function 2 Shifter No shift 1 Logical left 1 Logical right 11 Arith right Function class Shift 1 Set less 1 Arithmetic 11 Logic An ALU for MiniMIPS 5 LSBs Shifted y 2 x y Add Sub k / c Adder c c x y 32 or 1 MSB s x Shorthand symbol for ALU Control Func ALU s AND OR 1 XOR 1 NOR 11 Logic unit 2 Logic function 32- input NOR Figure 1.19 A multifunction ALU with 8 control signals (2 for function class, 1 arithmetic, 3 shift, 2 logic) specifying the operation. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 27 Zero Ovfl y Ovfl Zero
28 11 Multipliers and Dividers Modern processors perform many multiplications & divisions: Encryption, image compression, graphic rendering Hardware vs programmed shift-add/sub algorithms Topics in This Chapter 11.1 Shift-Add Multiplication 11.2 Hardware Multipliers 11.3 Programmed Multiplication 11.4 Shift-Subtract Division 11.5 Hardware Dividers Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 28
29 Figure Shift-Add Multiplication Multiplicand Multiplier Partial products bit-matrix Product Multiplication of 4-bit numbers in dot notation. x y y x 2 y x y x 22 2 y x 23 3 z Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 29
30 11.2 Hardware Multipliers Shift Multiplier y Doublewidth partial product z Shift Multiplicand x (j) 1 Mux Enable Select y j c out Adder c in Add Sub Figure 11.4 Hardware multiplier based on the shift-add algorithm. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 3
31 Array Multipliers x 3 MA MA MA MA FA s Figure 11.7 x x x 2 1 MA z c MA MA MA FA 7 MA MA MA MA FA z 6 MA MA MA MA HA z 5 y y y y z z z z z Array multiplier for 4-bit unsigned operands Our original dot-notation representing multiplication Straightened dots to depict array multiplier to the left Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 31
32 11.3 Programmed Multiplication MiniMIPS instructions related to multiplication mult $s,$s1 # set Hi,Lo to ($s) ($s1); signed multu $s2,$s3 # set Hi,Lo to ($s2) ($s3); unsigned mfhi $t # set $t to (Hi) mflo $t1 # set $t1 to (Lo) Example 11.3 Finding the 32-bit product of 32-bit integers in MiniMIPS Multiply; result will be obtained in Hi,Lo For unsigned multiplication: Hi should be all-s and Lo holds the 32-bit result For signed multiplication: Hi should be all-s or all-1s, depending on the sign bit of Lo Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 32
33 11.4 Shift-Subtract Division x Divisor Subtracted bit-matrix y Quotient z Dividend y x 23 3 y x 22 2 y x 21 1 y x 2 s Remainder Figure11.9 Division of an 8-bit number by a 4-bit number in dot notation. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 33
34 11.5 Hardware Dividers Quotient y Partial remainder z (j) (initially z) Divisor x Shift Shift y k j Load Quotient digit selector Mux 1 Enable Select 1 c out Trial difference Adder c in 1 (Always subtract) Figure Hardware divider based on the shift-subtract algorithm. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 34
35 Array Dividers y 3 z 7 x 3 MS z 6 x x x 2 1 z 5 z 4 MS MS MS z 3 y 2 y 1 MS MS b d MS MS MS MS MS MS z 2 z 1 Our original dot-notation for division y s 3 MS MS MS s 2 s 1 s MS z Straightened dots to depict an array divider Figure Array divider for 8/4-bit unsigned integers. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 35
36 12 Floating-Point Arithmetic Floating-point is no longer reserved for high-end machines Multimedia and signal processing require flp arithmetic Details of standard flp format and arithmetic operations Topics in This Chapter 12.2 Special Values and Exceptions 12.3 Floating-Point Addition 12.4 Other Floating-Point Operations 12.6 Result Precision and Errors Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 36
37 ANSI/IEEE Standard Floating-Point Format (IEEE 754) Revision (IEEE 754R) was completed in 28: The revised version includes 16-bit and 128-bit binary formats, as well as 64- and 128-bit decimal formats 8 bits, bias = 127, 126 to 127 Short (32-bit) format 23 bits for fractional part (plus hidden 1 in integer part) Short exponent range is 127 to 128 but the two extreme values are reserved for special operands (similarly for the long format) Sign Exponent 11 bits, bias = 123, 122 to 123 Significand 52 bits for fractional part (plus hidden 1 in integer part) Long (64-bit) format Figure 9.8 The two ANSI/IEEE standard floating-point formats. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 37
38 12.2 Special Values and Exceptions Zeros, infinities, and NaNs (not a number) Biased exponent =, significand = (no hidden 1) Biased exponent = 255 (short) or 247 (long), significand = NaN Biased exponent = 255 (short) or 247 (long), significand Arithmetic operations with special operands (+) + (+) = (+) ( ) = + (+) (+5) = + (+) / ( 5) = (+ ) + (+ ) = + x (+ ) = (+ ) x =, depending on the sign of x x / (+ ) =, depending on the sign of x (+ ) = + Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 38
39 12.3 Floating-Point Addition Numbers to be added: x = y = Operands after alignment shift: x = y = Operand with smaller exponent to be preshifted Extra bits to be rounded off Result of addition: s = s = Rounded sum Figure 12.4 Alignment shift and rounding in floating-point addition. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 39
40 Hardware for Floating-Point Addition Add Sub Signs Input 1 Exponents Unpack Input 2 Significands Mux Sub Possible swap & complement Control & sign logic Align significands Add Normalize & round Figure 12.5 Simplified schematic of a floating-point adder. Sign Exponent Pack Significand Output Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 4
41 12.4 Other Floating-Point Operations Floating-point multiplication ( 2 e1 s1) ( 2 e2 s2) = 2 e1+ e2 (s1 s2) Product of significands in [1, 4) If product is in [2, 4), halve to normalize (increment exponent) Floating-point division ( 2 e1 s1) / ( 2 e2 s2) = 2 e1 e2 (s1 / s2) Ratio of significands in (1/2, 2) If ratio is in (1/2, 1), double to normalize (decrement exponent) Floating-point square-rooting (2 e s) 1/2 = 2 e/2 (s) 1/2 when e is even = 2 (e 1)2 (2s) 1/2 when e is odd Normalization not needed Overflow (underflow) possible Overflow (underflow) possible Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 41
42 Hardware for Floating-Point Multiplication and Division Figure 12.6 Simplified schematic of a floatingpoint multiply/divide unit. Mul Div Signs Control & sign logic Sign Input 1 Exponents Exponent Unpack Pack Output Input 2 Significands Multiply or divide Normalize & round Significand Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 42
43 The Floating-Point Unit in MiniMIPS Loc Loc 4 Loc 8 4 B / location... Memory up to 2 3 words... m 2 32 Loc m - 8 Loc m - 4 Coprocessor 1 EIU (Main proc.) ALU $ $1 $2 $31 Execution & integer unit Integer mul/div FPU (Coproc. 1) FP arith $ $1 $2 $31 Floatingpoint unit Pairs of registers, beginning with an even-numbered one, are used for double operands Chapter 1 Figure 5.1 Chapter 11 Hi Lo Chapter 12 TMU (Coproc. ) BadVaddr Status Cause Memory and processing subsystems for MiniMIPS. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 43 EPC Trap & memory unit
44 12.6 Result Precision and Errors Example 12.4 Laws of algebra may not hold in floating-point arithmetic. For example, the following computations show that the associative law of addition, (a + b) + c = a + (b + c), is violated for the three numbers shown. Numbers to be added first a = b = Compute a + b a+b = c = Compute (a + b) + c Sum = Numbers to be added first b = c = Compute b + c (after preshifting c) b+c = (Round) a = Compute a + (b + c) 25. Sum = (Normalize to special code for ) Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 44
45 Evaluation of Elementary Functions Approximating polynomials ln x = 2(z + z 3 /3 + z 5 /5 + z 7 / ) where z = (x 1)/(x + 1) e x = 1 + x/1! + x 2 /2! + x 3 /3! + x 4 /4! +... cos x = 1 x 2 /2! + x 4 /4! x 6 /6! + x 8 /8!... tan 1 x = x x 3 /3 + x 5 /5 x 7 /7 + x 9 /9... Iterative (convergence) schemes For example, beginning with an estimate for x 1/2, the following iterative formula provides a more accurate estimate in each step q (i+1) =.5(q (i) + x/q (i) ) Table lookup (with interpolation) A pure table lookup scheme results in huge tables (impractical); hence, often a hybrid approach, involving interpolation, is used. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 45
46 Function Evaluation by Table Lookup Input x h bits x H k - h bits x L x L f(x) Table for a Table for b Multiply Best linear approximation in subinterval x x H Add Output f(x) The linear approximation above is characterized by the line equation a + b x L, where a and b are read out from tables based on x H Figure Function evaluation by table lookup and linear interpolation. Oct. 214 Computer Architecture, The Arithmetic/Logic Unit Slide 46
MIPS Integer ALU Requirements
MIPS Integer ALU Requirements Add, AddU, Sub, SubU, AddI, AddIU: 2 s complement adder/sub with overflow detection. And, Or, Andi, Ori, Xor, Xori, Nor: Logical AND, logical OR, XOR, nor. SLTI, SLTIU (set
More informationReview: MIPS Organization
1 MIPS Arithmetic Review: MIPS Organization Processor Memory src1 addr 5 src2 addr 5 dst addr 5 write data Register File registers ($zero - $ra) bits src1 data src2 data read/write addr 1 1100 2 30 words
More informationTailoring the 32-Bit ALU to MIPS
Tailoring the 32-Bit ALU to MIPS MIPS ALU extensions Overflow detection: Carry into MSB XOR Carry out of MSB Branch instructions Shift instructions Slt instruction Immediate instructions ALU performance
More informationNumber Systems and Computer Arithmetic
Number Systems and Computer Arithmetic Counting to four billion two fingers at a time What do all those bits mean now? bits (011011011100010...01) instruction R-format I-format... integer data number text
More informationDivide: Paper & Pencil
Divide: Paper & Pencil 1001 Quotient Divisor 1000 1001010 Dividend -1000 10 101 1010 1000 10 Remainder See how big a number can be subtracted, creating quotient bit on each step Binary => 1 * divisor or
More informationCPE300: Digital System Architecture and Design
CPE300: Digital System Architecture and Design Fall 2011 MW 17:30-18:45 CBC C316 Arithmetic Unit 10122011 http://www.egr.unlv.edu/~b1morris/cpe300/ 2 Outline Recap Fixed Point Arithmetic Addition/Subtraction
More informationEE260: Logic Design, Spring n Integer multiplication. n Booth s algorithm. n Integer division. n Restoring, non-restoring
EE 260: Introduction to Digital Design Arithmetic II Yao Zheng Department of Electrical Engineering University of Hawaiʻi at Mānoa Overview n Integer multiplication n Booth s algorithm n Integer division
More informationNumber Representation and Computer Arithmetic
Number Representation and Computer Arithmetic (B. Parhami / UCSB) 1 Number Representation and Computer Arithmetic Article to appear in Encyclopedia of Information Systems, Academic Press, 2001. ***********
More informationCOMPUTER ORGANIZATION AND DESIGN
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition Chapter 3 Arithmetic for Computers Arithmetic for Computers Operations on integers Addition and subtraction Multiplication
More informationThomas Polzer Institut für Technische Informatik
Thomas Polzer tpolzer@ecs.tuwien.ac.at Institut für Technische Informatik Operations on integers Addition and subtraction Multiplication and division Dealing with overflow Floating-point real numbers VO
More informationSigned Multiplication Multiply the positives Negate result if signs of operand are different
Another Improvement Save on space: Put multiplier in product saves on speed: only single shift needed Figure: Improved hardware for multiplication Signed Multiplication Multiply the positives Negate result
More informationComputer Organization and Structure. Bing-Yu Chen National Taiwan University
Computer Organization and Structure Bing-Yu Chen National Taiwan University Arithmetic for Computers Addition and Subtraction Gate Logic and K-Map Method Constructing a Basic ALU Arithmetic Logic Unit
More informationInteger Multiplication and Division
Integer Multiplication and Division COE 301 Computer Organization Prof. Muhamed Mudawar College of Computer Sciences and Engineering King Fahd University of Petroleum and Minerals Presentation Outline
More informationHomework 3. Assigned on 02/15 Due time: midnight on 02/21 (1 WEEK only!) B.2 B.11 B.14 (hint: use multiplexors) CSCI 402: Computer Architectures
Homework 3 Assigned on 02/15 Due time: midnight on 02/21 (1 WEEK only!) B.2 B.11 B.14 (hint: use multiplexors) 1 CSCI 402: Computer Architectures Arithmetic for Computers (2) Fengguang Song Department
More informationECE331: Hardware Organization and Design
ECE331: Hardware Organization and Design Lecture 10: Multiplication & Floating Point Representation Adapted from Computer Organization and Design, Patterson & Hennessy, UCB MIPS Division Two 32-bit registers
More informationComputer Architecture Chapter 3. Fall 2005 Department of Computer Science Kent State University
Computer Architecture Chapter 3 Fall 2005 Department of Computer Science Kent State University Objectives Signed and Unsigned Numbers Addition and Subtraction Multiplication and Division Floating Point
More informationCOMPUTER ORGANIZATION AND DESIGN. 5 th Edition. The Hardware/Software Interface. Chapter 3. Arithmetic for Computers Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition Chapter 3 Arithmetic for Computers Implementation Today Review representations (252/352 recap) Floating point Addition: Ripple
More informationKinds Of Data CHAPTER 3 DATA REPRESENTATION. Numbers Are Different! Positional Number Systems. Text. Numbers. Other
Kinds Of Data CHAPTER 3 DATA REPRESENTATION Numbers Integers Unsigned Signed Reals Fixed-Point Floating-Point Binary-Coded Decimal Text ASCII Characters Strings Other Graphics Images Video Audio Numbers
More informationOrganisasi Sistem Komputer
LOGO Organisasi Sistem Komputer OSK 8 Aritmatika Komputer 1 1 PT. Elektronika FT UNY Does the calculations Arithmetic & Logic Unit Everything else in the computer is there to service this unit Handles
More informationCHW 261: Logic Design
CHW 261: Logic Design Instructors: Prof. Hala Zayed Dr. Ahmed Shalaby http://www.bu.edu.eg/staff/halazayed14 http://bu.edu.eg/staff/ahmedshalaby14# Slide 1 Slide 2 Slide 3 Digital Fundamentals CHAPTER
More informationModule 2: Computer Arithmetic
Module 2: Computer Arithmetic 1 B O O K : C O M P U T E R O R G A N I Z A T I O N A N D D E S I G N, 3 E D, D A V I D L. P A T T E R S O N A N D J O H N L. H A N N E S S Y, M O R G A N K A U F M A N N
More informationComputer Architecture. Chapter 3: Arithmetic for Computers
182.092 Computer Architecture Chapter 3: Arithmetic for Computers Adapted from Computer Organization and Design, 4 th Edition, Patterson & Hennessy, 2008, Morgan Kaufmann Publishers and Mary Jane Irwin
More informationArithmetic for Computers. Hwansoo Han
Arithmetic for Computers Hwansoo Han Arithmetic for Computers Operations on integers Addition and subtraction Multiplication and division Dealing with overflow Floating-point real numbers Representation
More informationVTU NOTES QUESTION PAPERS NEWS RESULTS FORUMS Arithmetic (a) The four possible cases Carry (b) Truth table x y
Arithmetic A basic operation in all digital computers is the addition and subtraction of two numbers They are implemented, along with the basic logic functions such as AND,OR, NOT,EX- OR in the ALU subsystem
More informationLecture 8: Addition, Multiplication & Division
Lecture 8: Addition, Multiplication & Division Today s topics: Signed/Unsigned Addition Multiplication Division 1 Signed / Unsigned The hardware recognizes two formats: unsigned (corresponding to the C
More informationNumber Systems Standard positional representation of numbers: An unsigned number with whole and fraction portions is represented as:
N Number Systems Standard positional representation of numbers: An unsigned number with whole and fraction portions is represented as: a n a a a The value of this number is given by: = a n Ka a a a a a
More informationFloating-Point Data Representation and Manipulation 198:231 Introduction to Computer Organization Lecture 3
Floating-Point Data Representation and Manipulation 198:231 Introduction to Computer Organization Instructor: Nicole Hynes nicole.hynes@rutgers.edu 1 Fixed Point Numbers Fixed point number: integer part
More informationChapter 3 Arithmetic for Computers. ELEC 5200/ From P-H slides
Chapter 3 Arithmetic for Computers 1 Arithmetic for Computers Operations on integers Addition and subtraction Multiplication and division Dealing with overflow Floating-point real numbers Representation
More informationTopics. 6.1 Number Systems and Radix Conversion 6.2 Fixed-Point Arithmetic 6.3 Seminumeric Aspects of ALU Design 6.4 Floating-Point Arithmetic
6-1 Chapter 6 Computer Arithmetic and the Arithmetic Unit Chapter 6: Computer Arithmetic and the Arithmetic Unit Topics 6.1 Number Systems and Radix Conversion 6.2 Fixed-Point Arithmetic 6.3 Seminumeric
More informationCO212 Lecture 10: Arithmetic & Logical Unit
CO212 Lecture 10: Arithmetic & Logical Unit Shobhanjana Kalita, Dept. of CSE, Tezpur University Slides courtesy: Computer Architecture and Organization, 9 th Ed, W. Stallings Integer Representation For
More informationNumber Systems and Their Representations
Number Representations Cptr280 Dr Curtis Nelson Number Systems and Their Representations In this presentation you will learn about: Representation of numbers in computers; Signed vs. unsigned numbers;
More informationCPE 323 REVIEW DATA TYPES AND NUMBER REPRESENTATIONS IN MODERN COMPUTERS
CPE 323 REVIEW DATA TYPES AND NUMBER REPRESENTATIONS IN MODERN COMPUTERS Aleksandar Milenković The LaCASA Laboratory, ECE Department, The University of Alabama in Huntsville Email: milenka@uah.edu Web:
More informationChapter 3. Arithmetic Text: P&H rev
Chapter 3 Arithmetic Text: P&H rev3.29.16 Arithmetic for Computers Operations on integers Addition and subtraction Multiplication and division Dealing with overflow Floating-point real numbers Representation
More informationBy, Ajinkya Karande Adarsh Yoga
By, Ajinkya Karande Adarsh Yoga Introduction Early computer designers believed saving computer time and memory were more important than programmer time. Bug in the divide algorithm used in Intel chips.
More informationChapter 3 Arithmetic for Computers (Part 2)
Department of Electr rical Eng ineering, Chapter 3 Arithmetic for Computers (Part 2) 王振傑 (Chen-Chieh Wang) ccwang@mail.ee.ncku.edu.tw ncku edu Depar rtment of Electr rical Eng ineering, Feng-Chia Unive
More informationAt the ith stage: Input: ci is the carry-in Output: si is the sum ci+1 carry-out to (i+1)st state
Chapter 4 xi yi Carry in ci Sum s i Carry out c i+ At the ith stage: Input: ci is the carry-in Output: si is the sum ci+ carry-out to (i+)st state si = xi yi ci + xi yi ci + xi yi ci + xi yi ci = x i yi
More informationChapter 3: part 3 Binary Subtraction
Chapter 3: part 3 Binary Subtraction Iterative combinational circuits Binary adders Half and full adders Ripple carry and carry lookahead adders Binary subtraction Binary adder-subtractors Signed binary
More informationFloating Point. The World is Not Just Integers. Programming languages support numbers with fraction
1 Floating Point The World is Not Just Integers Programming languages support numbers with fraction Called floating-point numbers Examples: 3.14159265 (π) 2.71828 (e) 0.000000001 or 1.0 10 9 (seconds in
More informationCPE 323 REVIEW DATA TYPES AND NUMBER REPRESENTATIONS IN MODERN COMPUTERS
CPE 323 REVIEW DATA TYPES AND NUMBER REPRESENTATIONS IN MODERN COMPUTERS Aleksandar Milenković The LaCASA Laboratory, ECE Department, The University of Alabama in Huntsville Email: milenka@uah.edu Web:
More informationChapter 2 Data Representations
Computer Engineering Chapter 2 Data Representations Hiroaki Kobayashi 4/21/2008 4/21/2008 1 Agenda in Chapter 2 Translation between binary numbers and decimal numbers Data Representations for Integers
More informationCENG3420 L05: Arithmetic and Logic Unit
CENG3420 L05: Arithmetic and Logic Unit Bei Yu byu@cse.cuhk.edu.hk (Latest update: January 25, 2018) Spring 2018 1 / 53 Overview Overview Addition Multiplication & Division Shift Floating Point Number
More informationComputer Architecture Set Four. Arithmetic
Computer Architecture Set Four Arithmetic Arithmetic Where we ve been: Performance (seconds, cycles, instructions) Abstractions: Instruction Set Architecture Assembly Language and Machine Language What
More informationNumeric Encodings Prof. James L. Frankel Harvard University
Numeric Encodings Prof. James L. Frankel Harvard University Version of 10:19 PM 12-Sep-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved. Representation of Positive & Negative Integral and
More informationCENG 3420 Lecture 05: Arithmetic and Logic Unit
CENG 3420 Lecture 05: Arithmetic and Logic Unit Bei Yu byu@cse.cuhk.edu.hk CENG3420 L05.1 Spring 2017 Outline q 1. Overview q 2. Addition q 3. Multiplication & Division q 4. Shift q 5. Floating Point Number
More informationCOMPUTER ORGANIZATION AND DESIGN. 5 th Edition. The Hardware/Software Interface. Chapter 3. Arithmetic for Computers
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition Chapter 3 Arithmetic for Computers Boolean Algebra Boolean algebra is the basic math used in digital circuits and computers.
More informationFloating Point Arithmetic
Floating Point Arithmetic CS 365 Floating-Point What can be represented in N bits? Unsigned 0 to 2 N 2s Complement -2 N-1 to 2 N-1-1 But, what about? very large numbers? 9,349,398,989,787,762,244,859,087,678
More informationChapter 3 Arithmetic for Computers
Chapter 3 Arithmetic for Computers 1 Outline Signed and unsigned numbers (Sec. 3.2) Addition and subtraction (Sec. 3.3) Multiplication (Sec. 3.4) Division (Sec. 3.5) Floating point (Sec. 3.6) 2 Representation
More informationUNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Digital Computer Arithmetic ECE 666
UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Digital Computer Arithmetic ECE 666 Part 4-A Floating-Point Arithmetic Israel Koren ECE666/Koren Part.4a.1 Preliminaries - Representation
More informationData Representations & Arithmetic Operations
Data Representations & Arithmetic Operations Hiroaki Kobayashi 7/13/2011 7/13/2011 Computer Science 1 Agenda Translation between binary numbers and decimal numbers Data Representations for Integers Negative
More informationMIPS ISA. 1. Data and Address Size 8-, 16-, 32-, 64-bit 2. Which instructions does the processor support
Components of an ISA EE 357 Unit 11 MIPS ISA 1. Data and Address Size 8-, 16-, 32-, 64-bit 2. Which instructions does the processor support SUBtract instruc. vs. NEGate + ADD instrucs. 3. Registers accessible
More informationCOMP2611: Computer Organization. Data Representation
COMP2611: Computer Organization Comp2611 Fall 2015 2 1. Binary numbers and 2 s Complement Numbers 3 Bits: are the basis for binary number representation in digital computers What you will learn here: How
More informationInteger Arithmetic. Jinkyu Jeong Computer Systems Laboratory Sungkyunkwan University
Integer Arithmetic Jinkyu Jeong (jinkyu@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu EEE3050: Theory on Computer Architectures, Spring 2017, Jinkyu Jeong (jinkyu@skku.edu)
More informationFloating-Point Arithmetic
ENEE446---Lectures-4/10-15/08 A. Yavuz Oruç Professor, UMD, College Park Copyright 2007 A. Yavuz Oruç. All rights reserved. Floating-Point Arithmetic Integer or fixed-point arithmetic provides a complete
More informationECE 30 Introduction to Computer Engineering
ECE 30 Introduction to Computer Engineering Study Problems, Set #6 Spring 2015 1. With x = 1111 1111 1111 1111 1011 0011 0101 0011 2 and y = 0000 0000 0000 0000 0000 0010 1101 0111 2 representing two s
More informationFloating-point Arithmetic. where you sum up the integer to the left of the decimal point and the fraction to the right.
Floating-point Arithmetic Reading: pp. 312-328 Floating-Point Representation Non-scientific floating point numbers: A non-integer can be represented as: 2 4 2 3 2 2 2 1 2 0.2-1 2-2 2-3 2-4 where you sum
More informationECE331: Hardware Organization and Design
ECE331: Hardware Organization and Design Lecture 15: Midterm 1 Review Adapted from Computer Organization and Design, Patterson & Hennessy, UCB Basics Midterm to cover Book Sections (inclusive) 1.1 1.5
More informationInteger Multiplication. Back to Arithmetic. Integer Multiplication. Example (Fig 4.25)
Back to Arithmetic Before, we did Representation of integers Addition/Subtraction Logical ops Forecast Integer Multiplication Integer Division Floating-point Numbers Floating-point Addition/Multiplication
More informationCSE 141 Computer Architecture Summer Session Lecture 3 ALU Part 2 Single Cycle CPU Part 1. Pramod V. Argade
CSE 141 Computer Architecture Summer Session 1 2004 Lecture 3 ALU Part 2 Single Cycle CPU Part 1 Pramod V. Argade Reading Assignment Announcements Chapter 5: The Processor: Datapath and Control, Sec. 5.3-5.4
More informationCOMP 303 Computer Architecture Lecture 6
COMP 303 Computer Architecture Lecture 6 MULTIPLY (unsigned) Paper and pencil example (unsigned): Multiplicand 1000 = 8 Multiplier x 1001 = 9 1000 0000 0000 1000 Product 01001000 = 72 n bits x n bits =
More informationChapter 10 - Computer Arithmetic
Chapter 10 - Computer Arithmetic Luis Tarrataca luis.tarrataca@gmail.com CEFET-RJ L. Tarrataca Chapter 10 - Computer Arithmetic 1 / 126 1 Motivation 2 Arithmetic and Logic Unit 3 Integer representation
More information5DV118 Computer Organization and Architecture Umeå University Department of Computing Science Stephen J. Hegner. Topic 3: Arithmetic
5DV118 Computer Organization and Architecture Umeå University Department of Computing Science Stephen J. Hegner Topic 3: Arithmetic These slides are mostly taken verbatim, or with minor changes, from those
More informationArithmetic for Computers
MIPS Arithmetic Instructions Cptr280 Dr Curtis Nelson Arithmetic for Computers Operations on integers Addition and subtraction; Multiplication and division; Dealing with overflow; Signed vs. unsigned numbers.
More information10.1. Unit 10. Signed Representation Systems Binary Arithmetic
0. Unit 0 Signed Representation Systems Binary Arithmetic 0.2 BINARY REPRESENTATION SYSTEMS REVIEW 0.3 Interpreting Binary Strings Given a string of s and 0 s, you need to know the representation system
More informationChapter 2 Float Point Arithmetic. Real Numbers in Decimal Notation. Real Numbers in Decimal Notation
Chapter 2 Float Point Arithmetic Topics IEEE Floating Point Standard Fractional Binary Numbers Rounding Floating Point Operations Mathematical properties Real Numbers in Decimal Notation Representation
More informationLecture 13: (Integer Multiplication and Division) FLOATING POINT NUMBERS
Lecture 13: (Integer Multiplication and Division) FLOATING POINT NUMBERS Lecture 13 Floating Point I (1) Fall 2005 Integer Multiplication (1/3) Paper and pencil example (unsigned): Multiplicand 1000 8
More informationD I G I T A L C I R C U I T S E E
D I G I T A L C I R C U I T S E E Digital Circuits Basic Scope and Introduction This book covers theory solved examples and previous year gate question for following topics: Number system, Boolean algebra,
More informationBoolean Algebra. Chapter 3. Boolean Algebra. Chapter 3 Arithmetic for Computers 1. Fundamental Boolean Operations. Arithmetic for Computers
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition Chapter 3 Arithmetic for Computers Arithmetic
More informationEE878 Special Topics in VLSI. Computer Arithmetic for Digital Signal Processing
EE878 Special Topics in VLSI Computer Arithmetic for Digital Signal Processing Part 4-B Floating-Point Arithmetic - II Spring 2017 Koren Part.4b.1 The IEEE Floating-Point Standard Four formats for floating-point
More informationEC2303-COMPUTER ARCHITECTURE AND ORGANIZATION
EC2303-COMPUTER ARCHITECTURE AND ORGANIZATION QUESTION BANK UNIT-II 1. What are the disadvantages in using a ripple carry adder? (NOV/DEC 2006) The main disadvantage using ripple carry adder is time delay.
More informationDigital Logic & Computer Design CS Professor Dan Moldovan Spring 2010
Digital Logic & Computer Design CS 434 Professor Dan Moldovan Spring 2 Copyright 27 Elsevier 5- Chapter 5 :: Digital Building Blocks Digital Design and Computer Architecture David Money Harris and Sarah
More informationChapter 3: Arithmetic for Computers
Chapter 3: Arithmetic for Computers Objectives Signed and Unsigned Numbers Addition and Subtraction Multiplication and Division Floating Point Computer Architecture CS 35101-002 2 The Binary Numbering
More informationFloating-point representations
Lecture 10 Floating-point representations Methods of representing real numbers (1) 1. Fixed-point number system limited range and/or limited precision results must be scaled 100101010 1111010 100101010.1111010
More informationReview: MULTIPLY HARDWARE Version 1. ECE4680 Computer Organization & Architecture. Divide, Floating Point, Pentium Bug
ECE468 ALU-III.1 2002-2-27 Review: MULTIPLY HARDWARE Version 1 ECE4680 Computer Organization & Architecture 64-bit Multiplicand reg, 64-bit ALU, 64-bit Product reg, 32-bit multiplier reg Divide, Floating
More informationFloating-point representations
Lecture 10 Floating-point representations Methods of representing real numbers (1) 1. Fixed-point number system limited range and/or limited precision results must be scaled 100101010 1111010 100101010.1111010
More informationUNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Digital Computer Arithmetic ECE 666
UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Digital Computer Arithmetic ECE 666 Part 4-B Floating-Point Arithmetic - II Israel Koren ECE666/Koren Part.4b.1 The IEEE Floating-Point
More informationC NUMERIC FORMATS. Overview. IEEE Single-Precision Floating-point Data Format. Figure C-0. Table C-0. Listing C-0.
C NUMERIC FORMATS Figure C-. Table C-. Listing C-. Overview The DSP supports the 32-bit single-precision floating-point data format defined in the IEEE Standard 754/854. In addition, the DSP supports an
More informationECE232: Hardware Organization and Design
ECE232: Hardware Organization and Design Lecture 11: Floating Point & Floating Point Addition Adapted from Computer Organization and Design, Patterson & Hennessy, UCB Last time: Single Precision Format
More informationComputer Organisation CS303
Computer Organisation CS303 Module Period Assignments 1 Day 1 to Day 6 1. Write a program to evaluate the arithmetic statement: X=(A-B + C * (D * E-F))/G + H*K a. Using a general register computer with
More informationOutline. EEL-4713 Computer Architecture Multipliers and shifters. Deriving requirements of ALU. MIPS arithmetic instructions
Outline EEL-4713 Computer Architecture Multipliers and shifters Multiplication and shift registers Chapter 3, section 3.4 Next lecture Division, floating-point 3.5 3.6 EEL-4713 Ann Gordon-Ross.1 EEL-4713
More informationECE260: Fundamentals of Computer Engineering
Arithmetic for Computers James Moscola Dept. of Engineering & Computer Science York College of Pennsylvania Based on Computer Organization and Design, 5th Edition by Patterson & Hennessy Arithmetic for
More informationArray vs. Linked list Slowly changing size, order More often dynamically y( (rarely statically)
Array vs. Linked list Quickly changing size, order Slowly changing size, order More often dynamically y( (rarely statically) Could be allocated dynamically or statically Could be contiguous (when static)
More informationNUMBER OPERATIONS. Mahdi Nazm Bojnordi. CS/ECE 3810: Computer Organization. Assistant Professor School of Computing University of Utah
NUMBER OPERATIONS Mahdi Nazm Bojnordi Assistant Professor School of Computing University of Utah CS/ECE 3810: Computer Organization Overview Homework 4 is due tonight Verify your uploaded file before the
More informationBINARY SYSTEM. Binary system is used in digital systems because it is:
CHAPTER 2 CHAPTER CONTENTS 2.1 Binary System 2.2 Binary Arithmetic Operation 2.3 Signed & Unsigned Numbers 2.4 Arithmetic Operations of Signed Numbers 2.5 Hexadecimal Number System 2.6 Octal Number System
More informationChapter 4 Arithmetic Functions
Logic and Computer Design Fundamentals Chapter 4 Arithmetic Functions Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Overview Iterative combinational
More informationEECS150 - Digital Design Lecture 13 - Combinational Logic & Arithmetic Circuits Part 3
EECS15 - Digital Design Lecture 13 - Combinational Logic & Arithmetic Circuits Part 3 October 8, 22 John Wawrzynek Fall 22 EECS15 - Lec13-cla3 Page 1 Multiplication a 3 a 2 a 1 a Multiplicand b 3 b 2 b
More informationCS Computer Architecture. 1. Explain Carry Look Ahead adders in detail
1. Explain Carry Look Ahead adders in detail A carry-look ahead adder (CLA) is a type of adder used in digital logic. A carry-look ahead adder improves speed by reducing the amount of time required to
More informationChapter 5 : Computer Arithmetic
Chapter 5 Computer Arithmetic Integer Representation: (Fixedpoint representation): An eight bit word can be represented the numbers from zero to 255 including = 1 = 1 11111111 = 255 In general if an nbit
More informationMark Redekopp, All rights reserved. EE 352 Unit 3 MIPS ISA
EE 352 Unit 3 MIPS ISA Instruction Set Architecture (ISA) Defines the software interface of the processor and memory system Instruction set is the vocabulary the HW can understand and the SW is composed
More informationPrinciples of Computer Architecture. Chapter 3: Arithmetic
3-1 Chapter 3 - Arithmetic Principles of Computer Architecture Miles Murdocca and Vincent Heuring Chapter 3: Arithmetic 3-2 Chapter 3 - Arithmetic 3.1 Overview Chapter Contents 3.2 Fixed Point Addition
More information361 div.1. Computer Architecture EECS 361 Lecture 7: ALU Design : Division
361 div.1 Computer Architecture EECS 361 Lecture 7: ALU Design : Division Outline of Today s Lecture Introduction to Today s Lecture Divide Questions and Administrative Matters Introduction to Single cycle
More informationComputer Architecture and Organization
3-1 Chapter 3 - Arithmetic Computer Architecture and Organization Miles Murdocca and Vincent Heuring Chapter 3 Arithmetic 3-2 Chapter 3 - Arithmetic Chapter Contents 3.1 Fixed Point Addition and Subtraction
More informationNumber System. Introduction. Decimal Numbers
Number System Introduction Number systems provide the basis for all operations in information processing systems. In a number system the information is divided into a group of symbols; for example, 26
More informationCS 101: Computer Programming and Utilization
CS 101: Computer Programming and Utilization Jul-Nov 2017 Umesh Bellur (cs101@cse.iitb.ac.in) Lecture 3: Number Representa.ons Representing Numbers Digital Circuits can store and manipulate 0 s and 1 s.
More informationLecture Topics. Announcements. Today: Integer Arithmetic (P&H ) Next: continued. Consulting hours. Introduction to Sim. Milestone #1 (due 1/26)
Lecture Topics Today: Integer Arithmetic (P&H 3.1-3.4) Next: continued 1 Announcements Consulting hours Introduction to Sim Milestone #1 (due 1/26) 2 1 Overview: Integer Operations Internal representation
More informationFloating Point January 24, 2008
15-213 The course that gives CMU its Zip! Floating Point January 24, 2008 Topics IEEE Floating Point Standard Rounding Floating Point Operations Mathematical properties class04.ppt 15-213, S 08 Floating
More informationMark Redekopp, All rights reserved. EE 357 Unit 11 MIPS ISA
EE 357 Unit 11 MIPS ISA Components of an ISA 1. Data and Address Size 8-, 16-, 32-, 64-bit 2. Which instructions does the processor support SUBtract instruc. vs. NEGate + ADD instrucs. 3. Registers accessible
More informationTDT4255 Computer Design. Lecture 4. Magnus Jahre
1 TDT4255 Computer Design Lecture 4 Magnus Jahre 2 Chapter 3 Computer Arithmetic ti Acknowledgement: Slides are adapted from Morgan Kaufmann companion material 3 Arithmetic for Computers Operations on
More informationReview of Last lecture. Review ALU Design. Designing a Multiplier Shifter Design Review. Booth s algorithm. Today s Outline
Today s Outline San Jose State University EE176-SJSU Computer Architecture and Organization Lecture 5 HDL, ALU, Shifter, Booth Algorithm Multiplier & Divider Instructor: Christopher H. Pham Review of Last
More informationLecture Topics. Announcements. Today: Integer Arithmetic (P&H ) Next: The MIPS ISA (P&H ) Consulting hours. Milestone #1 (due 1/26)
Lecture Topics Today: Integer Arithmetic (P&H 3.1-3.4) Next: The MIPS ISA (P&H 2.1-2.14) 1 Announcements Consulting hours Milestone #1 (due 1/26) Milestone #2 (due 2/2) 2 1 Review: Integer Operations Internal
More informationFloating Point Arithmetic
Floating Point Arithmetic ICS 233 Computer Architecture and Assembly Language Dr. Aiman El-Maleh College of Computer Sciences and Engineering King Fahd University of Petroleum and Minerals [Adapted from
More information