HW3soln-2730-S11

# HW3soln-2730-S11 - EE 2730 HW 3 solutions 1 EE 2730 Homework 3 solutions Spring 2011 1 The state diagram below is for a 1s counting circuit with

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

EE 2730 — HW 3 solutions 1 EE 2730 — Homework 3 solutions Spring 2011 1. The state diagram below is for a 1’s counting circuit with two inputs, a and b , and one output, z . The label on each edge denotes the values of ab ; the number in each state circle is z . This circuit outputs 1 if the number of 1 inputs on a and b since reset is a multiple of 4, and outputs 0 otherwise. (a) Construct the state table. (b) For state assignment A = 00, B = 01, C = 11, D = 10, construct the state-assigned table. Let y 1 , y 0 denote the present state variables, and let Y 1 , Y 0 denote the next state variables. (c) Derive minimal Boolean expressions for Y 1 , Y 0 , and z . (a) present state next state output z inputs: ab 00 01 10 11 A A B B C 1 B B C C D 0 C C D D A 0 D D A A B 0 (b) present state y 1 y 0 next state, Y 1 Y 0 output z inputs: ab 00 01 10 11 00 00 01 01 11 1 01 01 11 11 10 0 11 11 10 10 00 0 10 10 00 00 01 0

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

View Full Document
EE 2730 — HW 3 solutions 2 (c) ! !
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 06/20/2011 for the course EE 2730 taught by Professor Desouza during the Spring '08 term at LSU.

### Page1 / 3

HW3soln-2730-S11 - EE 2730 HW 3 solutions 1 EE 2730 Homework 3 solutions Spring 2011 1 The state diagram below is for a 1s counting circuit with

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

View Full Document
Ask a homework question - tutors are online