This preview shows page 1. Sign up to view the full content.
Unformatted text preview: d) Using a K-Map, minimize the equation e) Draw the resulting circuit f(A,B,C,D) = (AD + /AC)(/B(C + B/D)) f(X,Y) = !( !(X* !(XY)) * !(Y * !(XY))) f(A,B,C) = /A/B/C + A/B/C + /A/BC 3) Design the logic for the overflow bit of an adder. Hint: The inputs are the topmost bits of the inputs and the topmost bit of the result. a) Determine the truth table b) Simplify using either boolean algebra or a K-map c) Draw the resulting circuit...
View Full Document
This note was uploaded on 12/27/2011 for the course CMPSC 30 taught by Professor Franklin during the Fall '09 term at UCSB.
- Fall '09