258A2 - CSC258 Computer Organization 2009 Fall Assignment 2...

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

View Full Document Right Arrow Icon
CSC258 Computer Organization 2009 Fall Assignment 2 due Thu.Nov.5 at 6pm in BA2220 1[20] Design a circuit to find the maximum of three binary natural numbers. The numbers are A = a n –1 a n –2 a n –3 ... a 2 a 1 a 0 B = b n –1 b n –2 b n –3 ... b 2 b 1 b 0 C = c n –1 c n –2 c n –3 ... c 2 c 1 c 0 and the result is X = x n –1 x n –2 x n –3 ... x 2 x 1 x 0 plus three more bits f g h that have the following meaning. f g h = 000 means the maximum is either A or B or C (they are all equal) f g h = 001 means the maximum is either A or B (those two are equal) f g h = 010 means the maximum is either A or C (those two are equal) f g h = 011 means the maximum is A f g h = 100 means the maximum is either B or C (those two are equal) f g h = 101 means the maximum is B f g h = 110 means the maximum is C f g h = 111 is unused One way to solve the problem is to find the maximum of two of the inputs, then find the maximum of that and the third input. But that circuit takes two passes through the bits
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/10/2010 for the course CSC CSC258 taught by Professor Hehner during the Fall '10 term at University of Toronto- Toronto.

Ask a homework question - tutors are online