1. Chapter 3 Digital Logic Structures

2. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-2 Transistor: Building Block of Computers Microprocessors contain millions of transistors Intel Pentium II: 7 million Compaq Alpha 21264: 15 million Intel Pentium III: 28 million Logically, each transistor acts as a switch Combined to implement logic functions AND, OR, NOT Combined to build higher-level structures Adder, multiplexor, decoder, register, … Combined to build processor LC-2

3. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-3 Simple Switch Circuit Switch open: No current through circuit Light is off V out is + 5V Switch closed: Short circuit across switch Current flows Light is on V out is 0V Switch-based circuits can easily represent two states: on/off, open/closed, voltage/no voltage.

4. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-4 LOGICAL AND:

5. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-5 N-type MOS Transistor MOS = Metal Oxide Semiconductor two types: N-type and P-type N-type when Gate has positive voltage, short circuit between #1 and #2 (switch closed) when Gate has zero voltage, open circuit between #1 and #2 (switch open) Gate = 1 Gate = 0 Terminal #2 must be connected to GND (0V).

6. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-6 P-type MOS Transistor P-type is complementary to N-type when Gate has positive voltage, open circuit between #1 and #2 (switch open) when Gate has zero voltage, short circuit between #1 and #2 (switch closed) Gate = 1 Gate = 0 Terminal #1 must be connected to +2.9V.

7. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-7 Logic Gates Use switch behavior of MOS transistors to implement logical functions: AND, OR, NOT. Digital symbols: recall that we assign a range of analog voltages to each digital (logic) symbol assignment of voltage ranges depends on electrical properties of transistors being used  typical values for "1": +5V, +3.3V, +2.9V  from now on we'll use +5V

8. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-8 CMOS Circuit Complementary MOS Uses both N-type and P-type MOS transistors P-type  Attached to + voltage  Pulls output voltage UP when input is zero N-type  Attached to GND  Pulls output voltage DOWN when input is one For all inputs, make sure that output is either connected to GND or to +, but not both!

9. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-9 Inverter (NOT Gate) InOut 0 V2.9 V 0 V InOut 01 10 Truth table

10. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-10 NOR Gate ABC 001 010 100 110 Note: Serial structure on top, parallel on bottom.

11. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-11 OR Gate Add inverter to NOR. ABC 000 011 101 111

12. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-12 NAND Gate (AND-NOT) ABC 001 011 101 110 Note: Parallel structure on top, serial on bottom.

13. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-13 AND Gate Add inverter to NAND. ABC 000 010 100 111

14. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-14 Basic Logic Gates

15. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-15 Fundamental Properties of boolean algebra: Commutative:  X + Y = Y + X  X. Y = Y. X Associative:  ( X + Y) + Z = X + (Y + Z)  ( X. Y). Z = X. (Y. Z) Distributive:  X. (Y + Z) = (X. Y) + (X. Z)  X + (Y. Z) = (X + Y). (X + Z) Identity:  X + 0 = X  X. 1 = X Complement:  X +X’ = 1  X. X’ = 0

16. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-16 X+1 X+0 X.X X.1 X.0 X+XY

17. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-17 More than 2 Inputs? AND/OR can take any number of inputs. AND = 1 if all inputs are 1. OR = 1 if any input is 1. Similar for NAND/NOR. Can implement with multiple two-input gates, or with single CMOS circuit.

18. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-18 Practice Implement a 3-input NOR gate with CMOS.

19. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-19 Logical Completeness Can implement ANY truth table with AND, OR, NOT. ABCD 0000 0010 0101 0110 1000 1011 1100 1110 1. AND combinations that yield a "1" in the truth table. 2. OR the results of the AND gates.

20. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-20 Practice Implement the following truth table. ABC 000 011 101 110 A B C

21. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-21 Another example: XYZOutput 0000 0011 0101 0110 1000 1010 1100 1110 We want to build a circuit that has 3 binary inputs. This CKT is On if the inputs are X’Y’Z or X’YZ’. XYZXYZ Output

22. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-22 XOR gate: A XOR B= A.B’+A’.B A + B AB 000 011 101 110 ABAB ABAB A.B’+A’.B

23. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-23 DeMorgan's Law Converting AND to OR (with some help from NOT) Consider the following gate: AB 001110 011001 100101 110001 Same as A+B To convert AND to OR (or vice versa), invert inputs and output.

24. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-24 DeMorgan Law:  A+B= (A’. B’)’  A.B=(A’+B’)’ AB A’B’ A’.B’(A’.B’)’ 00 11 10 01 10 01 10 01 01 11 00 01 OR Truth table AB A’B’ A’+B’(A’+B’)’ 00 11 10 01 10 10 10 01 10 11 00 01 AND Truth table

25. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-25 A’.B = (A+B’)’

26. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-26 Build the following logical expression using AND, Not Gates only: F=X.Y+Z’ =((X.Y)’.Z’’)’ =((X.Y)’.Z)’ Another example: F= XYZ+Y’Z+XZ’ = ( (XYZ)’.(Y’Z)’.(XZ’)’ )’

27. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-27 From Demorgans law A+B= (A’.B’)’ (A+B)’= (A’.B’)’’=A’.B’ A.B= (A’+B’)’ (A.B)’= (A’+B’)’’=A’+B’

28. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-28 Simplify the following boolean expression F= (A’BC + C + A + D )’ = ( A’BCC’ + (A’BC)’C +A+D)’ = ( A’B. 0 + (A’BC)’C +A+D)’ = ( 0 + (A’BC)’C +A+D)’ = ( (A+B’+C’)C+A+D)’ = ( AC+B’C+C’C+A+D)’ = ( AC+B’C+ 0 + A +D)’ = (AC+A + B’C + D)’ = ( A + B’C + D)’ = A’ (B’C)’ D’ = A’ D’( B+C’) = A’BD’+A’C’D’

29. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-29 Simplification using boolean algebra: We have the following truth table for logical circuit and we want to implement this in the minimum number of gates: ABCF 0000 0011 0100 0111 1001 1011 1101 1110 F=A’B’C+A’BC+AB’C’+AB’C+ABC’ = A’B’C+A’BC+AB’(C+C’)+ABC’ = A’C(B+B’) +AB’ +ABC’ = A’C+AB’+AC’(B+B’) ;we can reuse AB’C’ =A’C+AB’+AC’

30. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-30 Another example: ABCF 0000 0011 0100 0111 1000 1011 1101 1111 F=A’B’C+A’BC+AB’C+ABC’+ABC = A’C(B+B’)+AB’C+ABC’+ABC = A’C + AC(B’+B) +ABC’ = A’C+AC+ AB(C+C’) =A’C+AC+AB = C(A+A’)+AB = C+AB

31. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-31 Karnaugh Maps Karnaugh map : is a representation for the truth table in a graphical way, which makes the simplification of any boolean function easier. For 3 input boolean function the Karnaugh map will be as follows : 00011110 0 A’B’C’ 000 A’B’C 001 A’BC 011 A’BC’ 010 1 AB’C’ 100 AB’C 101 ABC 111 ABC’ 110 A BC As we can see, each cell represent one raw of the truth table Next step is to fill the map using the truth table output.

32. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-32 Simplification using Karnaugh: Let us resolve the previous examples using karnaugh map: ABCF 0000 0011 0100 0111 1001 1011 1101 1110 00011110 0 0110 1 1101 A BC F=A’C+B’C+AC’

33. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-33 Resolve the same example in another way: 00011110 0 0110 1 1101 BC F=A’C+AB’+AC’

34. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-34 Karnaugh map for 4 input boolean function AB CD 00011110 000 0000 1 0001 3 0011 2 0010 014 0100 5 0101 7 0111 6 0110 1112 1100 13 1101 15 1111 14 1110 108 1000 9 1001 11 1011 10 1010

35. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-35 Assume we have the boolean function F with 4 inputs: F(A,B,C,D)= ∑ (0,1,4, 6, 8,11,13, 15)  Make the truth table for this function  Write the boolean equation for this function (Before simplification)  Simplify this function using karnaugh map technique  Draw the simplified equation. 00011110 0011 0111 1111 1011

36. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-36

37. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-37 Summary MOS transistors are used as switches to implement logic functions. N-type: connect to GND, turn on (with 1) to pull down to 0 P-type: connect to +2.9V, turn on (with 0) to pull up to 1 Basic gates: NOT, NOR, NAND Logic functions are usually expressed with AND, OR, and NOT Properties of logic gates Completeness  can implement any truth table with AND, OR, NOT DeMorgan's Law  convert AND to OR by inverting inputs and output

38. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-38 Building Functions from Logic Gates We've already seen how to implement truth tables using AND, OR, and NOT -- an example of combinational logic. Combinational Logic Circuit output depends only on the current inputs stateless Sequential Logic Circuit output depends on the sequence of inputs (past and present) stores information (state) from past inputs We'll first look at some useful combinational circuits, then show how to use sequential circuits to store information.

39. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-39 Decoder n inputs, 2 n outputs A B Y0Y0 1 Y1Y1 Y2Y2 Y3Y3 0000 0101 1 1010 1 1111 1

40. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-40 Decoder n inputs, 2 n outputs exactly one output is 1 for each possible input pattern 2-bit decoder

41. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-41 3x8 decoder 0 1 2 3 4 5 6 7

42. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-42 Build the following truth table using Decoder and OR gate ABCF 0000 0011 0100 0111 1001 1011 1101 1110 3x8 decoder 0 1 2 3 4 5 6 7

43. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-43 Multiplexer (MUX) n-bit selector and 2 n inputs, one output S 1 S 0 I0I1I2I3I0I1I2I3 0 0 1 0 1 1 1 0

44. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-44 Multiplexer (MUX) n-bit selector and 2 n inputs, one output output equals one of the inputs, depending on selector 4-to-1 MUX

45. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-45 Full Adder Add two bits and carry-in, produce one-bit sum and carry-out. S = A + B + C in C out = A.B+A.C+B.C ABC in C out S 00000 00101 01001 01110 10001 10110 11010 11111

46. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-46 Full Adder Add two bits and carry-in, produce one-bit sum and carry-out. ABC in SC out 00000 00110 01010 01101 10010 10101 11001 11111 3x8 decoder 0 1 2 3 4 5 6 7 A B C in S C

47. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-47 Four-bit Adder

48. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-48 Combinational vs. Sequential Combinational Circuit always gives the same output for a given set of inputs  ex: adder always generates sum and carry, regardless of previous inputs Sequential Circuit stores information output depends on stored information (state) plus input  so a given input might produce different outputs, depending on the stored information example: ticket counter  advances when you push the button  output depends on previous state useful for building “memory” elements and “state machines”

49. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-49 R-S Latch: Simple Storage Element R is used to “reset” or “clear” the element – set it to zero. S is used to “set” the element – set it to one. If both R and S are one, out could be either zero or one. “quiescent” state -- holds its previous value note: if a is 1, b is 0, and vice versa 1 0 1 1 1 1 0 0 1 1 0 0 1 1

50. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-50 Clearing the R-S latch Suppose we start with output = 1, then change R to zero. Output changes to zero. Then set R=1 to “store” value in quiescent state. 1 0 1 1 1 1 0 0 1 0 1 0 0 0 1 1

51. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-51 Setting the R-S Latch Suppose we start with output = 0, then change S to zero. Output changes to one. Then set S=1 to “store” value in quiescent state. 1 1 0 0 1 1 0 1 1 1 0 0

52. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-52 R-S Latch Summary R = S = 1 hold current value in latch S = 0, R=1 set value to 1 R = 0, S = 1 set value to 0 R = S = 0 both outputs equal one final state determined by electrical properties of gates Don’t do it!

53. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-53 Gated D-Latch Two inputs: D (data) and WE (write enable) when WE = 1, latch is set to value of D  S = NOT(D), R = D when WE = 0, latch holds previous value  S = R = 1

54. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-54 Register A register stores a multi-bit value. We use a collection of D-latches, all controlled by a common WE. When WE=1, n-bit value D is written to register.

55. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-55 Representing Multi-bit Values Number bits from right (0) least significant bit LSb to left (n-1) most significant bit MSb just a convention -- could be left to right, but must be consistent Use brackets to denote range: D[l:r] denotes bit l to bit r, from left to right May also see A, A 14:9 especially in hardware block diagrams. A = 0101001101010101 A[2:0] = 101 A[14:9] = 101001 0 15

56. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-56 Memory Now that we know how to store bits, we can build a memory – a logical k × m array of stored bits. k = 2 n locations m bits Address Space: number of locations (usually a power of 2) Addressability: number of bits per location (e.g., byte-addressable)

57. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-57 2 2 x 3 Memory address decoder word select word WE address write enable input bits output bits 1 0 1 00 1

58. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-58 2 2 x 3 Memory address decoder word select word WE address write enable input bits output bits 1 0 0 00 0 1 0 1

59. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-59 IF we want to build a memory of size 1024 word each word 8 bit a)What is the size of the decoder needed b)How many d- flip flops do we need c)How many And Gates do we need d)How many OR gates do we need e)How many inputs for the OR gates needed

60. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-60 More Memory Details This is not the way actual memory is implemented. fewer transistors, much more dense, relies on electrical properties But the logical structure is very similar. address decoder word select line word write enable Two basic kinds of RAM (Random Access Memory) Static RAM (SRAM) fast, maintains data without power Dynamic RAM (DRAM) slower but denser, bit storage must be periodically refreshed Also, non-volatile memories: ROM, PROM, flash, …

61. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-61 State Machine Another type of sequential circuit Combines combinational logic with storage “Remembers” state, and changes output (and state) based on inputs and current state State Machine Combinational Logic Circuit Storage Elements InputsOutputs

62. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-62 Combinational vs. Sequential Two types of “combination” locks 4184 30 15 5 1020 25 Combinational Success depends only on the values, not the order in which they are set. Sequential Success depends on the sequence of values (e.g, R-13, L-22, R-3).

63. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-63 State The state of a system is a snapshot of all the relevant elements of the system at the moment the snapshot is taken. Examples: The state of a basketball game can be represented by the scoreboard.  Number of points, time remaining, possession, etc. The state of a tic-tac-toe game can be represented by the placement of X’s and O’s on the board.

64. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-64 State of Sequential Lock Our lock example has four different states, labelled A-D: A: The lock is not open, and no relevant operations have been performed. B:The lock is not open, and the user has completed the R-13 operation. C:The lock is not open, and the user has completed R-13, followed by L-22. D:The lock is open.

65. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-65 State Diagram Shows states and actions that cause a transition between states.

66. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-66 Finite State Machine A description of a system with the following components: 1.A finite number of states 2.A finite number of external inputs 3.A finite number of external outputs 4.An explicit specification of all state transitions 5.An explicit specification of what causes each external output value. Often described by a state diagram. Inputs may cause state transitions. Outputs are associated with each state (or with each transition).

67. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-67 The Clock Frequently, a clock circuit triggers transition from one state to the next. At the beginning of each clock cycle, state machine makes a transition, based on the current state and the external inputs. Not always required. In lock example, the input itself triggers a transition. “1” “0” time  One Cycle

68. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-68 Implementing a Finite State Machine Combinational logic Determine outputs and next state. Storage elements Maintain state representation. State Machine Combinational Logic Circuit Storage Elements InputsOutputs Clock

69. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-69 Storage: Master-Slave Flipflop A pair of gated D-latches, to isolate next state from current state. During 1 st phase (clock=1), previously-computed state becomes current state and is sent to the logic circuit. During 2 nd phase (clock=0), next state, computed by logic circuit, is stored in Latch A.

70. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-70 Storage Each master-slave flipflop stores one state bit. The number of storage elements (flipflops) needed is determined by the number of states (and the representation of each state). Examples: Sequential lock  Four states – two bits Basketball scoreboard  7 bits for each score, 5 bits for minutes, 6 bits for seconds, 1 bit for possession arrow, 1 bit for half, …

71. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-71 Complete Example A blinking traffic sign No lights on 1 & 2 on 1, 2, 3, & 4 on 1, 2, 3, 4, & 5 on (repeat as long as switch is turned on) DANGER MOVE RIGHT 1 2 3 4 5

72. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-72 Traffic Sign State Diagram State bit S 1 State bit S 0 Switch on Switch off Outputs Transition on each clock cycle.

73. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-73 Traffic Sign Truth Tables Outputs (depend only on state: S 1 S 0 ) S1S1 S0S0 ZYX 00000 01100 10110 11111 Lights 1 and 2 Lights 3 and 4 Light 5 Next State: S 1 ’S 0 ’ (depend on state and input) InS1S1 S0S0 S1’S1’S0’S0’ 0XX00 10001 10110 11011 11100 Switch Whenever In=0, next state is 00.

74. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-74 Traffic Sign Logic Master-slave flipflop

75. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-75 From Logic to Data Path The data path of a computer is all the logic used to process information. See the data path of the LC-2 on next slide. Combinational Logic Decoders -- convert instructions into control signals Multiplexers -- select inputs and outputs ALU (Arithmetic and Logic Unit) -- operations on data Sequential Logic State machine -- coordinate control signals and data movement Registers and latches -- storage elements

76. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Wael Qassas/AABU 3-76 LC-2 Data Path