CPSC 121: Models of Computation. Module 8: Sequential Circuits

Size: px

Start display at page:

Download "CPSC 121: Models of Computation. Module 8: Sequential Circuits"

Marjory Winifred Hunter
5 years ago
Views:

1 CPSC 121: Models of Computation

2 By the start of class, you should be able to race the operation of a DA (deterministic finitestate automaton) represented as a diagram on an input, and indicate whether the DA accepts or rejects the input. Deduce the language accepted by a simple DA after working through multiple example inputs. 2

3 Quiz 8 feedback: Very well done. Many fine answers to the push-button light question. We will revisit this problem soon. 3

4 1. Course Introduction???build a computer that is?able to 1. How can we?execute a user-defined program???????????? CPSC 121: the BIG questions: a) Computers execute instructions one at a time. b) hey need to remember values, unlike the circuits you designed in labs 1, 2, 3 and 4. c) hat is, a computer is a very large and very complicated sequential circuit. 4

5 By the end of this module, you should be able to: ranslate a DA into a sequential circuit that implements the DA. Explain how and why each part of the resulting circuit works. 5

6 Announcements: Pre-class quiz #9 is due hursday March 12th at 19:00. extbook sections: Epp, 4th edition: 5.1 to 5.4 Epp, 3rd edition: 4.1 to 4.4 Rosen, 6th edition: 4.1, 4.2 Rosen, 7th edition: 5.1, 5.2 Assignment #4 is due Monday March 16th at 17:00. 6

7 Announcements (continued): In-class test #2: Wednesday March 18th, 2015 ormat similar to that of in-class test #1. You can bring one 8.5 x 11in (21.59 x 27.94cm) two sided sheet of paper. No textbook, calculator or other electronic equipment is allowed. 7

8 Announcements (continued): Pre-class quiz #10 is tentatively due uesday March 31st at 19:00. extbook sections: Epp, 4th edition: 6.1, 7.1 Epp, 3rd edition: 5.1, 6.1 Rosen, 6th edition: 2.1, 2.3 up to the top of page 136. Rosen, 7th edition: 2.1, 2.3 down to the bottom of page

9 Module Summary Latches, toggles and flip-flops. Branch prediction. Other problems and exercises. 9

10 here are two types of inite-state Automata: hose whose output is determined solely by the final state (Moore machines). Used to match a string to a pattern. Input validation. Searching text for contents. Lexical Analysis: the first step in a compiler or an interpreter. (define (fun x) (if (<= x 0) 1 (* x (fun (- x 1))))) ( define ( fun x ) ( if ( <= x 0 ) 1 ( * x ( fun ( - x 1 ) ) ) ) ) 10

11 hose that produce output every time the state changes (Mealy machines). Examples: Simple ciphers raffic lights controller. Predicting branching in machine-language programs A circuit that implements a finite state machine of either type needs to remember the current state: It needs memory. 11

12 Recall the latch from lab #5: When en is low, the MUX retains its current value. When en is high, it changes its value to d instead. 12

13 Problem: Design a circuit that changes state every time a button is pushed.?? 13

14 What signal does the button generate? high low 14

15 Complete the circuit... Circuit to calculate the next state 15

16 What is wrong with our solution? a) We should have used XOR instead of NO. b) We designed an effective random bit generator. c) he delay introduced by the NO gate is too long. d) here is some other problem with the circuit. e) Nothing is wrong. 16

17 his toll booth has a similar problem. 17 rom MI 6.004, all 2002

18 Instead use this: P.S. Call this a bar, not a gate, or we'll tie ourselves in (k)nots. 18 rom MI 6.004, all 2002

19 he circuit version of this improved tollbooth is called a flip-flop: 19

20 And we get the following improved circuit for our button and light problem: 20

21 Module Summary Latches, toggles and flip-flops. Branch prediction. Other problems and exercises. 21

22 How do computers really execute programs? Programs written in a high-level language (Racket, Java) are translated into machine language. A machine-language program is a sequence of very simple instructions. Each instruction is a sequence of 0s and 1s. Each instruction also has a human-readable version Humans don't like looking at long sequences of 0s and 1s. he human-readable version is not actually part of the program. 22

23 Example (modified to make it easier to understand): (1) sum 0 (2) is n = 0? (3) if true go to 7 (4) sum sum + n (5) n n 1 (6) goto 2 Some instructions like instruction 3 may tell the computer that the next instruction to execute is not the next in the sequence (4), but elsewhere (7). 23

24 o speed things up, a modern computer starts executing an instruction before the previous one is finished. his means that when it is executing if true go to 7 it does not yet know if the condition is true, and hence does not know if the next instruction is sum sum + n or instruction number 7. 24

25 So we want to be able to predict the outcome. If we guess wrong, then we will ignore some of the work that was done. We will keep track of two pieces of information: What we will predict ( = not branch, = branch). How confident we are that we are correct ( = not very, = very). once we know if the branch was taken, we update this information. 25

26 How many states will the inite State Automaton have? a) 2 b) 4 c) 8 d) Another value less than 8. e) Another value larger than 8. 26

27 Let us fill out a truth table that describes the behaviour we want of the automaton. Current State Pred Conf? aken? Next State Pred Conf? 27

28 Hence we get the following DA: 28

29 How do we turn a DA into a circuit? Number the states, starting with 0, and figure out how many bits you need to store the state number. Number the inputs, starting with 0, and figure out how many bits you need to represent the input. Layout enough D flip-flops to store the state (one per bit). or each state, build a combinational circuit that computes the next state (and the output, if needed) given the input. Send all those into multiplexers, and use the current state as the control signal (so you only keep the correct one). Store the next state back into the D flip-flops. 29

30 he circuit will look like the following: Compute Output Next State circuits 30

31 Now let us complete the implementation using Logisim... 31

32 Module Summary Latches, toggles and flip-flops. Branch prediction. Other problems and exercises. 32

33 Real numbers: We can write numbers in decimal using the format (-)? d+ (.d+)? where the ( )? mean that the part in parentheses is optional, and d+ stands for 1 or more digits. Design a DA that will accept input strings that are valid real numbers using this format. You can use else as a label on an edge instead of listing every character that does not appear on another edge leaving from a state. 33

34 Real numbers (continued) hen design a circuit that turns a LED on if the input is a valid real number, and off otherwise. Hint: Logisim has a keyboard component you can use. Hint: my DA for this problem has 6 states. Design a DA for a vending machine that sells one of three items (lemon juice, whiteboard markers, and corn flour) for 35 each. It should accept 5, 10 and 25 coins, and does not need to return change. 34

CPSC 121: Models of Computation

CPSC 121: Models of Computation Unit 1 Propositional Logic Based on slides by Patrice Belleville and Steve Wolfman Last Updated: 2017-09-09 12:04 AM Pre Lecture Learning Goals By the start of the class,