CMP 334: Seventh Class
|
|
- Sheryl Benson
- 5 years ago
- Views:
Transcription
1 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 numbers, signed arithmetic A B = A + B For next class: HW 6; read A.3-4, 2.1-5, 3.1-2
2 HW 5: Performance Problems 1) Computer A has a 5 GHz clock and executes program P in 3 seconds with an average CPI (cycles per instruction) of 3.. How many instructions does it execute for program P? 2) Computer B has a 2 GHz clock. It executes P with the same number of instructions as computer A with an average CPI 1.. How long does it take to execute P? 3) Compare the performance of computer B and computer A on program P. Which is faster? by how much? 4) A new compiler for computer A compiles program P so that it executes only half as many instructions. Unfortunately, the CPI for computer A on these instructions is 4.. How long does it take to execute the newly compiled program? 5) Compare the performance of computer B (with the old compiler) to computer A (with the new compiler) on program P. Which is faster? by how much?
3 Performance Equations Performance inverse of execution time performance: P x 1 T x relative performance: P x P y = T y T x CPU time equation T CPU (execution ) = # instructions execution Amdahl's law # cycles instruction # seconds cycle T new = fraction affected T old improvement + fraction not affected T old
4 Processor Performance Equations T X = # instructions X CPI X cycletime X T X = # instructions X CPI X clockrate X P X P Y = T Y T X = # instructions Y CPI Y cycletime Y # instructions X CPI X cycletime X P X P Y = T Y T X = # instructions Y CPI Y clockrate X # instructions X CPI X clockrate Y
5 HW 5.1 Instruction Count Computer A has a 5 GHz clock and executes program P in 3 seconds with an average CPI (cycles per instruction) of 3.. How many instructions does it execute for program P? T A = # instructions A CPI A clockrate A 3 seconds = # instructions A 3. cycles / instruction 5 GHz # instructions A = 3 seconds 5 19 cycles / second 3. cycles / instruction # instructions A = instructions
6 HW 5.2 Execution Time Computer B has a 2 GHz clock. It executes P with the same number of instructions as computer A (5 1 9 instructions) with an average CPI 1.. How long does it take to execute P? T B T B T B T B = # instructions B CPI B clockrate B = 5 19 instructions 1. cycles / instruction 2 GHz = 5 19 instructions 1 cycles / instruction cycles / second = 25 seconds
7 HW 5.3 Relative Performance Compare the performance of computer B and computer A on program P. Which is faster? by how much? P B P A = T A T B = 3 seconds 25 seconds = 1.2 B is 1.2 times faster than A.
8 HW 5.4 Execution Time A new compiler for computer A compiles program P so that it executes only half as many instructions. Unfortunately, the CPI for computer A on these instructions is 4.. How long does it take to execute the newly compiled program? T A ' = # instructions A' CPI A ' clockrate A' 1 2 # instructions A 4. cycles / instruction T A ' = clockrate A T A ' = instructions 4. cycles / instruction cycles / second T A ' = 1 seconds = 2 seconds 5
9 HW 5.5 Relative Performance Compare the performance of computer B (with the old compiler) to computer A' (A with the new compiler) on program P. Which is faster? by how much? P A' P B = T B T A' = 25 seconds 2 seconds = 1.25 A' is 1.25 times faster than B. P A' P A = T A T A' = 3 seconds 2 seconds = 1.5 A' is 1.5 times faster than A.
10 Averages and Weighted Averages Given values: {v 1, v 2, v N } & weights: {w 1, w 2, w N } average: v N i=1 N v i total weight: N W i = 1 w i normalized weight: q i w i W N ( i = q i = 1 ) weighted average: i=1 N N i=1 w i v i w i = N i=1 w i v i W N = i=1 w i W v i N = i=1 q i v i
11 Typical Instruction Statistics Instruction types, frequencies, and execution times 5% ALU instructions 5 CPI 3% Memory instructions 2% Load 8 CPI 1% Store 6 CPI 2% Branch instructions 1 CPI.5% Special instructions
12 Average Cycles Per Instruction (Weighted) average CPI = q ALU T ALU + q Load T Load + q Store T Store + q Branch T Branch = = = 6.7 cycles approximation: 2 / Execution time fraction by instruction type ALU 2.5 / 6.7 ~ 37.5% Load 1.6 / 6.7 ~ 24.% Store.6 / 6.7 ~ 9.% Branch 2. / 6.7 ~ 3.%
13 CPU Time Equation T CPU (execution ) = # instructions execution # cycles instruction # seconds cycle If T CPU (execution ) 2 seconds, cycle time = 1 9 seconds 2 seconds # instructions seconds 2 # instructions instruction time = # seconds instruction = # cycles instruction # seconds cycle
14 Performance Equations Performance inverse of execution time performance: P x 1 T x relative performance: P x P y = T y T x CPU time equation T CPU (execution ) = # instructions execution Amdahl's law # cycles instruction # seconds cycle T new = fraction affected T old improvement + fraction not affected T old
15 Amdahl's Law old time (12) affected (8) unaffected (4) SpeedUp (1.6) improved (5) unaffected (4) new time (9) T old = affected + unaffected T new = improved + unaffected SpeedUp = affected / improved Overall SpeedUp = P new /P old = T old /T new (fraction affected) F a = affected / T old (fraction unaffected) F a = unaffected / T old
16 Improving Race Car Performance miles miles/hours cruising 9 9 other 1 5 Race time = 9/9 + 1/5 = 12 hours Change #1: 1.11 x improvement in cruising speed Change #2: 2. x improvement in other speed
17 Change # 1 T old = 12 hours fa =.9 (fraction affected = affected/total = fa =.1 (fraction unaffected = unaffected/total = su = 1.11 (speedup for affected) 9 miles ) 1 miles 1 miles 1 miles ) T new = fa T old su + fa T old T new = = 1.93 hours
18 Change # 2 T old = 12 hours fa =.1 (fraction affected = affected/total = fa =.9 (fraction unaffected = unaffected/total = su = 2. (speedup for affected) 1 miles ) 1 miles 9 miles 1 miles ) T new = fa T old su + fa T old T new = = 11.4 hours
19 Change # 1 wrong! T old = 12 hours fa =.9 (fraction affected = affected/total = fa =.1 (fraction unaffected = unaffected/total = su = 1.11 (speedup for affected) 9 miles ) 1 miles 1 miles 1 miles ) T new = fa T old su + fa T old T new = = 1.93 hours
20 Change # 2 wrong! T old = 12 hours fa =.1 (fraction affected = affected/total = fa =.9 (fraction unaffected = unaffected/total = su = 2. (speedup for affected) 1 miles ) 1 miles 9 miles 1 miles ) T new = fa T old su + fa T old T new = = 11.4 hours
21 Change # 1 correct T old = 12 hours fa =.833 (fraction 1 hours affected = affected/total = 12 hours = 5 ) 6 fa =.167 (fraction unaffected = unaffected/total = 2 hours 12 hours = 1 ) 6 su = 1.11 (speedup for affected) T new = fa T old su T new fa T old = 11 hours
22 Change # 2 correct T old = 12 hours fa =.167 (fraction affected = affected/total = 2 hours 12 hours = 1 ) 6 fa =.833 (fraction unaffected = unaffected/total = su = 2. T new (speedup for affected) = fa T old su T new fa T old 1 hours 12 hours = 5 6 ) = 11 hours
23 Average Cycles Per Instruction (Weighted) average CPI = q ALU T ALU + q Load T Load + q Store T Store + q Branch T Branch = = = 6.7 cycles approximation: 2 / Execution time fraction by instruction type ALU 2.5 / 6.7 ~ 37.5% Load 1.6 / 6.7 ~ 24.% Store.6 / 6.7 ~ 9.% Branch 2. / 6.7 ~ 3.%
24 CPU Time Equation T CPU (execution ) = # instructions execution # cycles instruction # seconds cycle If T CPU (execution ) 2 seconds, cycle time = 1 9 seconds 2 seconds # instructions seconds 2 # instructions instruction time = # seconds instruction = # cycles instruction # seconds cycle
25 Amdahl's Law 1 T new = fraction affected T old improvement + fraction not affected T old Improvement X reduces ALU instruction CPI from 5 to 4 T X = fraction affected 2 sec improvement + fraction not affected 2 sec
26 Amdahl's Law 1 (wrong!) T new = fraction affected T old improvement + fraction not affected T old Improvement X reduces ALU instruction CPI from 5 to 4 T X = fraction affected 2 sec improvement + fraction not affected 2 sec T X = sec = 8 +1 sec = 18 sec
27 ( Amdahl's Law 1 T new = fraction affected T old improvement + fraction not affected T old Improvement X reduces ALU instruction CPI from 5 to 4 T X = fraction affected 2 sec improvement + fraction not affected 2 sec T X = ) sec ( ) sec = 18.6 sec
28 ( Amdahl's Law 2 T new = fraction affected T old improvement + fraction not affected T old Improvement Y reduces Load instruction CPI from 8 to 4 T Y = fraction affected 2 sec improvement + fraction not affected 2 sec T Y = )sec ( ) sec = 17.7 sec
29 ( Amdahl's Law 3 T new = fraction affected T old improvement + fraction not affected T old Improvement Z reduces Store instruction CPI from 6 to 2 T Z = fraction affected 2 sec improvement + fraction not affected 2 sec T Z = )sec ( ) sec = 18.9 sec
30 ( Amdahl's Law 4 T new = fraction affected T old improvement + fraction not affected T old Improvement W reduces Branch instruction CPI from 1 to 5 T W = fraction affected 2 sec improvement + fraction not affected 2 sec T W = )sec ( ) sec = 17.1 sec
31 Amdahl's Law old time (12) affected (8) unaffected (4) SpeedUp (1.6) improved (5) unaffected (4) new time (9) T old = affected + unaffected T new = improved + unaffected SpeedUp = affected / improved Overall SpeedUp = P new /P old = T old /T new (fraction affected) F a = affected / T old (fraction unaffected) F a = unaffected / T old
32 Amdahl's Law Overall SpeedUp performance: P x 1 T x relative performance: P x P y = T y T x P X P old = T old T X = P Y P old = T old T Y = P Z P old = T old T Z = P W P old = T old T W =
33 Amdahl's Law Overall SpeedUp P new P old = T old T new P new P old = fa T old su T old + fa T old P new P old = 1 fa su + fa
34 Human Addition (Binary)
35 Binary Addition
36 Binary Addition
37 Binary Addition
38 Binary Addition
39 Binary Addition
40 Binary Addition
41 Binary Addition
42 Binary Addition
43 64-Bit Computer Addition a s b bit adder.. a 63 b 63 s 63 C
44 4-Bit Computer Addition a b 1-bit adder s a 1 b 1 a 2 b 2 1-bit adder 4-bit adder half 1-bit adder s 1 s 2 a 3 b 3 1-bit adder s 3 c
45 4-Bit Ripple Carry Adder a b 1-bit adder s a 1 b 1 a 2 b 2 1-bit adder 4-bit adder half 1-bit adder s 1 s 2 a 3 b 3 1-bit adder s 3 c
46 4-Bit Ripple Carry Adder a b 1-bit adder s a 1 b 1 1-bit adder s 1 a 2 b 2 half 1-bit adder s 2 a 3 b 3 1-bit adder s 3 c
47 4-Bit Ripple Carry Adder a b s a 1 b 1 full adder s 1 a 2 b 2 full adder s 2 a 3 b 3 full adder s 3 c
48 1-Bit Computer Addition (take 1) a s b c
49 Half Adder Truth Table a b c s c = ab s = ab + ab
50 Half Adder Circuit a s b c
51 1-Bit Computer Addition (take 2) c a b full adder s i c'
52 Full Adder # a b c c' s s' = abc + abc + abc + s' = abc c' = abc + abc + abc + c' = abc + abc + abc c' = abc + abc + abc + c' = abc + abc + abc c' = bc + ac + ab
53 Full Adder # a b c c' s s' = abc + abc + abc + s' = abc c' = abc + abc + abc + c' = abc + abc + abc c' = abc + abc + abc + c' = abc + abc + abc c' = bc + ac + ab
54 Full Adder # a b c c' s s' = abc + abc + abc + s' = abc c' = abc + abc + abc + c' = abc + abc + abc c' = abc + abc + abc + c' = abc + abc + abc c' = bc + ac + ab
55 Full Adder # a b c c' s s' = abc + abc + abc + s' = abc c' = abc + abc + abc + c' = abc + abc + abc c' = abc + abc + abc + c' = abc + abc + abc c' = bc + ac + ab
56 s' = abc + abc + abc + abc c' = ab + ac + bc c a b full adder r c'
57 s' = abc + abc + abc + abc c' = ab + ac + bc c a b r c' full adder
58 Full Adder?? c a b s full adder c'
59 Full Adder?? c a s b x z y full adder c'
60 Full Adder Implementation?? # a b c x y z c' s c a b full adder x y u v c s z c' c = uv s = uv + uv s
61 Full Adder Implementation! # a b c x y z c' s c a b full adder x y u v c s z c' c = uv s = uv + uv s
62 A Full Adder c a b s i Full Adder c'
63 A Full Adder c a b s i Full Adder c'
64 Initial adder half or full? a b half? s a 1 b 1 full adder s 1 a 2 b 2 full adder s 2 a 3 b 3 full adder s 3 c
65 Full Initial adder? Con Pro Superfluous wires and gates General simplicity Avoid special cases where ever practical Simplifies addition of big integers Big Integer: N = x k J k x 2 J 2 + x 1 J 1 + x J Where J 2 32 Like base 1 but with sixteen billion billion fingers Simplifies subtraction
66 4-Bit Ripple Carry Adder c -1 a b half full adder s a 1 b 1 half full adder adder s 1 a 2 b 2 half full adder s 2 a 3 b 3 full adder s 3 c 3
67 4-Bit Ripple Carry Adder c -1 a b half full adder 4-bit adder s a 1 b 1 half full adder adder s 1 a 2 b 2 half full adder s 2 a 3 b 3 full adder s 3 c 3
68 4-Bit Ripple Carry Adder c -1 a b half full adder s a 1 b 1 a 2 b 2 half full adder adder 4-bit adder half full adder s 1 s 2 a 3 b 3 full adder s 3 c 3
69 8-Bit Ripple Carry Adder c -1 a b a 1 b 1 a 2 b 2 a 3 b 3 a 4 b 4 a 5 b 5 a 6 b 6 a 7 b 7 half full adder full adder 4-bit adder 8-bit adder half full adder half full c 3 half full adder full adder 4-bit adder half full adder half full s s 1 s 2 s 3 s 4 s 5 s 6 s 7 c 7
70 64-Bit Ripple Carry Adder c -1 a s b bit adder.. a 63 b 63 s 63 c 63
71 Fixed Width Binary Addition
72 Fixed Width Binary Addition
73 Fixed Width Binary Addition
74 Fixed Width Binary Addition
75 Fixed Width Binary Addition
76 Fixed Width Binary Addition Carry out
77 Fixed Width Binary Addition Carry out Carry in
78 Non-Negative Numbers Subtraction A B A ~ B A B (ordinary arithmetic) A < B 1) B ~ B = 2) (A ~ B) + C = (A + C) ~ B ~B ~ B = 2 n B = B + 1 ~B pseudoinverse of B A ~ B A + B + 1
79 Fixed Width Binary Addition Borrow Carry in
80 Negative Number Representation Alternatives 1. Sign-magnitude 2. Bias How would it help Complicates arithmetic 3. 1's complement Too many zeros 4. 2's complement
81 Negative Number Representation Unsigned numbers:.. 2 N - 1 Signed number alternatives 1. Sign-magnitude: 2 N N-1 1 How would this help? 2. Bias: bias.. 2 N 1 bias Complicates arithmetic (a-bias + b-bias) = (a + b)-bias)-bias 3. 1's complement: 2 N N and 's complement: 2 N N-1 1
82 Negative Number Representation # binary sign magnitude bias (8) 1's complement 2's complement A B C D E F
83 1's Complement Arithmetic The 9's complement, d, of a decimal digit d is 9 d The 9's complement, X, of a 4-digit X is 9999 X The 1's complement, X, of X is X + 1 X = X + 1 = 9999 X +1 = 1 X convention: X is positive and Y is negative iff X < 5 Y < 1 Y Y and X Y = X + Y unless Overflow sign(x) = sign(y) sign(x + Y) Overflow sign(x) sign(y) = sign(x Y)
84 1 = 's Complement Example 1 = = = 12 2 = = = = = = = = 98 = overflow = 6 = =
85 2's Complement Arithmetic The 1's complement, b, of a binary bit b is 1 d The 1's complement, X, of a 4-bit X is 1111 X The 2's complement, X, of X is X + 1 X = X + 1 = 1111 X +1 = 1 X convention: X is positive and Y is negative iff X < 2 N-1 Y < 2 N Y Y and X Y = X + Y unless Overflow sign(x) = sign(y) sign(x + Y) Overflow sign(x) sign(y) = sign(x Y)
86 Unsigned Integers = 2 N = 2 N = 2 N = 2 N = 4 = = 3 = = 2 = = 1 = 2 = = = = 1 = = 2 = 2 1 = = 3 = = 4 = = 5 = = 2 N = 2 N = 2 N = 2 N N Bit Integers (N = 8) Signed Integers
87 Negative Number Representation # binary sign magnitude bias (-7) 1's complement 2's complement A B C D E F
88 Basic Processor Model registers SYSTEM BUS A MUX A bus C MUX B MUX B bus ALU C Bus PC IR
89 Basic Processor Model registers SYSTEM BUS Combinational Core A MUX A bus C MUX B MUX B bus ALU C Bus PC IR
90 Building Blocks Arithmetic / Logical Unit AND, OR, and NOT gates Inverters, Decoders, Multiplexers Inputs (operands): A and B buses Output (result): C bus Logical Bitwise: A, A & B, A B, A ^ B, A B, A B,... Arithmetic A + B, A B, A ٠ B, A div B, A mod B Comparison A < B, A = B, A B, etc. and X <, X =, X, etc.
91 TINY Arithmetic / Logical Unit Building Blocks AND, OR, and NOT gates Inverters, Decoders, Multiplexers Inputs (operands): A and B buses Output (result): C bus Logical Bitwise: A, A & B, A B, A ^ B, A B, A B,... Arithmetic A + B, A B, A ٠ B, A div B, A mod B Comparison A < B, A = B, A B, etc. and X <, X =, X, etc.
92 Muxes, Buses, and ALU ALU inputs (operands): A and B buses ALU output (result): C bus Logical Bitwise: A, A & B, A B, A ^ B, A B, A B,... Arithmetic A + B, A B, A ٠ B, A div B, A mod B Comparison A < B, A = B, A B, etc. and X <, X =, X, etc. Combinational building blocks AND, OR, and NOT gates Inverters, Decoders, Multiplexers
93 Inverters, Decoders, Multiplexer Inverter: select data input or its negation 1 data input 1 selector input 1 output Decoder: select unique output to be 1 (true) N selector inputs 2 N outputs Multiplexer: select unique data input to be output 2 N data inputs N selector inputs 1 output
94 The TINY Computer A bus B bus ALU C Bus B MUX A MUX C MUX SYSTEM BUS MAR x x x x x x x x x x x x x x x xffff MDR Z N C O registers $1 $2 $3 $4 $5 $6 $7 $8 $9 $A $B $C $D $E $F PC IR
95 The TINY Computer A bus B bus ALU C Bus B MUX A MUX C MUX SYSTEM BUS MAR x x x x x x x x x x x x x x x xffff MDR Z N C O registers $1 $2 $3 $4 $5 $6 $7 $8 $9 $A $B $C $D $E $F PC IR
96
CMP 338: Third Class
CMP 338: Third Class HW 2 solution Conversion between bases The TINY processor Abstraction and separation of concerns Circuit design big picture Moore s law and chip fabrication cost Performance What does
More informationNumbers and Arithmetic
Numbers and Arithmetic See: P&H Chapter 2.4 2.6, 3.2, C.5 C.6 Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University Big Picture: Building a Processor memory inst register file alu
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 informationHakim Weatherspoon CS 3410 Computer Science Cornell University
Hakim Weatherspoon CS 3410 Computer Science Cornell University The slides are the product of many rounds of teaching CS 3410 by Professors Weatherspoon, Bala, Bracy, and Sirer. memory inst 32 register
More informationNumbers and Arithmetic
Numbers and Arithmetic See: P&H Chapter 2.4 2.6, 3.2, C.5 C.6 Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University Big Picture: Building a Processor memory inst register file alu
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 informationWe are here. Assembly Language. Processors Arithmetic Logic Units. Finite State Machines. Circuits Gates. Transistors
CSC258 Week 3 1 Logistics If you cannot login to MarkUs, email me your UTORID and name. Check lab marks on MarkUs, if it s recorded wrong, contact Larry within a week after the lab. Quiz 1 average: 86%
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 informationSample Test Paper - I
Scheme G Sample Test Paper - I Course Name : Computer Engineering Group Marks : 25 Hours: 1 Hrs. Q.1) Attempt any THREE: 09 Marks a) Define i) Propagation delay ii) Fan-in iii) Fan-out b) Convert the following:
More informationCombinational Logic. Mantıksal Tasarım BBM231. section instructor: Ufuk Çelikcan
Combinational Logic Mantıksal Tasarım BBM23 section instructor: Ufuk Çelikcan Classification. Combinational no memory outputs depends on only the present inputs expressed by Boolean functions 2. Sequential
More informationECE/CS 250 Computer Architecture
ECE/CS 250 Computer Architecture Basics of Logic Design: Boolean Algebra, Logic Gates (Combinational Logic) Tyler Bletsch Duke University Slides are derived from work by Daniel J. Sorin (Duke), Alvy Lebeck
More informationECE 250 / CPS 250 Computer Architecture. Basics of Logic Design Boolean Algebra, Logic Gates
ECE 250 / CPS 250 Computer Architecture Basics of Logic Design Boolean Algebra, Logic Gates Benjamin Lee Slides based on those from Andrew Hilton (Duke), Alvy Lebeck (Duke) Benjamin Lee (Duke), and Amir
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 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 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 informationChapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr.
Chapter 4 Dr. Panos Nasiopoulos Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. Sequential: In addition, they include storage elements Combinational
More informationBoolean Algebra and Digital Logic 2009, University of Colombo School of Computing
IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of
More informationLecture 3, Performance
Lecture 3, Performance Repeating some definitions: CPI Clocks Per Instruction MHz megahertz, millions of cycles per second MIPS Millions of Instructions Per Second = MHz / CPI MOPS Millions of Operations
More informationHardware Design I Chap. 4 Representative combinational logic
Hardware Design I Chap. 4 Representative combinational logic E-mail: shimada@is.naist.jp Already optimized circuits There are many optimized circuits which are well used You can reduce your design workload
More informationSystems I: Computer Organization and Architecture
Systems I: Computer Organization and Architecture Lecture 6 - Combinational Logic Introduction A combinational circuit consists of input variables, logic gates, and output variables. The logic gates accept
More informationLecture 3, Performance
Repeating some definitions: Lecture 3, Performance CPI MHz MIPS MOPS Clocks Per Instruction megahertz, millions of cycles per second Millions of Instructions Per Second = MHz / CPI Millions of Operations
More informationLogic and Boolean algebra
Computer Mathematics Week 7 Logic and Boolean algebra College of Information Science and Engineering Ritsumeikan University last week coding theory channel coding information theory concept Hamming distance
More informationAdders, subtractors comparators, multipliers and other ALU elements
CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Adders 2 Circuit Delay Transistors have instrinsic resistance and capacitance
More informationCprE 281: Digital Logic
CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Simple Processor CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Digital
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 informationEnrico Nardelli Logic Circuits and Computer Architecture
Enrico Nardelli Logic Circuits and Computer Architecture Appendix B The design of VS0: a very simple CPU Rev. 1.4 (2009-10) by Enrico Nardelli B - 1 Instruction set Just 4 instructions LOAD M - Copy into
More informationChapter 1: Solutions to Exercises
1 DIGITAL ARITHMETIC Miloš D. Ercegovac and Tomás Lang Morgan Kaufmann Publishers, an imprint of Elsevier, c 2004 Exercise 1.1 (a) 1. 9 bits since 2 8 297 2 9 2. 3 radix-8 digits since 8 2 297 8 3 3. 3
More informationDigital Logic: Boolean Algebra and Gates. Textbook Chapter 3
Digital Logic: Boolean Algebra and Gates Textbook Chapter 3 Basic Logic Gates XOR CMPE12 Summer 2009 02-2 Truth Table The most basic representation of a logic function Lists the output for all possible
More informationMenu. 7-Segment LED. Misc. 7-Segment LED MSI Components >MUX >Adders Memory Devices >D-FF, RAM, ROM Computer/Microprocessor >GCPU
Menu 7-Segment LED MSI Components >MUX >Adders Memory Devices >D-FF, RAM, ROM Computer/Microprocessor >GCPU Look into my... 1 7-Segment LED a b c h GND c g b d f a e h Show 7-segment LED in LogicWorks,
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 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 informationNumber System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary
Number System Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary BOOLEAN ALGEBRA BOOLEAN LOGIC OPERATIONS Logical AND Logical OR Logical COMPLEMENTATION
More informationNumbers & Arithmetic. Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University. See: P&H Chapter , 3.2, C.5 C.
Numbers & Arithmetic Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University See: P&H Chapter 2.4-2.6, 3.2, C.5 C.6 Example: Big Picture Computer System Organization and Programming
More informationAdders, subtractors comparators, multipliers and other ALU elements
CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Instructor: Mohsen Imani UC San Diego Slides from: Prof.Tajana Simunic Rosing
More informationCombina-onal Logic Chapter 4. Topics. Combina-on Circuit 10/13/10. EECE 256 Dr. Sidney Fels Steven Oldridge
Combina-onal Logic Chapter 4 EECE 256 Dr. Sidney Fels Steven Oldridge Topics Combina-onal circuits Combina-onal analysis Design procedure simple combined to make complex adders, subtractors, converters
More informationELEN Electronique numérique
ELEN0040 - Electronique numérique Patricia ROUSSEAUX Année académique 2014-2015 CHAPITRE 3 Combinational Logic Circuits ELEN0040 3-4 1 Combinational Functional Blocks 1.1 Rudimentary Functions 1.2 Functions
More informationComplement Arithmetic
Complement Arithmetic Objectives In this lesson, you will learn: How additions and subtractions are performed using the complement representation, What is the Overflow condition, and How to perform arithmetic
More informationBOOLEAN ALGEBRA. Introduction. 1854: Logical algebra was published by George Boole known today as Boolean Algebra
BOOLEAN ALGEBRA Introduction 1854: Logical algebra was published by George Boole known today as Boolean Algebra It s a convenient way and systematic way of expressing and analyzing the operation of logic
More informationLecture 5: Arithmetic
Lecture 5: Arithmetic COS / ELE 375 Computer Architecture and Organization Princeton University Fall 2015 Prof. David August 1 5 Binary Representation of Integers Two physical states: call these 1 and
More informationECE 545 Digital System Design with VHDL Lecture 1. Digital Logic Refresher Part A Combinational Logic Building Blocks
ECE 545 Digital System Design with VHDL Lecture Digital Logic Refresher Part A Combinational Logic Building Blocks Lecture Roadmap Combinational Logic Basic Logic Review Basic Gates De Morgan s Law Combinational
More informationCSE140: Components and Design Techniques for Digital Systems. Decoders, adders, comparators, multipliers and other ALU elements. Tajana Simunic Rosing
CSE4: Components and Design Techniques for Digital Systems Decoders, adders, comparators, multipliers and other ALU elements Tajana Simunic Rosing Mux, Demux Encoder, Decoder 2 Transmission Gate: Mux/Tristate
More informationIntroduction to Digital Logic Missouri S&T University CPE 2210 Subtractors
Introduction to Digital Logic Missouri S&T University CPE 2210 Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science and Technology cetinkayae@mst.edu
More informationCombinational Logic Design Arithmetic Functions and Circuits
Combinational Logic Design Arithmetic Functions and Circuits Overview Binary Addition Half Adder Full Adder Ripple Carry Adder Carry Look-ahead Adder Binary Subtraction Binary Subtractor Binary Adder-Subtractor
More informationECE 341. Lecture # 3
ECE 341 Lecture # 3 Instructor: Zeshan Chishti zeshan@ece.pdx.edu October 7, 2013 Portland State University Lecture Topics Counters Finite State Machines Decoders Multiplexers Reference: Appendix A of
More informationResidue Number Systems Ivor Page 1
Residue Number Systems 1 Residue Number Systems Ivor Page 1 7.1 Arithmetic in a modulus system The great speed of arithmetic in Residue Number Systems (RNS) comes from a simple theorem from number theory:
More informationComputer Engineering Department. CC 311- Computer Architecture. Chapter 4. The Processor: Datapath and Control. Single Cycle
Computer Engineering Department CC 311- Computer Architecture Chapter 4 The Processor: Datapath and Control Single Cycle Introduction The 5 classic components of a computer Processor Input Control Memory
More informationLogic Design. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson
Logic Deign CS 270: Mathematical Foundation of Computer Science Jeremy Johnon Logic Deign Objective: To provide an important application of propoitional logic to the deign and implification of logic circuit.
More informationARITHMETIC COMBINATIONAL MODULES AND NETWORKS
ARITHMETIC COMBINATIONAL MODULES AND NETWORKS 1 SPECIFICATION OF ADDER MODULES FOR POSITIVE INTEGERS HALF-ADDER AND FULL-ADDER MODULES CARRY-RIPPLE AND CARRY-LOOKAHEAD ADDER MODULES NETWORKS OF ADDER MODULES
More informationDigital Logic Appendix A
Digital Logic Appendix A Boolean Algebra Gates Combinatorial Circuits Sequential Circuits 1 Boolean Algebra George Boole ideas 1854 Claude Shannon, apply to circuit design, 1938 Describe digital circuitry
More informationA crash course in Digital Logic
crash course in Digital Logic Computer rchitecture 1DT016 distance Fall 2017 http://xyx.se/1dt016/index.php Per Foyer Mail: per.foyer@it.uu.se Per.Foyer@it.uu.se 2017 1 We start from here Gates Flip-flops
More informationLecture 22 Chapters 3 Logic Circuits Part 1
Lecture 22 Chapters 3 Logic Circuits Part 1 LC-3 Data Path Revisited How are the components Seen here implemented? 5-2 Computing Layers Problems Algorithms Language Instruction Set Architecture Microarchitecture
More informationComputer Architecture
Lecture 2: Iakovos Mavroidis Computer Science Department University of Crete 1 Previous Lecture CPU Evolution What is? 2 Outline Measurements and metrics : Performance, Cost, Dependability, Power Guidelines
More informationCPU DESIGN The Single-Cycle Implementation
CSE 202 Computer Organization CPU DESIGN The Single-Cycle Implementation Shakil M. Khan (adapted from Prof. H. Roumani) Dept of CS & Eng, York University Sequential vs. Combinational Circuits Digital circuits
More informationCS61C : Machine Structures
CS 61C L15 Blocks (1) inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #15: Combinational Logic Blocks Outline CL Blocks Latches & Flip Flops A Closer Look 2005-07-14 Andy Carle CS
More informationEC 413 Computer Organization
EC 413 Computer Organization rithmetic Logic Unit (LU) and Register File Prof. Michel. Kinsy Computing: Computer Organization The DN of Modern Computing Computer CPU Memory System LU Register File Disks
More informationUNIVERSITY OF WISCONSIN MADISON
CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON Prof. Gurindar Sohi TAs: Minsub Shin, Lisa Ossian, Sujith Surendran Midterm Examination 2 In Class (50 minutes) Friday,
More informationSystem Data Bus (8-bit) Data Buffer. Internal Data Bus (8-bit) 8-bit register (R) 3-bit address 16-bit register pair (P) 2-bit address
Intel 8080 CPU block diagram 8 System Data Bus (8-bit) Data Buffer Registry Array B 8 C Internal Data Bus (8-bit) F D E H L ALU SP A PC Address Buffer 16 System Address Bus (16-bit) Internal register addressing:
More informationUnit 3 Session - 9 Data-Processing Circuits
Objectives Unit 3 Session - 9 Data-Processing Design of multiplexer circuits Discuss multiplexer applications Realization of higher order multiplexers using lower orders (multiplexer trees) Introduction
More informationArithme(c logic units and memory
Arithme(c logic units and memory CSCI 255: Introduc/on to Embedded Systems Keith Vertanen Copyright 2011 Layers of abstrac-on abstrac(on building blocks examples computer components Macbook Pro components
More informationLogic and Computer Design Fundamentals. Chapter 8 Sequencing and Control
Logic and Computer Design Fundamentals Chapter 8 Sequencing and Control Datapath and Control Datapath - performs data transfer and processing operations Control Unit - Determines enabling and sequencing
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 informationCS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #15: Combinational Logic Blocks 2005-07-14 CS 61C L15 Blocks (1) Andy Carle Outline CL Blocks Latches & Flip Flops A Closer Look CS
More informationDigital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits.
CS211 Computer Architecture Digital Logic l Topics l Transistors (Design & Types) l Logic Gates l Combinational Circuits l K-Maps Figures & Tables borrowed from:! http://www.allaboutcircuits.com/vol_4/index.html!
More informationCOSC 243. Introduction to Logic And Combinatorial Logic. Lecture 4 - Introduction to Logic and Combinatorial Logic. COSC 243 (Computer Architecture)
COSC 243 Introduction to Logic And Combinatorial Logic 1 Overview This Lecture Introduction to Digital Logic Gates Boolean algebra Combinatorial Logic Source: Chapter 11 (10 th edition) Source: J.R. Gregg,
More informationBoolean Algebra. Digital Logic Appendix A. Postulates, Identities in Boolean Algebra How can I manipulate expressions?
Digital Logic Appendix A Gates Combinatorial Circuits Sequential Circuits Other operations NAND A NAND B = NOT ( A ANDB) = AB NOR A NOR B = NOT ( A ORB) = A + B Truth tables What is the result of the operation
More informationChapter 1. Binary Systems 1-1. Outline. ! Introductions. ! Number Base Conversions. ! Binary Arithmetic. ! Binary Codes. ! Binary Elements 1-2
Chapter 1 Binary Systems 1-1 Outline! Introductions! Number Base Conversions! Binary Arithmetic! Binary Codes! Binary Elements 1-2 3C Integration 傳輸與介面 IA Connecting 聲音與影像 Consumer Screen Phone Set Top
More informationCombinatorial Logic Design Multiplexers and ALUs CS 64: Computer Organization and Design Logic Lecture #13
Combinatorial Logic Design Multiplexers and ALUs CS 64: Computer Organization and Design Logic Lecture #13 Ziad Matni Dept. of Computer Science, UCSB Administrative Re: Midterm Exam #2 Graded! 5/22/18
More informationCSEE 3827: Fundamentals of Computer Systems. Combinational Circuits
CSEE 3827: Fundamentals of Computer Systems Combinational Circuits Outline (M&K 3., 3.3, 3.6-3.9, 4.-4.2, 4.5, 9.4) Combinational Circuit Design Standard combinational circuits enabler decoder encoder
More information14:332:231 DIGITAL LOGIC DESIGN. Why Binary Number System?
:33:3 DIGITAL LOGIC DESIGN Ivan Marsic, Rutgers University Electrical & Computer Engineering Fall 3 Lecture #: Binary Number System Complement Number Representation X Y Why Binary Number System? Because
More informationCprE 281: Digital Logic
CprE 281: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Signed Numbers CprE 281: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Administrative
More informationPERFORMANCE METRICS. Mahdi Nazm Bojnordi. CS/ECE 6810: Computer Architecture. Assistant Professor School of Computing University of Utah
PERFORMANCE METRICS Mahdi Nazm Bojnordi Assistant Professor School of Computing University of Utah CS/ECE 6810: Computer Architecture Overview Announcement Jan. 17 th : Homework 1 release (due on Jan.
More informationBinary addition example worked out
Binary addition example worked out Some terms are given here Exercise: what are these numbers equivalent to in decimal? The initial carry in is implicitly 0 1 1 1 0 (Carries) 1 0 1 1 (Augend) + 1 1 1 0
More informationArithmetic and Logic Unit First Part
Arithmetic and Logic Unit First Part Arquitectura de Computadoras Arturo Díaz D PérezP Centro de Investigación n y de Estudios Avanzados del IPN adiaz@cinvestav.mx Arquitectura de Computadoras ALU1-1 Typical
More informationCMPE12 - Notes chapter 1. Digital Logic. (Textbook Chapter 3)
CMPE12 - Notes chapter 1 Digital Logic (Textbook Chapter 3) Transistor: Building Block of Computers Microprocessors contain TONS of transistors Intel Montecito (2005): 1.72 billion Intel Pentium 4 (2000):
More informationFloating Point Representation and Digital Logic. Lecture 11 CS301
Floating Point Representation and Digital Logic Lecture 11 CS301 Administrative Daily Review of today s lecture w Due tomorrow (10/4) at 8am Lab #3 due Friday (9/7) 1:29pm HW #5 assigned w Due Monday 10/8
More informationBoolean Algebra. Digital Logic Appendix A. Boolean Algebra Other operations. Boolean Algebra. Postulates, Identities in Boolean Algebra
Digital Logic Appendix A Gates Combinatorial Circuits Sequential Circuits George Boole ideas 1854 Claude Shannon, apply to circuit design, 1938 (piirisuunnittelu) Describe digital circuitry function programming
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Describe and use algorithms for integer operations based on their expansions Relate algorithms for integer
More informationUNIT III Design of Combinational Logic Circuits. Department of Computer Science SRM UNIVERSITY
UNIT III Design of ombinational Logic ircuits Department of omputer Science SRM UNIVERSITY Introduction to ombinational ircuits Logic circuits for digital systems may be ombinational Sequential combinational
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 informationLecture 2 Review on Digital Logic (Part 1)
Lecture 2 Review on Digital Logic (Part 1) Xuan Silvia Zhang Washington University in St. Louis http://classes.engineering.wustl.edu/ese461/ Grading Engagement 5% Review Quiz 10% Homework 10% Labs 40%
More informationCHAPTER log 2 64 = 6 lines/mux or decoder 9-2.* C = C 8 V = C 8 C * 9-4.* (Errata: Delete 1 after problem number) 9-5.
CHPTER 9 2008 Pearson Education, Inc. 9-. log 2 64 = 6 lines/mux or decoder 9-2.* C = C 8 V = C 8 C 7 Z = F 7 + F 6 + F 5 + F 4 + F 3 + F 2 + F + F 0 N = F 7 9-3.* = S + S = S + S S S S0 C in C 0 dder
More information211: Computer Architecture Summer 2016
211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Storage: Recap - Review: cache hit rate - Project3 - Digital Logic: - truth table => SOP - simplification: Boolean
More informationALU (3) - Division Algorithms
HUMBOLDT-UNIVERSITÄT ZU BERLIN INSTITUT FÜR INFORMATIK Lecture 12 ALU (3) - Division Algorithms Sommersemester 2002 Leitung: Prof. Dr. Miroslaw Malek www.informatik.hu-berlin.de/rok/ca CA - XII - ALU(3)
More informationDIGITAL TECHNICS. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute
DIGITAL TECHNICS Dr. Bálint Pődör Óbuda University, Microelectronics and Technology Institute 4. LECTURE: COMBINATIONAL LOGIC DESIGN: ARITHMETICS (THROUGH EXAMPLES) 2016/2017 COMBINATIONAL LOGIC DESIGN:
More information[2] Predicting the direction of a branch is not enough. What else is necessary?
[2] When we talk about the number of operands in an instruction (a 1-operand or a 2-operand instruction, for example), what do we mean? [2] What are the two main ways to define performance? [2] Predicting
More informationCOMBINATIONAL LOGIC FUNCTIONS
COMBINATIONAL LOGIC FUNCTIONS Digital logic circuits can be classified as either combinational or sequential circuits. A combinational circuit is one where the output at any time depends only on the present
More informationCS470: Computer Architecture. AMD Quad Core
CS470: Computer Architecture Yashwant K. Malaiya, Professor malaiya@cs.colostate.edu AMD Quad Core 1 Architecture Layers Building blocks Gates, flip-flops Functional bocks: Combinational, Sequential Instruction
More informationSIR C.R.REDDY COLLEGE OF ENGINEERING ELURU DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I - SEMESTER
SIR C.R.REDDY COLLEGE OF ENGINEERING ELURU 534 007 DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I - SEMESTER DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING DIGITAL
More informationCSE 140 Lecture 11 Standard Combinational Modules. CK Cheng and Diba Mirza CSE Dept. UC San Diego
CSE 4 Lecture Standard Combinational Modules CK Cheng and Diba Mirza CSE Dept. UC San Diego Part III - Standard Combinational Modules (Harris: 2.8, 5) Signal Transport Decoder: Decode address Encoder:
More informationKUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE
Estd-1984 KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE 641 006 QUESTION BANK UNIT I PART A ISO 9001:2000 Certified 1. Convert (100001110.010) 2 to a decimal number. 2. Find the canonical SOP for the function
More informationUNIT 8A Computer Circuitry: Layers of Abstraction. Boolean Logic & Truth Tables
UNIT 8 Computer Circuitry: Layers of bstraction 1 oolean Logic & Truth Tables Computer circuitry works based on oolean logic: operations on true (1) and false (0) values. ( ND ) (Ruby: && ) 0 0 0 0 0 1
More information[2] Predicting the direction of a branch is not enough. What else is necessary?
[2] What are the two main ways to define performance? [2] Predicting the direction of a branch is not enough. What else is necessary? [2] The power consumed by a chip has increased over time, but the clock
More informationCprE 281: Digital Logic
CprE 281: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Fast Adders CprE 281: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev HW5
More informationCarry Look Ahead Adders
Carry Look Ahead Adders Lesson Objectives: The objectives of this lesson are to learn about: 1. Carry Look Ahead Adder circuit. 2. Binary Parallel Adder/Subtractor circuit. 3. BCD adder circuit. 4. Binary
More informationChapter 7 Logic Circuits
Chapter 7 Logic Circuits Goal. Advantages of digital technology compared to analog technology. 2. Terminology of Digital Circuits. 3. Convert Numbers between Decimal, Binary and Other forms. 5. Binary
More informationECE/CS 250: Computer Architecture. Basics of Logic Design: Boolean Algebra, Logic Gates. Benjamin Lee
ECE/CS 250: Computer Architecture Basics of Logic Design: Boolean Algebra, Logic Gates Benjamin Lee Slides based on those from Alvin Lebeck, Daniel Sorin, Andrew Hilton, Amir Roth, Gershon Kedem Admin
More informationDE58/DC58 LOGIC DESIGN DEC 2014
Q.2 a. In a base-5 number system, 3 digit representations is used. Find out (i) Number of distinct quantities that can be represented.(ii) Representation of highest decimal number in base-5. Since, r=5
More informationDigital Integrated Circuits A Design Perspective. Arithmetic Circuits. Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic.
Digital Integrated Circuits A Design Perspective Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic Arithmetic Circuits January, 2003 1 A Generic Digital Processor MEMORY INPUT-OUTPUT CONTROL DATAPATH
More informationDigital Techniques. Figure 1: Block diagram of digital computer. Processor or Arithmetic logic unit ALU. Control Unit. Storage or memory unit
Digital Techniques 1. Binary System The digital computer is the best example of a digital system. A main characteristic of digital system is its ability to manipulate discrete elements of information.
More informationComputer Science. 19. Combinational Circuits. Computer Science COMPUTER SCIENCE. Section 6.1.
COMPUTER SCIENCE S E D G E W I C K / W A Y N E PA R T I I : A L G O R I T H M S, M A C H I N E S, a n d T H E O R Y Computer Science Computer Science An Interdisciplinary Approach Section 6.1 ROBERT SEDGEWICK
More information