hw18_SLN - ECE 211 HW 18 SOLUTIONS p 1/8...

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

View Full Document Right Arrow Icon
ECE 211 HW 18 SOLUTIONS p 1/8 //home/vdimitrov/25851/b266c07e7470c2cb8e4d77c03734552efd6f2a06.doc HW 18 SOLUTIONS 1. (a) A Mealy circuit has one input X and one output Z. The output is asserted when the input pattern 101 is found. The 101 patterns may overlap. An input-output example is: X = 0 0 1 0 0 0 1 0 1 0 0 1 0 1 0 1 0 1 0 0 1 Z = 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 1 0 1 0 0 0 (i) Design a State Transition Diagram for this Mealy circuit. (ii) How many flip-flops do you need to realize your diagram? (b) A Moore circuit detects all 101 input patterns, overlap included. An input-output example is: X = 0 0 1 0 0 0 1 0 1 0 0 1 0 1 0 1 0 1 0 0 1 Z = 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 1 0 1 0 0 0 (i) Design a State Transition Diagram for this Moore circuit. (ii) How many flip-flops do you need to realize your diagram? Solution: (a) (i) States R: Reset, 0 most recently received. A: 1 most recently received. B: 10 most recently received. (a) (ii) Three states, need 2 flip-flops. (b) (i) States R: Reset, 0 most recently received. A: 1 most recently received. B: 10 most recently received. C: 101 most recently received. (b) (ii) Four states, need 2 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
ECE 211 HW 18 SOLUTIONS p 2/8 2. (a) A Mealy circuit examines its input X in non-overalpping 3-bit blocks. The output Z is asserted when the input pattern 101 is found in a block. An input-output example is: X = 0 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0 1 Z = 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 1 (i) Design a State Transition Diagram for this Mealy circuit. (ii) How many flip-flops do you need to realize your diagram? (b) Repeat, but for a Moore circuit. . An input-output example is: X = 0 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0 1 Z = 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 1 Solution: (a) (i) The diagram must: Count the input bits; Know whether or not we can reach 101. States:
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This homework help was uploaded on 04/17/2008 for the course ECE 211 taught by Professor Nestor during the Fall '07 term at Lafayette.

Page1 / 8

hw18_SLN - ECE 211 HW 18 SOLUTIONS p 1/8...

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

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