Scribd
Upload
77 views14 pages

Lecture 2-Chapter - 1 - Digital - Systems - and - Binary - Numbers

The document discusses different number systems including binary, octal, hexadecimal and their conversions. It explains how to convert between these number systems by representing groups of bits in their corresponding numeric values. For example, groups of 3 bits map to octal digits and groups of 4 bits map to hexadecimal digits. It also covers signed number representations using 1's complement and 2's complement, and how to perform addition and subtraction for signed binary numbers using these complement representations.

Uploaded by

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

Lecture 2-Chapter - 1 - Digital - Systems - and - Binary - Numbers

The document discusses different number systems including binary, octal, hexadecimal and their conversions. It explains how to convert between these number systems by representing groups of bits in their corresponding numeric values. For example, groups of 3 bits map to octal digits and groups of 4 bits map to hexadecimal digits. It also covers signed number representations using 1's complement and 2's complement, and how to perform addition and subtraction for signed binary numbers using these complement representations.

Uploaded by

muhammad khubab
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

Binary − Octal Conversion

Octal Binary
 8 = 23
 Each group of 3 bits represents an octal 0 000
digit 1 001
2 010
Assume Zeros
Example: 3 011

( 1 0 1 1 0 . 0 1 )2 4 100
5 101
6 110
( 2 6 . 2 )8 7 111

Works both ways (Binary to Octal & Octal to Binary)


Digital Logic Design Ch1-19
Binary − Hexadecimal Conversion
Hex Binary
 16 = 24 0 0000
1 0001
 Each group of 4 bits represents a 2 0010
hexadecimal digit 3 0011
4 0100
5 0101
Assume Zeros 6 0110
Example: 7 0111
8 1000
( 1 0 1 1 0 . 0 1 )2 9 1001
A 1010
B 1011
C 1100
D 1101
(1 6 . 4 )16 E 1110
F 1111

Works both ways (Binary to Hex & Hex to Binary)


Digital Logic Design Ch1-20
Octal − Hexadecimal Conversion
 Convert to Binary as an intermediate step

Example:
( 2 6 . 2 )8

Assume Zeros Assume Zeros

( 0 1 0 1 1 0 . 0 1 0 )2

(1 6 . 4 )16

Works both ways (Octal to Hex & Hex to Octal)


Digital Logic Design Ch1-21
Decimal, Binary, Octal and Hexadecimal
Decimal Binary Octal Hex
00 0000 00 0
01 0001 01 1
02 0010 02 2
03 0011 03 3
04 0100 04 4
05 0101 05 5
06 0110 06 6
07 0111 07 7
08 1000 10 8
09 1001 11 9
10 1010 12 A
11 1011 13 B
12 1100 14 C
13 1101 15 D
14 1110 16 E
15 1111 17 F

Digital Logic Design Ch1-22


1.5 Complements
 There are two types of complements for each base-r system: the radix complement and
diminished radix complement.
 Diminished Radix Complement - (r-1)’s Complement
◆ Given a number N in base r having n digits, the (r–1)’s complement of N is
defined as:
(rn –1) – N
 Example for 6-digit decimal numbers:
◆ 9’s complement is (rn – 1)–N = (106–1)–N = 999999–N
◆ 9’s complement of 546700 is 999999–546700 = 453299
 Example for 7-digit binary numbers:
◆ 1’s complement is (rn – 1) – N = (27–1)–N = 1111111–N
◆ 1’s complement of 1011000 is 1111111–1011000 = 0100111
 Observation:
◆ Subtraction from (rn – 1) will never require a borrow
◆ Diminished radix complement can be computed digit-by-digit
◆ For binary: 1 – 0 = 1 and 1 – 1 = 0 Digital Logic Design Ch1-23
Complements
 1’s Complement (Diminished Radix Complement)
◆ All ‘0’s become ‘1’s
◆ All ‘1’s become ‘0’s

Example (10110000)2
 (01001111)2
If you add a number and its 1’s complement …

10110000
+ 01001111
11111111

Digital Logic Design Ch1-24


Complements

 Radix Complement

The r's complement of an n-digit number N in base r is defined as


rn – N for N ≠ 0 and as 0 for N = 0. Comparing with the (r − 1) 's
complement, we note that the r's complement is obtained by adding 1
to the (r − 1) 's complement, since rn – N = [(rn − 1) – N] + 1.

 Example: Base-10

The 10's complement of 012398 is 987602


The 10's complement of 246700 is 753300

 Example: Base-2

The 2's complement of 1101100 is 0010100


The 2's complement of 0110111 is 1001001

Digital Logic Design Ch1-25


Complements
 2’s Complement (Radix Complement)
◆ Take 1’s complement then add 1
OR ◆ Toggle all bits to the left of the first ‘1’ from the right
Example:
Number:
1’s Comp.:
10110000 10110000
01001111
+ 1
01010000 01010000

Digital Logic Design Ch1-26


Complements

 Subtraction with Complements


◆ The subtraction of two n-digit unsigned numbers M – N in base r can be
done as follows:

Digital Logic Design Ch1-27


Complements

 Example 1.5
◆ Using 10's complement, subtract 72532 – 3250.

 Example 1.6
◆ Using 10's complement, subtract 3250 – 72532.

There is no end carry.

Therefore, the answer is – (10's complement of 30718) = − 69282.


Digital Logic Design Ch1-28
Complements

 Example 1.7
◆ Given the two binary numbers X = 1010100 and Y = 1000011, perform the
subtraction (a) X – Y ; and (b) Y − X, by using 2's complement.

There is no end carry.


Therefore, the answer is
Y – X = − (2's complement
of 1101111) = − 0010001.

Digital Logic Design Ch1-29


Complements

 Subtraction of unsigned numbers can also be done by means of the (r − 1)'s


complement. Remember that the (r − 1) 's complement is one less then the r's
complement.
 Example 1.8
◆ Repeat Example 1.7, but this time using 1's complement.

There is no end carry,


Therefore, the answer is Y –
X = − (1's complement of
1101110) = − 0010001.
Digital Logic Design Ch1-30
1.6 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-31
Signed Binary Numbers

Digital Logic Design Ch1-32

You might also like