Digital Logic Design I

Chapter 1
Digital Signals and Systems
Numbers System
 Digital versus Analog
• Digital
– OFF and ON states that can be represented using
0s and 1s (respectively).
• Analog
– Continuously varying
– Examples: temperature, pressure, velocity

4
 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, …}…
Digital vs. Analog

5
Analog Signal Voltages and Their Digital
Equivalents
Digital-to-Analog and Back Again

8
 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.
V(t)
• Binary values are represented abstractly by:
– Digits 0 and 1
– Words (symbols) False (F) and True (T) Logic 1
– Words (symbols) Low (L) and High (H)
– And words On and Off undefine

• Binary values are represented by values Logic 0

or ranges of values of physical quantities. t
Binary digital signal
 ANALOG-TO-DIGITAL CONVERSION

A digital signal is superior to an analog signal

because it is more robust to noise and can easily be
recovered, corrected and amplified. For this reason,
the tendency today is to change an analog signal to
digital data.

4.8
 Number Systems

• Number Systems?
• What are the different forms to represent the
number systems?
– Decimal
– Hexadecimal representation
– Binary representation
– Arithmetic Operations
 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 5 1 2 7 4

• Digit Weight 100 10 1 0.1 0.01
Position
– Weight = (Base)
• Magnitude
500 10 2 0.7 0.04
– Sum of “Digit x Weight”
d2*B2+d1*B1+d0*B0+d-1*B-1+d-2*B-2
• Formal Notation
(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
Position
– Weight = (Base) 5 1 2 7 4
• Magnitude 2
2
1
1
0
0
-1
-1
-2
-
5 *8 +1 *8 +2 *8 +7 *8 +4 *8
– Sum of “Digit x Weight” 2

• Formal Notation =(330.9375)10

(512.74)8
 Binary Number System
• Base = 2
– 2 digits { 0, 1 }, called binary digits or “bits”
• Weights 4 2 1 1/2 1/4
Position
– Weight = (Base) 1 0 1 0 1
• Magnitude 2
2
1
1
0
0
-1
-1
-2
-
1 *2 +0 *2 +1 *2 +0 *2 +1 *2
– Sum of “Bit x Weight” 2

• Formal Notation =(5.25)10

(101.01)2
• Groups of bits 4 bits = Nibble
1011
8 bits = Byte
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 256 16 1 1/1 1/25
6 6
Position
– Weight = (Base) 1 E 5 7 A
• Magnitude 2 1 0 -1 -2
1 *162+14 *161+5 *160+7 *16-1+10 *16-2
– Sum of “Digit x Weight”
=(485.4765625)10
• Formal Notation
(1E5.7A)16
Decimal, Binary, Octal and
Decimal
Hexadecimal
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
 Decimal (Integer) to Binary Conversion
• Divide the number by the ‘Base’ (=2)
• Take the remainder (either 0 or 1) as a
coefficient
• Take the(13)
Example: quotient
10 and repeat the division
Quotient Remainder Coefficient
13/ 2 = 6 1 a0 = 1
6 /2= 3 0 a1 = 0
3 /2= 1 1 a2 = 1
1 /2= 0 1 a3 = 1
Answer: (13)10 = (a3 a2 a1 a0)2 = (1101)2

MSB LSB
 Decimal (Fraction) to Binary
Conversion
• Multiply the number by the ‘Base’ (=2)
• Take the integer (either 0 or 1) as a coefficient
• Take the resultant fraction and repeat the
division
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.a-1 a-2 a-3)2 = (0.101)2

MSB LSB
 Binary to Decimal
• Technique
– Multiply each bit by 2n, where n is the “weight” of
the bit
– The weight is the position of the bit, starting from
0 on the right
– Add the results
 Example
• 1010112 => 1 x 20 = 1
1 x 21 = 2
0 x 22 = 0
1 x 23 = 8
0 x 24 = 0
1 x 25 = 32
• Total sum= 4310
•
 Decimal to Octal Conversion
Example: (175)10
Quotient Remainder Coefficient
175 / 8 = 21 7 a0 = 7
21 / 8 = 2 5 a1 = 5
2 /8= 0 2 a2 = 2
Answer: (175)10 = (a2 a1 a0)8 = (257)8

Example: (0.3125)10
Integer Fraction Coefficient
0.3125 * 8 = 2 . 5 a-1 = 2
0.5 *8= 4 . 0 a-2 = 4
Answer: (0.3125)10 = (0.a-1 a-2 a-3)8 = (0.24)8
 Octal to Decimal
• Technique
– Multiply each bit by 8n, where n is the “weight” of
the bit
– The weight is the position of the bit, starting from
0 on the right
– Add the results
 Example

7248 => 4 x 80 = 4
2 x 81 = 16
7 x 82 = 448
Total= 46810
 Decimal to Hexadecimal
• Technique
– Divide by 16
– Keep track of the remainder
Example
 Hexadecimal to Decimal
• Technique
– Multiply each bit by 16n, where n is the “weight”
of the bit
– The weight is the position of the bit, starting from
0 on the right
– Add the results
 Example

ABC16 => C x 160 = 12 x 1 = 12

B x 161 = 11 x 16 = 176
A x 162 = 10 x 256 = 2560
Total= 274810
 Binary − Octal Conversion
Octal Binary
• 8= 23
0 000
• Each group of 3 bits 1 001
represents an octal digit 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)

 Binary − Hexadecimal Conversion
Hex Binary
• 16 = 24 0
1
0000
0001
• Each group of 4 bits 2
3
0010
0011
represents a hexadecimal 4 0100
5 0101
digit
Example: Assume Zeros 6 0110
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)

 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)

Complements
Complements
 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.5
– Using 10's complement, subtract 72532 – 3250.

• Example 1.6
– Using 10's complement, subtractThere
3250is no
– 72532.
end carry.

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

 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.