# p1.4 - 2 n, but in this case, we have replaced all AND...

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

Daniel Mihai Problem 1.4 Binary comparator for 3 1-bit numbers

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

View Full Document
a 1 b 1 c 1 . . . . a n b n c n a n . . . . . a 2 a 1 a n . . . . . a 2 a 1 x 1 . . . . x n Binary comparator for 3 n-bit numbers n-ary AND
a b The depth of the circuit is 7+2*log 2 n because a a n-ary AND made from AND gates has depth log

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

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

Unformatted text preview: 2 n, but in this case, we have replaced all AND gates with 2 NAND gates. For the second part, we first create a Binary comparator for 2 1-bit numbers a 1 b 1 . . a n b n c 1 b 1 . . c n b n a 1 c 1 . . a n c n The circuit has now depth 11+2*log 2 n....
View Full Document

## This note was uploaded on 04/14/2010 for the course CS 320102 taught by Professor M.k during the Spring '10 term at Jacobs University Bremen.

### Page1 / 4

p1.4 - 2 n, but in this case, we have replaced all AND...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online