hw13 - a i . . . a &amp;amp;gt; b i . . . b if and only if...

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

- 1 - 1. (15 points) The logic diagram at left below shows an 8 bit ripple-borrow decrement circuit. Draw a logic diagram for an 8 bit borrow-lookahead decrement circuit, similar to the carry- lookahead increment circuit on page 13-17 of the notes. What is the worst-case propagation delay for your circuit, if all gates have a delay of 1 ns? What is the worst-case propagation delay for a 32 bit version of the circuit? How does this compare to a 32 bit version of the ripple-borrow circuit? 2. (10 points) We can define a comparison circuit based on the following observation.
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: a i . . . a &gt; b i . . . b if and only if a i &gt; b i or ( a i = b i and a i 1 . . . a &gt; b i 1 . . . b ) Draw a schematic of a four bit comparison circuit made from four identical elements connected in a linear arrangement, based on this observation. CSE 260 Digital Computers: Organization and Logical Design Homework 13 Jon Turner April 22, 2008 X D X 1 D 1 X 2 D 2 X 3 D 3 X 4 D 4 X 5 D 5 X 6 D 6 X 7 D 7 decrement...
View Full Document

Ask a homework question - tutors are online