This preview shows pages 1–3. 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: design. (20%) show all your work S1 S0 Operation 0 0 A0+B0 0 1 A1+B1 1 0 A2+B2 1 1 A3+B3 3. Design the simplest circuit that determines how many of the bits in a 3-bit unsigned number are equal to 1. Block diagram(s) of devices may be used in your design. (10%) - show all your work Previous Carry in FA A B Sum Carry out storage EECE - Sections 101 &102 - midterm Dr. Panos Nasiopoulos 3 4. Design a binary adder which can perform the operation A+B. Assume that A and B are two binary numbers stored in sign magnitude (4-bits total like the table shown in the lectures). The locations A and B (shown in the figure below) store signed numbers. Your result should be stored in signed magnitude in location C (see figure below). If at any point there is an OVERFLOW make the contents of C equal to zero. Use Full-Adders and external gates. (40%) - show all your work A B C...
View Full Document
- Spring '10