This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Add the representations with an n-bit adder. If the carry-out of the adder is 1, add 1 to the result of the addition and discard the carry-out. Remember that, in the ones-complement system, is also a representation of 0. b. Show that the second step of the operation can be implemented by connecting signal to the adder input , as shown in Figure 10.21. This is a combinational network with a loop, so it is necessary to verify that the operation is combinational. 4. Ex. 10.21 Design a 32-bit tree comparator using 4-bit modules....
View Full Document
This note was uploaded on 04/02/2012 for the course EE EEM16 taught by Professor Cabriv during the Fall '11 term at UCLA.
- Fall '11
- Electrical Engineering