Chapter5_3 - Chapter 5 (Lect 3) State Reduction Design...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Chapter 5 (Lect 3) State Reduction Design (Synthesis) Procedures D flip-flops JK flip-flops T flip-flops
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
State Reduction: The goal is to finds ways to reduce the number of states, without altering the input-output relationships. Accomplished using the state table Key: two states are equivalent if for each member of the set of inputs they give the same outputs and send the circuit into an equivalent next state. When two states are equivalent, one may be removed Procedure: 1. Look for two present states that go to the same next state when the same inputs are applied. 2. If they produce the same input/output combinations remove the redundant state. 3. Replace the removed redundant state symbol any where it appears as the next state in the state table with the symbol of the state that was kept. Note: A reduced number of states does not guarantee a reduction in the number of flip-flops or the complexity of the combinational logic for a circuit
Background image of page 2
State Reduction Example 1: current state next state x = 0 x = 1 output x = 0 x = 1 000 000 001 0 0 001 010 011 0 0 010 000 0 0 100 101 0 1 100 000 101 0 1 101 110 101 0 1 000 101 0 1 current state
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 20

Chapter5_3 - Chapter 5 (Lect 3) State Reduction Design...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online