Assignment 2 Solution - EE 2000 Logic Circuit Design...

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

View Full Document Right Arrow Icon
EE 2000 Logic Circuit Design, Semester A, 2007/08 Assignment 2 Solution Question 1: (a) A B C D f 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 1 1 0 0 1 0 0 0 0 1 0 1 0 0 1 1 0 0 0 1 1 1 1 1 0 0 0 0 1 0 0 1 0 1 0 1 0 0 1 0 1 1 1 1 1 0 0 0 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 f(A, B, C, D) = Σ m (0, 7, 11, 13, 14, 15) (b) AB CD 00 01 11 10 00 1* 01 1* 11 1* 1 1* 10 1* f(A, B, C, D) = ABC + ABD + ACD + BCD + A’B’C’D’ A B C D f
Background image of page 1

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

View Full DocumentRight Arrow Icon
Question 2: Note: This question has more than one solutions The result of the adder is overflow if the sum of two positive numbers is a negative number, or the sum of two negative numbers is a positive number. Therefore, we only need to consider the MSB columns of the operands. Solution 1 for Ripple Carry Adder: Assign A 3 as the MSB of the first input number, B 3 as the MSB of the second input number and S 3 as the MSB of the output sum. Assign E as the output such that it will produce 1 if overflow is detected. The result can be formulated by a truth table:
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 note was uploaded on 01/11/2011 for the course EE 2000 taught by Professor Vancwting during the Fall '07 term at City University of Hong Kong.

Page1 / 6

Assignment 2 Solution - EE 2000 Logic Circuit Design...

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