HW5_solution - ECE 2504 Introduction to Computer...

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

View Full Document Right Arrow Icon
1 ECE 2504 Introduction to Computer Engineering, Fall 2007 Homework 5 Due date: 28 Sep 07, 1:25pm Show all work. 1. (4 pts) Simplify the following Boolean function G together with the don’t care conditions d in product-of-sums form using a K-map. Draw the logic diagram. G(m,n,p,q)= m'n’pq+m’npq+mn’pq’+mn’pq+mnp’q’+mnpq’+mnpq d(m,n,p,q)= m’n’p’q+m’nq’+mn’p’q pq mn 00 01 11 10 00 0 X 1 0 01 X 0 1 X 11 1 0 1 1 10 0 X 1 1 G’ = m’q’+n’p’+p’q G = (m+q)(n+p)(p+q’) m n p q OR m n p q 2. (3 pts) Repeat problem 1 using sum-of-products form. pq mn 00 01 11 10 00 0 X 1 0 01 X 0 1 X 11 1 0 1 1 10 0 X 1 1 G = mp+nq’+pq
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 m p n q OR m p n q 3. (6 pts) A sequential circuit has two D flip flops A and B, two inputs x and y, and one output z. The flip flop input equations and the circuit output are as follows. D A = xy’ + x’A D B = x’B +yA’ z = A + B Draw the logic diagram. Complete the state table. D C Q A D C Q B x y z Present State Inputs Next State Output A B X Y A B z 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 0
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.

Page1 / 6

HW5_solution - ECE 2504 Introduction to Computer...

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