Lesson4_5

# Lesson4_5 - Mealy and Moore Type Finite State Machines...

This preview shows pages 1–3. Sign up to view the full content.

Mealy and Moore Type Finite State Machines Objectives ± There are two basic ways to design clocked sequential circuits. These are using: 1. Mealy Machine, which we have seen so far. 2. Moore Machine. ± The objectives of this lesson are: 1. Study Mealy and Moore machines 2. Comparison of the two machine types 3. Timing diagram and state machines Mealy Machine ± In a Mealy machine, the outputs are a function of the present state and the value of the inputs as shown in Figure 1. ± Accordingly, the outputs may change asynchronously in response to any change in the inputs. Figure 1: Mealy Type Machine Mealy Machine ± In a Moore machine the outputs depend only on the present state as shown in Figure 2. ± A combinational logic block maps the inputs and the current state into the necessary flip-flop inputs to store the appropriate next state just like Mealy machine. ± However, the outputs are computed by a combinational logic block whose inputs are only the flip-flops state outputs. 1

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

View Full Document
± The outputs change synchronously with the state transition triggered by the active clock edge. Figure 2: Moore Type Machine Comparison of the Two Machine Types Consider a finite state machine that checks for a pattern of ‘10’ and asserts logic high when it is detected. ± ± ± ± ± ± ± ± The state diagram representations for the Mealy and Moore machines are
This is the end of the preview. Sign up to access the rest of the document.

## Lesson4_5 - Mealy and Moore Type Finite State Machines...

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

View Full Document
Ask a homework question - tutors are online