Scribd
Upload
22 views6 pages

Understanding Signed Binary Numbers

This document discusses signed binary numbers. It explains that signed binary uses the leftmost bit as the sign bit, with 0 representing positive and 1 representing negative. It provides an example of a 4-bit signed binary number table. Additionally, it outlines the rules for addition and subtraction of signed binary numbers in 2's complement form, including examples.

Uploaded by

utkarsh
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
22 views6 pages

Understanding Signed Binary Numbers

This document discusses signed binary numbers. It explains that signed binary uses the leftmost bit as the sign bit, with 0 representing positive and 1 representing negative. It provides an example of a 4-bit signed binary number table. Additionally, it outlines the rules for addition and subtraction of signed binary numbers in 2's complement form, including examples.

Uploaded by

utkarsh
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

Digital Electronics

(KOE-039)

Unit 1-Digital Systems and Binary Numbers


Topic- Signed Binary Numbers

Digital Logic Design Ch1-1


Content
 Signed Binary Numbers

Digital Logic Design Ch1-2


Signed Binary Numbers
 To represent negative integers, we need a notation for negative
values.
 It is customary to represent the sign with a bit placed in the
leftmost position of the number since binary digits.
 The convention is to make the sign bit 0 for positive and 1 for
negative.
 Example:

 Table 1.3 lists all possible four-bit signed binary numbers in the
three representations.
Digital Logic Design Ch1-3
Signed Binary Numbers

Digital Logic Design Ch1-4


Signed Binary Numbers
 Arithmetic addition
 The addition of two numbers in the signed-magnitude system follows the rules of
ordinary arithmetic. If the signs are the same, we add the two magnitudes and
give the sum the common sign. If the signs are different, we subtract the smaller
magnitude from the larger and give the difference the sign if the larger magnitude.
 The addition of two signed binary numbers with negative numbers represented in
signed-2's-complement form is obtained from the addition of the two numbers,
including their sign bits.
 A carry out of the sign-bit position is discarded.
 Example:

Digital Logic Design Ch1-5


Signed Binary Numbers
 Arithmetic Subtraction
 In 2’s-complement form:

1. Take the 2’s complement of the subtrahend (including the sign bit)
and add it to the minuend (including sign bit).
2. A carry out of sign-bit position is discarded.

( A)  (B)  ( A)  (B)
( A)  (B)  ( A)  (B)

 Example:
( 6)  ( 13) (11111010  11110011)
(11111010 + 00001101)
00000111 (+ 7)
Digital Logic Design Ch1-6

You might also like