2 3 1 2 1 2 1 2 3 2 1 1 1 2 3 2

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 3) = 1. 2. 3 + 1. 2 + 1. 2 = 1. 2. 3 + 2( 1 + 1) = 1. 2. 3 + 2 = 2 + 1. 2. 3 = ( 2 + 2). ( 2 + 1. 3) = 1. ( 2 + 1. 3) = 2 + 1. 3 (b) Based on the minimal logic expression derived in part (a), drawing the logic circuit is straight forward. It requires two NOT gates to obtain complemented values of x1 and x3, one 2-input AND gate to compute the product term 1. 3 and one 2-input OR gate to compute the sum-of-products. Problem No. 4 We can use the truth table to solve this problem: x 0 0 0 0 1 1 1 1 y 0 0 1 1 0 0 1 1 z 0 1 0 1 0 1 0 1 x↑y 1 1 1 1 1 1 0 0 y↑z 1 1 1 0 1 1 1 0 (x ↑ y) ↑ z 1 0 1 0 1 0 1 1 x ↑ (y ↑ z) 1 1 1 1 0 0 0 1 By comparing the last two columns of the truth table, we can observe that the two functions are not...
View Full Document

This document was uploaded on 02/01/2014.

Ask a homework question - tutors are online