Presentation is loading. Please wait.

Presentation is loading. Please wait.

Computer Organization & Programming Chapter 5 Synchronous Components.

Similar presentations


Presentation on theme: "Computer Organization & Programming Chapter 5 Synchronous Components."— Presentation transcript:

1 Computer Organization & Programming Chapter 5 Synchronous Components

2 Clocks Synchronization tool A clock allows separate circuits to do their work at precisely the same time.

3 Set Reset Latch (SR Latch)

4 Clocked latches Control exactly when the S or R input is provided

5 Clocked D latch No need for separate variables R, S since they are mutually exclusive. D and D’ provide the same effect.

6 Latch using Mux

7 Standard representations Latch loaded when clock is 1 Latch loaded when clock is 0 (Note inversion bubble on CK) Flip flop loaded when clock is changing from 0 to 1 (rising edge) Flip flop loaded when clock is changing from 1 to 0 (falling edge) Do we care? Not much. Just know that boxes that look like this hold a value

8 8-bit register Pin 1 drives clear on all the flip flops Pin 11 drives enable (CK) on all. Pin 11’s inverter serves as an amplifier also.

9 FF with asynchronous Set & Reset

10 Shift Register

11 Right-Left Shift Register

12 Synchronous Up-Counter

13 Synchronous Up-Counter + Count Enable and Parallel Load

14 Sequential Circuits So far, all outputs have been determined completely by the current input. Having a clock pulse allows us to determine the time at which each circuit fires. Circuits that allow the output of a circuit to become an input to the next iteration of the circuit are called sequential circuits. A sequential logic unit is also known as a Finite State Machine

15 Finite State Machines A finite state machine takes an input and a current state and produces an output and a next state

16 Classical model of FSM Abstraction of a delay mechanism. This will hold the value of the state output and release it as input in the next cycle.

17 Example – Pseudo Random Numbers

18 FSM for the Pseudo Random Numbers

19 FSM by a Graph

20 FSM – Formal Definition

21 State Transition Diagram

22 Example Look for the sequence ‘110’ (output ‘1’ when found) Step 1 – Build the Graph

23 Step 2 – write transition table

24 Step 3 – Allocate State Values

25 Step 4 – Get Functions

26 Step 5 – Implement


Download ppt "Computer Organization & Programming Chapter 5 Synchronous Components."

Similar presentations


Ads by Google