Homework 3 Problems - Digital Electronics | EE 231, Assignments of Digital Electronics

Material Type: Assignment; Class: Digital Electronics; Subject: Electrical Engineering; University: New Mexico Institute of Mining and Technology; Term: Unknown 1989;

Typology: Assignments

Pre 2010

Uploaded on 08/08/2009

koofers-user-ax4
koofers-user-ax4 🇺🇸

9 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
EE 231 Fall 2007
________________________________________________________________________
Homework #3 Due October 3, 2007
5.1 Determine the decimal values of the following unsigned numbers:
(a) (0111011110)2
(b) (1011100111)2
(c) (3751)8
(d) (A25F)16
(e) (F0F0)16
5.3 Determine the decimal values of the following 2’s complement numbers:
(a) 0111011110
(b) 1011100111
(c) 1111111110
5.5 Perform the following operations involving eight-bit 2’s complement numbers and
indicate whether arithmetic overflow occurs. Check your answers by converting to
decimal sign-and-magnitude representation.
00110110 01110101 11011111
+01000101 +11011110 +10111000
------------ ------------ -----------
00110110 01110101 11011111
- 00101011 -11010110 -11101100
------------ ------------ -----------
5.7 Show that the circuit in Fig. 5.5 implements the full-adder specified in Fig. 5.4a.
5.10 In section 5.5.4 we stated that a carry-out signal, ck, from bit position k-1 of an adder
circuit can be generated as ck=xk yk sk, where xk and yk are inputs and sk is the sum
bit. Verify the correctness of this statement.
5.14 In Fig. 5.18 we presented the structure of a hierarchical carry-lookahead adder.
Show the complete circuit for a four-bit version of this adder, built using 2 two-bit
blocks.
pf2

Partial preview of the text

Download Homework 3 Problems - Digital Electronics | EE 231 and more Assignments Digital Electronics in PDF only on Docsity!

EE 231 Fall 2007


Homework #3 Due October 3, 2007 5.1 Determine the decimal values of the following unsigned numbers: (a) (0111011110) 2 (b) (1011100111) 2 (c) (3751) 8 (d) (A25F) 16 (e) (F0F0) 16 5.3 Determine the decimal values of the following 2’s complement numbers: (a) 0111011110 (b) 1011100111 (c) 1111111110 5.5 Perform the following operations involving eight-bit 2’s complement numbers and indicate whether arithmetic overflow occurs. Check your answers by converting to decimal sign-and-magnitude representation. 00110110 01110101 11011111 +01000101 +11011110 +


00110110 01110101 11011111

  • 00101011 -11010110 -

5.7 Show that the circuit in Fig. 5.5 implements the full-adder specified in Fig. 5.4a. 5.10 In section 5.5.4 we stated that a carry-out signal, ck, from bit position k-1 of an adder circuit can be generated as ck=xk  yk  sk, where xk and yk are inputs and sk is the sum bit. Verify the correctness of this statement. 5.14 In Fig. 5.18 we presented the structure of a hierarchical carry-lookahead adder. Show the complete circuit for a four-bit version of this adder, built using 2 two-bit blocks.

EE 231 Fall 2007


5.22 Suppose that we want to determine how many of the bits in a six-bit unsigned number are equal to 1. Design the simplest circuit that can accomplish this task. 5.24 Show a graphical interpretation of three-digit decimal numbers, similar to Fig. 5.12. The left-most digit is 0 for positive numbers and 9 for negative numbers. Verify the validity of your answer by trying a few examples of addition and subtraction. 5.27 consider the subtractions 26-27=99 and 18-34=84. Using the concepts presented in section 5.3.4, explain how these answers (99 and 84) can be interpreted as the correct signed results of these subtractions.