CE/EE270

Introduction to Digital System Design

Chapter 1- Part b
Digital Systems and Binary Numbers
 Agenda
 Announcement (if any)
 Recap of Ch. 1-a
 Digital Systems
 Binary Numbers
 Number-base Conversions
 Octal and Hexadecimal Numbers
 Complements
 Signed Binary Numbers
 Binary Codes
 Binary Storage and Registers
 Binary Logic
Number Base Conversions
Evaluate
Magnitude
Octal
(Base 8)

Evaluate
Magnitude
Decimal Binary
(Base 10) (Base 2)

Hexadecimal
(Base 16)
Evaluate
Magnitude
Decimal Integer to Binary Conversion

 Divide the number by the ‘Base’ (=2)

 Take the remainder (either 0 or 1) as a binary digit
 Take the quotient and repeat the division
 Each time, the new remainder gives a more significant binary digit

Example: (13)10
Quotient Remainder Coefficient
13 / 2 = 6 1 d0 = 1
6 /2= 3 0 d1 = 0
3 /2= 1 1 d2 = 1
1 /2= 0 1 d3 = 1
Answer: (13)10 = (d3 d2 d1 d0)2 = (1101)2

MSB LSB
Decimal Fraction to Binary Conversion

 Multiply the fractional number by the ‘Base’ (=2)

 Take the integer part (either 0 or 1) as a binary digit
 Take the fractional part of the result and repeat the multiplication
 Each time, the new integer part gives a less significant binary digit

Example: (0.625)10
Integer Fraction Coefficient
0.625 * 2 = 1 . 25 a-1 = 1
0.25 * 2 = 0 . 5 a-2 = 0
0.5 *2= 1 . 0 a-3 = 1
Answer: (0.625)10 = (0.d-1 d-2 d-3)2 = (0.101)2

MSB LSB
Decimal to Octal Conversion
Example: (175)10
Quotient Remainder Coefficient
175 / 8 = 21 7 d0 = 7
21 / 8 = 2 5 d1 = 5
2 /8= 0 2 d2 = 2
Answer: (175)10 = (d2 d1 d0)8 = (257)8

Example: (0.3125)10
Integer Fraction Coefficient
0.3125 * 8 = 2 . 5 d-1 = 2
0.5 *8= 4 . 0 d-2 = 4
Answer: (0.3125)10 = (0.d-1 d-2 d-3)8 = (0.24)8
 Binary − Octal Conversion
 8 = 23
 Each group of 3 bits (starting from the
Octal Binary
fractional point) represents an octal
0 000
digit
should assume 1 001
zeros in the empty
digit positions! 2 010
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)

Binary − Hexadecimal Conversion
 16 = 24
 Each group of 4 bits (starting from the
Hex Binary
fractional point) represents a hexadecimal 0 0000
digit 1 0001
should assume 2 0010
zeros in the empty 3 0011
digit positions! 4 0100
Example:
5 0101
6 0110
( _ _ _1 0 1 1 0 . 0 1_ _ )2 7 0111
8 1000
9 1001
A 1010
B 1011
(1 6 . 4 )16 C 1100
D 1101
E 1110
F 1111
Works both ways (Binary to Hex & Hex to Binary)
Octal − Hexadecimal Conversion
 Convert to Binary as an intermediate step

Example:
( 2 6 . 2 )8
should assume
zeros in the empty should assume
digit positions! zeros in the empty
digit positions!
( _ _ 0 1 0 1 1 0 . 0 1 0 _ )2

( 1 6 . 4 )16

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

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
 Binary Logic
 Definition of Binary Logic
◆ Binary logic consists of binary variables and a set of logical operations.

◆ The variables are designated by letters of the alphabet,

such as A, B, C, x, y, z, etc.
◆ Each variable having two and only two distinct possible values: 1 and 0.

◆ Three basic logical operations: AND, OR, and NOT.

 Binary Logic
 Truth Tables, Boolean Expressions, and Logic Gates

AND OR NOT
x y z x y z x z
0 0 0 0 0 0 0 1
0 1 0 0 1 1 1 0
1 0 0 1 0 1
1 1 1 1 1 1

z=x•y=xy z=x+y z = x = x’

x x x
y z y z z
Binary Logic

13
Implementation with Switching Circuits

AND OR
 Binary Logic

 How are binary signals represented in hardware?

3
Logic 1
2
Undefined
1
Logic 0
0

Figure: Binary signals

 Binary Logic
 Logic gates
◆ Graphic Symbols and Input-Output Signals for Logic gates:

Fig. 1.4 Symbols for digital logic circuits

Figure: Input-Output signals for gates

 Binary Logic

 Logic gates
◆ Graphic Symbols and Input-Output Signals for Logic gates:

Figure: Gates with multiple inputs

 Complements
 There are two types of complements for each base-r system:
the radix complement and diminished radix complement.

1. Diminished Radix Complement - (r-1)’s Complement

◆ Given a number N with n digits, given in base r, 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 by subtracting
each digit from r-1
◆ For binary: 1 – 0 = 1 and 1 – 1 = 0
 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
 Complements
2. 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
 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: 10110000 10110000

Its 1’s Comp.: 01001111
+ 1
Its 2’s Comp.: 01010000 01010000
Subtraction with Complements
◆ The subtraction of two n-digit unsigned numbers M – N in base r can be
done as follows:
 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.

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

There is no end carry.

Therefore, the answer is
Y – X = − (2's complement
of 1101111) = − 0010001.
 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.
 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.
 Table 1.3 lists all possible four-bit signed binary numbers in the
three representations.
 Signed Binary Numbers
Example: Convert the unsigned 7-bit binary 9 to signed binary 9
 Unsigned 7-bit binary 9: 0001001
 Signed binary 9
◆ Step 1 : add a 0 as the MSB to 0001001 → 00001001
◆ 00001001 is +9
◆ Step 2: use one of the below 3 possible methods to get -9 (Table 1.3)
» Method 1: MSB 0 is changed to 1 to represent the negative sign
» Method 2: apply 1’s complement to 00001001
» Method 3: apply 2’s complement to 00001001

Table 1.3
Signed Binary Numbers
 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 of 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 using 2’s complement form:

 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)
 Binary Codes

 BCD Code
◆ A number with k decimal digits will
require 4k bits in BCD.
◆ Decimal 396 is represented in BCD
with 12bits as 0011 1001 0110, with
each group of 4 bits representing one
decimal digit.
◆ A decimal number in BCD is the
same as its equivalent binary number
only when the number is between 0
and 9.
◆ The binary combinations 1010
through 1111 are not used and have
no meaning in BCD.
 Binary Codes
 Example:
◆ Consider decimal 185 and its corresponding value in BCD and binary:

 BCD addition (if the result of a digit addition is greater than 9,

add 6 to the result of the digit addition)
 Example:
◆ Consider the addition of 184 + 576 = 760 in BCD:

 Decimal Arithmetic: (+375) + (-240) = +135

Hint 6: using 10’s of BCD

 Binary Codes
 Other Decimal Codes
 Binary Codes
 American Standard Code for Information Interchange (ASCII)
Character Code
 Binary Codes
 ASCII Character Code
 ASCII Character Codes

 American Standard Code for Information Interchange (Refer to Table 1.7)

 A popular code used to represent information sent as character-based data.
 It uses 7-bits to represent:
◆ 94 Graphic printing characters.
◆ 34 Non-printing characters.

 Some non-printing characters are used for text format (e.g. BS = Backspace, CR =
carriage return).
 Other non-printing characters are used for record marking and flow control (e.g.
STX and ETX start and end text areas).