CPE 120

Digital Logic Design

Chapter 1
Digital Systems and Binary
Numbers
Outline of Chapter 1

• 1.1 Digital Systems

• 1.2 Binary Numbers
• 1.3 Number-base Conversions
• 1.4 Octal and Hexadecimal Numbers
• 1.5 Complements
• 1.6 Signed Binary Numbers
• 1.7 Binary Codes
• 1.8 Binary Logic
 Digital Systems and Binary Numbers

Digital age and information age

Digital computers
• General purposes
• Many scientific, industrial and commercial applications
• Digital systems
• Telephone switching exchanges
• Digital camera
• Electronic calculators, PDA's
• Digital TV
• Discrete information-processing systems
• Manipulate discrete elements of information
• For example, {1, 2, 3, …} and {A, B, C, …}…
 Analog and Digital Signal
• Analog system
• The physical quantities or signals may vary continuously over a specified range.
• Digital system
• The physical quantities or signals can assume only discrete values.
• Greater accuracy

X(t) X(t)

t t
Analog signal Digital signal
Binary Digital Signal

• An information variable represented by physical quantity.

• For digital systems, the variable takes on discrete values.
• Two level, or binary values are the most prevalent values.
• Binary values are represented abstractly by:
• Digits 0 and 1
V(t)
• Words (symbols) False (F) and True (T)
• Words (symbols) Low (L) and High (H)
• And words On and Off
Logic 1
• Binary values are represented by values or
ranges of values of physical quantities. undefine

Logic 0
t
Binary digital signal
 Decimal Number System
• Base (also called radix) = 10
• 10 digits { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 }
• Digit Position
2 1 0 -1 -2
• Integer & fraction
• Digit Weight 5 1 2 7 4
• Weight = (Base) Position
• Magnitude 100 10 1 0.1 0.01
• Sum of “Digit x Weight”
• Formal Notation

500 10 2 0.7 0.04

d2*B2+d1*B1+d0*B0+d-1*B-1+d-2*B-2

(512.74)10
 Octal Number System
• Base = 8
• 8 digits { 0, 1, 2, 3, 4, 5, 6, 7 }
• Weights
64 8 1 1/8 1/64
• Weight = (Base) Position
• Magnitude 5 1 2 7 4
• Sum of “Digit x Weight”
2 1 0 -1 -2
• Formal Notation 2 1 0 -1 -
5
2 *8 +1 *8 +2 *8 +7 *8 +4 *8

=(330.9375)10
(512.74)8
 Binary Number System
• Base = 2
• 2 digits { 0, 1 }, called binary digits or “bits”
• Weights
• Weight = (Base) Position
4 2 1 1/2 1/4
• Magnitude
• Sum of “Bit x Weight” 1 0 1 0 1
• Formal Notation
2 1 0 -1 -2
• Groups of bits 4 bits = Nibble 2 1 0 -1 -
1
2 *2 +0 *2 +1 *2 +0 *2 +1 *2
8 bits = Byte
=(5.25)10
(101.01)2
1011

11000101
 Hexadecimal Number System
• Base = 16
• 16 digits { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F }
• Weights
• Weight = (Base) Position 256 16 1 1/16 1/256
• Magnitude
• Sum of “Digit x Weight” 1 E 5 7 A
• Formal Notation 2 1 0 -1 -2
1 *162+14 *161+5 *160+7 *16-1+10 *16-2
=(485.4765625)10

(1E5.7A)16
The Power of 2
n 2n n 2n
0 20=1 8 28=256
1 21=2 9 29=512
2 22=4 10 210=1024 Kilo

3 23=8 11 211=2048
4 24=16 12 212=4096
5 25=32 20 220=1M Mega

6 26=64 30 230=1G Giga

7 27=128 40 240=1T Tera

Hexadecimal Addition
Use the addition table and follow the solution of the
following problems:

In this example each column is straight addition with no

carry. Now add the addend (78416) and the sum (BDA16) of
the previous problem:
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
Complements
• 1’s Complement (Diminished Radix Complement) 10110000
• All ‘0’s become ‘1’s
• All ‘1’s become ‘0’s + 01001111
Example (10110000)2
 (01001111)2 11111111
If you add a number and its 1’s complement …
 Complements
• 2’s Complement (Radix Complement)
• Take 1’s complement then add 1
• Toggle all bits to the left of the first ‘1’ from the right
OR
Example:
Number:
1’s Comp.:

10110000 10110000
01001111
+ 1
01010000 01010000
Complements

• Subtraction with Complements

• The subtraction of two n-digit unsigned numbers M – N in base r can be done
as follows:
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.
 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.
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.
Signed Binary Numbers
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)
 1.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

• Other Decimal Codes

 Binary Codes)
• Gray Code
• The advantage is that only bit in the code
group changes in going from one number
to the next.
• Error detection.
• Representation of analog data.
• Low power design.

000 001

010 011
100 101

110 111

1-1 and onto!!

 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, with
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

• Logic gates
• Graphic Symbols and Input-Output Signals for Logic gates:

Fig. 1.4 Symbols for digital logic circuits

Fig. 1.5 Input-Output signals for gates

• NAND Gate
This is a NOT-AND gate which is equal to an AND gate followed by a
NOT gate. The outputs of all NAND gates are high if any of the inputs
are low. The symbol is an AND gate with a small circle on the output.
The small circle represents inversion.

Or (AB)’
• NOR Gate
This is a NOT-OR gate which is equal to an OR gate followed by a NOT gate. The
outputs of all NOR gates are low if any of the inputs are high. The symbol is an
OR gate with a small circle on the output. The small circle represents inversion.

Or (A+B)’

X-OR Gate
The 'Exclusive-OR' gate is a circuit which will give a high output if its inputs
are different and give a low output if its inputs are same. An encircled plus sign
(⊕) is used to show the X-OR operation.
• X-NOR Gate
The 'Exclusive-NOR' gate circuit does the opposite to the X-OR gate.
It will give a high output if its inputs are same and give a low output
if its inputs are different. The symbol is an X-OR gate with a small
circle on the output.

or