A Comparator Example

A Comparator Example - 2 of 2 6:43 PM 01 11 10 p i(x i y i...

This preview shows pages 1–2. Sign up to view the full content.

Mallard ECE 290: Computer Engineering I - Spring 2007 - Graded Web. .. https://mallard.cites.uiuc.edu/ECE290/webgrade.cgi?SessionID=mding3. .. 1 of 2 2/12/2007 6:43 PM Graded WebQuiz: A Comparator Example You have submitted this WebQuiz 1 time (including this time). You may submit this WebQuiz a total of 10 times and receive full credit. For this problem you will design a binary comparator. The circuit compares two binary numbers: X = x n-1 ... x 0 and Y = y n-1 ... y 0 . Each comparator cell takes inputs x i , y i , p i+1 , q i+1 and produces outputs p i and q i to the next cell to the right . The final outputs p 0 and q 0 should be the following: p0 q0 result 0 0 X > Y 0 1 X = Y 1 0 undefined 1 1 X < Y (a) The values of p n q n should be set to: 00 01 10 11 Don't Care (b) Complete the following K-maps for the Boolean function p i (x i , y i , p i+1 , q i+1 ) and q i (x i , y i , p i+1 , q i+1 ), using don't cares wherever appropriate. Notation: Denote don't cares by the letter "x".

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

View Full Document
Mallard ECE 290: Computer Engineering I - Spring 2007 - Graded Web. .. https://mallard.cites.uiuc.edu/ECE290/webgrade.cgi?SessionID=mding3.
This is the end of the preview. Sign up to access the rest of the document.