1 - Number System and Digital Logic

Chapter 1
Number System and Digital Logic

It is very important to understand various number systems and their conversion
process to understand microprocessor or microcontroller based hardware and
software (computer system in short). In this chapter the fundamental of the
numbering and coding systems are presented. After that procedure to use
different numbering system for different mathematics are also described. Besides
the numbering system digital logic and basic functional module are also
presented as a review.
1.1 Number System

Based on the purpose of the numbering system can be of two types, one that is
used by human beings and the other are used by computers. Human are using
mainly 10-based numbering system which is popularly known as decimal
numbering system. Computer systems only use 2-based or binary number
system. Some other number systems are also used for convenience to represent
binary numbers which are the 16-base hexadecimal, 8-base octal and binary
coded decimal (bcd). ASCII is another number system used to present different
characters in binary number.
1.1.1 Decimal Number

In this number system 10 different symbols are used to represent any number.
These symbols are different in different language, in English these symbols are
shown is based on their weight
English symbols for decimal number system:
Symbol
Name
Weight
0
Zero
Null
1
One
I
2
Two
II
3
Three
III
4
Four
IIII
5
Five
IIIII
6
7
8
Six Seven Eight
IIIII
IIIII
IIIII
I
II
III
MMI (Number System & Digital Logic)-GMA Ehsan ur Rahman
9
Nine
IIIII
IIII
Page 1
To count more than nine we repeat the above symbol and the number grows
form single digit to multiple digit. For multi-digit numbers the rightmost digit
changes with the increase of count keeping the left one fixed. Thus the second
right most digit increase when the right most digit ends to the last symbol 9.
Following example shows the use of the above ten symbol presenting decimal
numbers greater than nineDigit-1
Digit-2
Number
1
0
10
1
1
11
1
2
12
1
1
1
1
3
4
5
6
13 14 15 16
Digit-2 increase
1
7
17
1
8
18
1
9
19
2
2
2
2
0
1
2
3
20 21 22 23
Digit-1 increase
In the decimal number system 0 alone can not represent any quantity, but it
increase the weight ten times (x10) every time it added in the right position, such
as 10 represent ten, 100 represents 10x10, which is called hundred.
Mathematically this increase of weight is represented asN
10 , where N is the number of 0 added in the right position.

Following table summarizes the weights of 0 addition-
1
10
100
1000
10000
100000
1000000
1000000000
N
0
1
2
3
4
5
6
9
Weight
One
Ten
Hundred
Thousand
Ten thousand or Myriad
Hundred Thousand or Lakh
Million
Billion
So, the position of the symbol in a number carries different weight. Following
example shows the weight of the symbols in a number-
Page 2
Symbol
Digit-number
Weight
Value
3
1
5
x10
300000
4
2
4
x10
40000
5
3
3
x10
5000
6
4
2
x10
600
7
5
1
x10
70
8
6
0
x10
8
300000 + 40000 + 5000 + 600 + 70 + 8 = 345678
1.1.2 Binary Number

In binary number system only two symbols (0 and 1) are used to represent
any number. These two symbols indicate No and Yes or logic level low and
logic level High for digital computer system. Similar to the decimal system these
two symbols are repeated to represent numbers larger than one.
It is shown in the previous section that how easily we are using the decimal
number system. We will use the same rules for binary number system but using
only two symbols, which would be easier.
To represent number greater than one we need to repeat symbols and use more
than one digitNumber
000
001
010
011
100
101
110
111
Quantity Digit-1 Digit-2 Digit-3

Repeat of symbol
0
0
0
0
Digit-3
1
0
0
1
Digit-2
2
0
1
0
Digit-3
3
0
1
1
Digit-1
4
1
0
0
Digit-3
5
1
0
1
Digit-2
6
1
1
0
Digit-3
7
1
1
1
Position of 1 in a number gives it different weight, which is increased two times

(x2) every time. Mathematically it can be written asN-1
, where N is the number of digits in a number
Page 3
Following table shows the weight of the digits in a binary number

Position
(N-1)
Weight
11
10
10
2
1024
10
9
9
2
512
9
8
8
7
2
128
2
256
7
6
6
2
64
6
5
5
2
32
5
4
4
2
16
4
3
3
2
8
3
2
2
2
4
2
1
1
2
2
1
0
0
2
1
So, the number represented by the 8-digit binary number 11101010 can be find
out-
Symbol
Position
(N-1)
Weight
Value
1
8
7
x128
128
1
7
6
x64
64
1
6
5
x32
32
0
5
4
x16
0
1
4
3
x8
8
0
3
2
x4
0
1
2
1
x2
2
0
1
0
x1
0
128 + 64 + 32 + 0 + 8 + 0 + 2 + 0 = 234
1.1.2 Hexadecimal Number

Hexadecimal number system also called hex number system in short. As it is a
16-based number system it requires 16 symbols to represent any number. This
number system uses 6 (thus it is called hex) more symbols with the 10 symbol
used in the decimal number system, which are A, B, C, D, E and F. This
numbering system is actually implemented to shorten the binary number
representation.
Symbol
Weight
0
0
1
1
2
2
3
3
4
4
5
5
6
6
7
7
8
8
9 A B C D E F
9 10 11 12 13 14 15
So, any number greater than 15 needs more than one digit to be represented.
Position of every digit from the right to left has higher weight of 16 times (x16),
i.e.,
(N-1)
16
, where N is the digit number.
Page 4
Following table shows the weight of the digits of the hexadecimal number.
Position
(N-1)
Weight
4
3
3
16
4096
3
2
2
16
256
2
1
1
16
16
1
0
0
16
1
A 4-digit number ABCD represents 43981, which can be found as followsSymbol

Position
(N-1)
Weight
Value
A
4
3
x4096
40960
B
3
2
x256
2816
C
2
1
x16
192
D
1
0
x1
13
40960 + 2816 + 192 + 13 = 43981.
1.1.3 Octal Number

Octal number use eight symbols 0 to 7 of the decimal number systems. It is also
used to represent binary number. To represent any number greater than 7 needs
more than one digit. Every digit from right to left has higher weight of 8 times
(x8). The 4-digit octal-number 4567 represents the decimal 2423. Following table
shows the conversion-
Symbol
Position
(N-1)
Weight
Value
4
4
3
3
x8
4x512=2048
5
3
2
2
x8
5x64=320
6
2
1
1
x8
6x8=48
7
1
0
0
x8
7x1=7
2048 + 320 + 48 + 7 = 2423
Page 5
1.1.4 Number system notation

For easy understanding subscript notations are used to describe the number
system used for the representation. Followings are the notation
Number System
Decimal
Binary
Hexadecimal
Octal
Notation
x10 or d
x2 or b
x16 or h
x8 or o
Example
150x10 or 150d
10010110x2 or 10010110b
96x16 or 96h
226x8 or 226o
1.1.5 Number system relationship and conversion

In the following table above four different number systems are presented to show
their relationshipBin
0000
0001
0010
0011
0100
0101
0110
0111
1000
1001
1010
1011
1100
1101
1110
1111
Oct
0
1
2
3
4
5
6
7
10
11
12
13
14
15
16
17
Dec
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
Hex
0
1
2
3
4
5
6
7
8
9
A
B
C
D
E
F
Page 6
Hex to decimal conversion: Convert the hexadecimal number 4B3 to decimal

number.
Solution:
Symbol
Decimal weight
Digit Position
(N-1)
Hex weight
Value
4
4
3
2
2
x16
4x256=1024
B
11
2
1
1
x16
11x16=176
3
3
1
0
0
x16
3x1=3
1024 + 176 + 3 = 1203

Octal to decimal conversion: Convert 234 octal number to decimal.
Solution:
Symbol
Decimal weight
Digit Position
(N-1)
Hex weight
Value
2
2
3
2
2
x8
2x64=128
3
3
2
1
1
x8
3x8=24
4
4
1
0
0
x8
4x1=4
128 + 24 + 4 = 156
Binary to decimal conversion: Convert 11011011 to decimal.
Solution:
Symbol
Position
(N-1)
Weight
Value
1
8
7
x128
128
1
7
6
x64
64
0
6
5
x32
0
1
5
4
x16
16
1
4
3
x8
8
0
3
2
x4
0
1
2
1
x2
2
1
1
0
x1
1
128 + 64 + 0 + 16 + 8 + 0 + 2 + 1 = 219
Page 7
Decimal to hexadecimal conversion: Convert the decimal number 3315 to

hexadecimal number.
Solution:
Quotient Remainder Hexadecimal

3315/16 =
207
3
3
207/16 =
12
15
F
12/16 =
0
12
C (Stop when quotient = 0)
3315 = CF3
Decimal to binary conversion: Convert the decimal number 315 to binary

number.
Solution:
315/2 =
157/2 =
78/2 =
39/2 =
19/2 =
9/2 =
4/2 =
2/2 =
1/2 =
Quotient Remainder
157
1
78
1
39
0
19
1
9
1
4
1
2
0
1
0
0
1
315 = 100111011
Decimal to octal conversion: Convert the decimal number 315 to octal number.
Page 8
Solution:
315/8 =
39/8 =
4/8 =
Quotient Remainder
39
3
4
7
0
4
315 = 473
1.1.6 Binary Coded Decimal number (BCD)

Binary Coded Decimal number system is a combination of the binary number
system and decimal number system. In this system every 4-digit binary number
represents one digit of decimal number, i.e., every 4-digit binary number can
represent decimal 0 to 9. So, we need 4 digits more binary number to represent
2-digit decimal number. Following table shows the BCD numbers with other
number system.
Dec
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
Oct
0
1
2
3
4
5
6
7
10
11
12
13
14
15
16
17
Hex
0
1
2
3
4
5
6
7
8
9
A
B
C
D
E
F
Bin
0000
0001
0010
0011
0100
0101
0110
0111
1000
1001
1010
1011
1100
1101
1110
1111
BCD
0000
0001
0010
0011
0100
0101
0110
0111
1000
1001
0001 0000
0001 0001
0001 0010
0001 0011
0001 0100
0001 0101
Page 9
BCD number system is mainly used for HW interfacing with 7-segment display
module. As the 7-segment display module can display from 0 to 9 so only BCD
number system can be used to display the decimal number using 7-segment
display unit. There is another conversion required to make the BCD number
visible in a 7-segment display module, which will be described in the coming
sections.
1.2 Mathematics
Similar to decimal mathematics simple addition, subtraction, multiplication and
division can be done for binary, hex, octal and BCD numbers. For simplicity only
addition and subtraction of binary and hex numbers will be described.
1.2.1 Binary addition

For binary addition following simple rules should be used, which are0+0= 0
0+1= 1
1+0= 1
1 + 1 = 10
Following example shows addition of two binary numbers. Like decimal addition
same digit of two numbers will be added with each other and if there is any
overflow (over 9 in decimal number) will be added with the next left digit of the
upper (or left number).
st
1 5 1 Number
nd
+ 1 8 2 Number
---------3
1 as overflow
+1
---------33
st
nd
Step-1: digit-1 of result = digit-1 (1 number) + digit-1 (2 number)

5 + 8 = 13
Page 10
as 12 is greater than 9, only the first digit (here 3) of the result will be the
digit-1 of the result and second digit of the result (here 1) will be added
with the digit-2 of the first number.
digit-1 of the result is 3
overflow is 1
st
Step-2: digit-2 (1 number) of upper number + the overflow of step-1

st
digit-2 (1 number) with overflow = 1 + 1 = 2

st
Step-3: digit-2 of result = digit-2 (1 number with over flow) + digit-2 (2
nd
number)
2+1=3
digit-2 of result is 3
So, the complete result is 3 3
Now we will do the same for the binary representation of the above 2 numbers.
st
1 5 = 1 1 1 1 (1 number)
nd
1 8 = 1 0 0 1 0 (2 number)
st
Here the 1 number is of 4 digits and the 2

of these two numbers is
1111
+ 10010
--------------1
0
+
1
--------------001
+ 1
--------------0001
+1
--------------100001
nd
number is of 5 digits. Now, addition
--- 1 as overflow
--- 1 as overflow
--- 1 as overflow
33 in decimal
Page 11
st
nd
Step-1: digit-1 (1 number) + digit-1 (2 number) = 1 + 0 = 1, where 1 is the

digit-1 of the result and there is no overflow (or 0 overflow).
nd
st
Step-2: The 2 digit of the result will be, overflow of previous step + digit-2 (1
nd
number) + digit-2 (2 digit) = 0 + 1 + 1 = 1 0, where 0 is the digit-2 of the
result and 1 is the overflow.
Applying the same rule of step-2, the digit-3 of result will be, overflow of previous
st
nd
step + digit-3 (1 number) + digit-3 (2 number) = 1 + 1 + 0 = 1 0, where 0 is the
result and 1 is the overflow.
For the fourth digits, 1 + 1 + 0 = 1 0, 0 is the result and 1 is the overflow
For the fifth digits, 1 + __ + 1 = 1 0, as there is no more digit to left in the
numbers to add, result of this step is 1 0.
So, the complete result is, 1 0 0 0 0 1 (which is 33 in decimal).
1.2.2 Hex addition

The same rule can be applied to add two hex numbers. We also need the
following table of hex-addition:
+
1
2
3
4
5
6
7
8
9
A
B
C
D
E
F
A
B
C
D
E
F
10
11
12
13
14
15
16
17
18
19
B
C
D
E
F
10
11
12
13
14
15
16
17
18
19
1A
C
D
E
F
10
11
12
13
14
15
16
17
18
19
1A
1B
D
E
F
10
11
12
13
14
15
16
17
18
19
1A
1B
1C
E
F
10
11
12
13
14
15
16
17
18
19
1A
1B
1C
1D
F
10
11
12
13
14
15
16
17
18
19
1A
1B
1C
1D
1E
Page 12
Following example shows the addition of two hex numbers step by step.
2ABC
+ED53
---------------F
0
+ 1
---------------80F
+1
---------------1180F
st
(1 number)
nd
(2 number)
--- 1 as overflow
+ 1 overflow with digit-3
--- 1 as overflow
st
Step-1: digit-1 (1 number) + digit-2 (2

F without any overflow.
nd
number) = C + 3 = F, where the result is

st
nd
Step-2: overflow of previous step + digit-2 (1 digit) + digit-2 (2 digit) = 0 + B + 5

= B + 5 = 1 0, where 0 is the digit-2 of result and 1 is the overflow.
rd
st
Similarly for the 3 digits, overflow of previous step + digit-3 (1 digit) + digit-3
nd
(2 digit) = 1 + A + D = ( 1 + A ) + D = B + D = 1 8, where 8 is the digit-3 of result
and 1 is the overflow.
st
nd
And for the fourth digits, overflow of previous step + digit-4 (1 digit) + digit-4 (2
digit) = 1 + 2 + E = ( 1 + 2 ) + E = 3 + E = 1 1, as there is no more digits left in the
numbers, 1 1 is the result without any overflow.
So, the complete result = 1 1 8 0 F.
In the above examples we see that we get only 1 as overflow, but it can be more
than 1 while adding more than 2 numbers.
1.2.3 Binary subtraction

We can also perform binary subtraction in the same way we do for decimal
subtraction. We add 2 ( 10 in binary, as we add 10 10 for decimal subtraction)
Page 13
st
with the present digit of the the 1 number and add 1 with the next digit of the 2
number. We also need to know the following basic rules for binary subtraction-
nd
00=0
11=0
10=1
10 1 = 1
Following example shows the subtraction of a number from a larger number.
110101
- 101100
--------------------1
0
0
--------------------10
1
--------------------1001
--------------------11
- 11
-------------------01001
0
------------------001001
st
( 1 number, decimal 53 )
nd
( 2 number, decimal 44 )
th
st
Adding 2 (10) with 4 digit of 1 number

nd
digit-4 (2 number)
st
st
Digit-6 (1 number), digit-5 (1 number)

nd
nd
Digit-6 (2 number), digit-5 (2 number) + 1
Decimal 9
1.2.4 Hex subtraction

st
For hex subtraction, if any digit of the 1 number is smaller than the same digit of
nd
st
the 2 number, we need to add 10 hex (decimal 16) with that digit of the 1
nd
number and 1 hex with the next digit of the 2 number. Following example
shows subtraction of two hex numbers step by step.
Page 14
CDA3
2BF2
---------------1
---------------1A
F
---------------B1
---------------CD
- 2C
---------------1B1
A
---------------A1B1
st
52643 in decimal (1 number)

nd
11250 in decimal (2 number)
st
Digit-2 (1 number) + 10 hex

nd
Digit-2 (2 number)
st
st
Digit-4 (1 number), digit-3 (1 number)

nd
nd
Digit-4 (2 number), digit-3 (2 number) + 1
1.3 Digital Logic

As mentioned earlier, computer systems use binary number system because two
voltage levels (0v and +5v in general) can be represented by binary 0 and 1.
Logically any signal of 0v is considered as binary 0 and signal of 5v is considered
as binary 1. Practically binary 0 and 1 are not exactly limited to 0v and 5v, it
depends on the logic level of device type, for a 3.6v device 3v can be considered
as binary 1. Detail voltage levels of different devices are described in sub-section
1.6.2.
1.3.1 Logic Gate

Binary logics are implemented in some simple hardware called logic gates.
These logic gates have one or more than one logic inputs and one output per
gate, out put logic level changes according to the logic level of the input (s) and
the logical operation performed by the logic gate. There are 3 types of basic logic
gate; following table shows the logical operation of the basic logic gates
considering 2 inputs each-
Page 15
Gate
NOT Gate
OR Gate
AND Gate
Input (A,B)
0
1
00
01
10
11
00
01
10
11
AND Gate
Logical operation
Y = A
Y = A or B
Y=A+B
Y = A and B
Y = A.B
OR Gate
NAND Gate
Output (Y)
1
0
0
1
1
1
0
0
0
1
NOT Gate/ Inverter
NOR Gate
XOR Gate
Figure1: Basic Logic gate symbol
There are three logic gates which are derived from the three basic gates. These
are NOR, NAND, XOR (exclusive-or) and XNOR gate.
NAND gate and NOR gate are also called universal gate because we can derive
any logic using only NAND gates or NOR gates. OR, NOR, AND and NAND
gates can be of two or more than two inputs.
The Exclusive-OR, or XOR function is an interesting and useful variation on the
basic OR function. Verbally, it can be stated as, "Either A or B, but not both." The
XOR gate produces a logic 1 output only if its two inputs are different. If the
Page 16
inputs are the same, the output is a logic 0. Unlike other gates XOR and XNOR
can have only two inputs.
These derived gates and their logical operations are shown in the following table-
Gate
Derived from
NOR Gate
OR > NOT
NAND Gate
AND > NOT
XOR Gate
Multiple Gate
XNOR Gate
XOR > NOT
Input (A,B) Logical operation Output (Y)

00
1
01
Y = (A or B)
0
10
Y = (A + B)
0
11
0
00
1
01
Y = (A and B)
1
10
Y = (A . B)
1
11
0
00
0
01
1
Y = A (+) B
10
1
11
0
00
1
01
0
Y = (A (+) B)
10
0
11
1
1.3.2 Boolean algebra

For logic simplification and derivation Boolean algebra is very useful. Followings
are the rules of Boolean algebra.
AND Operations ():
00 = 0
10 = 0
01 = 0
11 = 1
A0 = 0
A1 = A
AA = A
AA' = 0
Page 17
OR Operations (+):
0+0 = 0
1+0 = 1
0+1 = 1
1+1 = 1
A+0 = A
A+1 = 1
A+A = A
A+A' = 1
NOT Operations ('):
0' = 1
1' = 0
A'' = A
Associative Law:
(AB)C = A(BC) = ABC

(A+B)+C = A+(B+C) = A+B+C
Distributive Law:
A(B+C) = (AB) + (AC)

A+(BC) = (A+B) (A+C)
Commutative Law:
AB = BA
A+B = B+A
Precedence:
AB = AB
AB+C = (AB) + C
A+BC = A + (BC)
DeMorgan's Theorem: (AB)' = A' + B' (NAND)

(A+B)' = A' B' (NOR)
1.4 Digital devices

Using the logic gates we can perform lot of logical and mathematical operations
like adder, selector etc. Various functional devices are also available as single
component to use. These devices are of following typesFlip-Flop
De-multiplexer
Buffer-Register
Timer-Counter
Decoder
Shift-register
Multiplexer
Encoder
A list of different type of digital logic and functional ICs is given in appendix A.
Page 18
1.4.1 Flip-flop
Flip-flop changes the output state based on the input state and (if any) clockpulse. Symbol and the characteristic tables for different flip-flops are shown
bellow.
Set-Reset Flip-flop (SR F/F): SR flip-flop is a simple latch, where S and R stand
for set and reset respectively. It can be constructed from a pair of cross-coupled
NAND or NOR logic gates. The stored bit is present on the output marked Q and
its complement Q. If S is pulsed high while R is held low, then the Q output is
forced high, and stays high even after S returns low; similarly, if R is pulsed high
while S is held low, then the Q output is forced low, and stays low even after R
returns low.
Symbol
S-R
0-0
0-1
1-0
1-1
Action
No change
Q=0
Q=1
Undefined/
Race condition
Q (t)
0
0
1
Q(t+1)
0
1
0
Toggle Flip-flop (T-F/F): If the T input is high, the T flip-flop changes state
("toggles") whenever the clock input receives a pulse. If the T input is low, the
flip-flop holds the previous value. When T is held high, the toggle flip-flop divides
the clock frequency by two; that is, if clock frequency is 4 MHz, the output
frequency obtained from the flip-flop will be 2 MHz. This 'divide by' feature has
application in various types of digital counters. A T flip-flop can also be built using
a JK flip-flop (J & K pins are connected together and act as T) or D flip-flop (T
input and Q is connected to the D input through an XOR gate).
Symbol
T
0
0
1
1
Q (t)
0
1
0
1
Q(t+1)
0
1
1
0
Action
No change
No change
Toggle
Toggle
Page 19
J-K Flip-flop (JK F/F): The JK flip-flop augments the behavior of the SR flip-flop
(J=Set, K=Reset) by interpreting the S = R = 1 condition as a "flip" or toggle
command. Specifically, the combination J = 1, K = 0 is a command to set the flipflop; the combination J = 0, K = 1 is a command to reset the flip-flop; and the
combination J = K = 1 is a command to toggle the flip-flop, i.e., change its output
to the logical complement of its current value. Setting J = K = 0 does NOT result
in a D flip-flop, but rather, will hold the current state. To synthesize a D flip-flop,
simply set K equal to the complement of J. The JK flip-flop is therefore a
universal flip-flop, because it can be configured to work as an SR flip-flop, a D
flip-flop, or a T flip-flop. This flip flop is positive edge triggered (Clock Pulse).
Symbol
J-K
0-0
Action
Hold
Q (t)
0
Q(t+1)
0
0-1
Reset
1-0
Set
1-1
Toggle
D Flip-flop (D F/F): The Q output always takes on the state of the D input at the
moment of a rising clock edge (or falling edge if the clock input is active low). It is
called the D flip-flop for this reason, since the output takes the value of the D
input or Data input, and Delays it by one clock count. The D flip-flop can be
interpreted as a primitive memory cell, zero-order hold, or delay line.
Symbol
Clock
Q (t)
Rising
Rising
Non Rising
No change
Q (t-1)
Master Slave D Flip-flop: A masterslave D flip-flop is created by connecting

two gated D latches in series, and inverting the enable input to one of them. It is
called masterslave because the second latch in the series only changes in
response to a change in the first (master) latch. For a positive-edge triggered
masterslave D flip-flop, when the clock signal is low (logical 0) the enable seen
Page 20
by the first or master D latch (the inverted clock signal) is high (logical 1). This
allows the master latch to store the input value when the clock signal transitions
from low to high. As the clock signal goes high (0 to 1) the inverted enable of
the first latch goes low (1 to 0) and the value seen at the input to the master latch
is locked. Nearly simultaneously, the twice inverted enable of the second or
slave D latch transitions from low to high (0 to 1) with the clock signal. This
allows the signal captured at the rising edge of the clock by the now locked
master latch to pass through the slave latch. When the clock signal returns to
low (1 to 0), the output of the "slave" latch is "locked", and the value seen at the
last rising edge of the clock is held while the master latch begins to accept new
values in preparation for the next rising clock edge.
Symbol
>
Q(t+1)
Falling
Falling
1.4.2 Counter
Counter is a device which stores (and sometimes displays) the number of times a
particular event or process has occurred, often in relationship to a clock signal.
Counters can be implemented quite easily using flip-flop, and a wide variety of
designs exist i.e.;
Asynchronous (ripple) counter, Synchronous counter
Binary counter, Decade counter, BCD Counter
Updown counter
Preset able/ programmable counter
Ring counter, Johnson counter, Cascaded counter
Counters can be of 4-bit, 8-bit or more than 8-bit. Counters are used as
frequency divider also.
1.4.3 Multiplexer, De-multiplexer

Multiplexer or mux is a device that performs multiplexing; it selects one of many
analog or digital input signals and forwards the selected input into a single line. A
n
multiplexer of 2 inputs has n select bits, which are used to select which input line
Page 21
to send to the output. A very common application of mux is found in computers,

where dynamic memory uses the same address or data lines by more than one
memory chip. By this scheme a large amounts of memory can be incorporated
into the computer while limiting the number of copper traces. In such an
application, this circuit is commonly called data selector.
On the other end, a de-multiplexer (or demux) is a device taking a single input
signal and selecting one of many data-output-lines, which is connected to the
single input. A multiplexer is often used with a complementary de-multiplexer on
the receiving end.
1.4.4 Decoder
Decoder can take the form of a multiple-input, multiple-output logic circuit that
converts coded inputs into coded outputs, where the input and output codes are
n
different. Such as, an n-to-2 type binary decoders, which converts binary
information from 'n' coded inputs to a maximum of 2n unique outputs. Decoding
is necessary in applications such as data multiplexing, BCD to 7 segment display
and memory address decoding. Following figure shows a 2 line to 4 line decoder,
which can be used for address decoding of computer system memory.
Page 22
1.4.5 Shift-register
The term register refers to a group of flip-flops operating as a unit to hold data. A
counter can be viewed as a specialized kind of register, which counts events and
thereby generates data, rather than just holding the data. Shift register shifts data
through it, from flip-flop to flip-flop. Based on shift nature shift register are of two
kinds;
- Serial to Parallel Shift Register or Serial in Parallel Out Shift register (SIPO)
- Parallel to Serial Shift Register or Parallel in Serial Out Shift register (PISO)
If we apply one byte (8 bits) of data to the initial data input one bit at a time at the
input of an SIPO registe, and apply one clock pulse to the circuit after setting
each bit of data, we will find the entire byte present at the flip-flop outputs in
parallel format.
Page 23
PISO register transfer the parallel data to its single output bit by bit for each clock
pulse.
1.4.6 Buffer-Register
Buffers are normally used for physical isolation and / or to increase the driving
capability to support more inputs at a time. Some time it can be used for logic
level shifting also, such as 5v logi to 3v logic. Buffer can also hold one byte data
for temporary use.
1.5 Digital ICs and their characteristics

There are different families of digital ICs based on the technology. For simplicity
and within the scope of this book some logic families and their characteristics are
described in this section, which we should consider while designing our
microprocessor and microcontroller based system in this stage.
1.5.1 Device Families:

For our design we will use mainly TTL and CMOS ICs. These two families again
have variants with different improved features like speed, operating voltage,
Page 24
power consumption, propagation delay etc. The 74 series (54 series is the
military version of 74 series) is mainly TTL and 4000 Series is CMOS, however
some 74 series have CMOS-TTL combination for better performance. Different
types of 74 series are listed in the following table.
Basic TTL Families

True TTL
Bus Driver Families

ABT Advanced BiCMOS Technology
L
S
Low power
Schottky
ABTE ABT - Enhanced Transceiver Logic

ABTH Advanced BiCMOS Technology bus Hold
H
LS
High speed
Low power Schottky
BCT
BTL
AS
ALS
Advanced Schottky
Advanced Low power Schottky
GTL Gunning Transceiver Logic

GTLP GTL Plus
BiCMOS - TTL inputs

Backplane Transceiver Logic
F(AST) Fast (Advanced Schottky)

C
CMOS
Low Voltage Families

ALB Advanced Low Voltage BiCMOS
HC
HCT
LV
LVC
High speed CMOS

High speed CMOS TTL inputs
Low Voltage
LV CMOS
AHC Advanced High speed CMOS

AHCT Advanced High speed CMOS TTL inputs
LVCH Low Voltage CMOS bus Hold

ALVC Advanced Low Voltage CMOS
FCT
AC
Fast CMOS TTL inputs

Advanced CMOS
LVT LV TTL
LVTZ Low Voltage TTL High Impedance power-up
ACT
ACQ
Advanced CMOS TTL inputs

Advanced CMOS Quiet outputs
ALVC ALV CMOS

ALVCH Advanced Low Voltage CMOS bus Hold
ACTQ Advanced CMOS TTL inputs Quiet outputs
LCX
VCX
LV - CMOS (3v & 5v)

LV - CMOS (1.8v & 3.6v)
1.5.2 Supply voltage and logic level

Comparison of Input and Output logic switching levels for the CMOS, TTL, mixed
CMOS/TTL, and Low voltage logic families is shown in the following graph. The
graph shows 5 volt CMOS, TTL, and mixed CMOS/TTL IC devices, and 3.3 volt
LVTTL LVCMOS IC devices. The CMOS families (AC, HC, AHC, C) have
different input and output switching levels than the TTL logic devices (F, S, AS,
LS, ALS). The output switching levels from CMOS ICs is higher then a TTL IC,
which happens to result in a better design and does not have a negative effect.
Page 25
VCC: The voltage applied to the power pin(s).

VIH (Voltage Input High): The minimum positive voltage applied to the input which will
be accepted by the device as a logic high.
VIL (Voltage Input Low): The maximum positive voltage applied to the input which will
be accepted by the device as a logic low.
VOL (Voltage Output Low): The maximum positive voltage from an output which the
device considers will be accepted as the maximum positive low level.
VOH (Voltage Output High): The maximum positive voltage from an output which the
device considers will be accepted as the minimum positive high level.
VT (Threshold Voltage): The voltage applied to a device which causes the device to
switch. May also be listed as a '+' or '-' value.
Page 26
However the difference in input logic switching level does impact the design, the
TTL output does not correctly switch a CMOS input. The switching difference
between a TTL IC output and a CMOS IC input has to be accounted for. The
mixed CMOS/TTL (ACT, HCT, AHCT, FCT) logic devices have TTL logic input
switching levels and CMOS output switching levels. The mixed TTL/CMOS
devices are CMOS devices which just happen to have TTL input trigger levels,
but they are CMOS ICs.
So the rule is, if we use a CMOS IC for reduced current consumption (for
example), and a TTL IC feeds the CMOS chip, then we need to either provide a
voltage translation or use one of the mixed CMOS/TTL devices.
1.5.3 Propagation delay, Speed and power consumption

Different digital logic families have different speed and power consumption.
Power consumption is related to the speed also. Following table shows the
propagation delay (delay time to reflect the change of input to the output), speed
(the maximum frequency a device can toggle its state, 1 to 0 or 0 to 1), dynamic
power consumption (when the device works or oscillates). Besides the input and
output current limit at low and hi state (mentioned in the datasheet) are also to be
considered.
Propagation Speed
Series
delay (ns)
(MHz)
4000B
30
5
C
30
5
AC/ACT
3
125
HC/HCT
9
30
(74 Basic)
10
25
L
33
3
H
6
43
S
3
110
LS
10
33
ALS
4
34
F
3.5
100
AS
2
105
74G
1.5
1125
Power per gate

Supply
@1 MHz (mW) Voltage (V)
1.2
10
1.2
10
0.5
3.3 or 5
0.5
5
10
5
1
5
22
5
19
5
2
5
1.3
5
5.4
5
8
5
1.65 - 3.6
Page 27
1.6 Digital quantities

1.6.1 Bit, Byte and Nibble
A binary digit is called a bit. There are two possible states in a bit, usually
expressed as 0 and 1.
A series of eight bits strung together makes a byte. With 8 bits, or 8 binary digits,
8
there exist 2 = 256 possible combinations. The right most bit of a byte is called
Least Significant Bit (LSB) and the left most bit is called Most Significant Bit
(MSB). The following table shows some of these combinations with their decimal
values.
4 bits make a nibble. A byte has two nibbles, right four bits are called the lower
nibble and left four bits are called higher nibble. In the following table first row
shows the lower nibble and the first column represents the higher nibble.
0000
0001
0010
0011
0100
0101
0110
0111
1000
1001
1010
1011
1100
1101
1110
1111
0000
0
16
32
48
64
80
96
112
128
144
160
176
192
208
224
240
0001
1
17
33
49
65
81
97
113
129
145
161
177
193
209
225
241
0010
2
18
34
50
66
82
98
114
130
146
162
178
194
210
226
242
0011
3
19
35
51
67
83
99
115
131
147
163
179
195
211
227
243
0100
4
20
36
52
68
84
100
116
132
148
164
180
196
212
228
244
0101
5
21
37
53
69
85
101
117
133
149
165
181
197
213
229
245
0110
6
22
38
54
70
86
102
118
134
150
166
182
198
214
230
246
0111
7
23
39
55
71
87
103
119
135
151
167
183
199
215
231
247
1000
8
24
40
56
72
88
104
120
136
152
168
184
200
216
232
248
1001
9
25
41
57
73
89
105
121
137
153
169
185
201
217
233
249
1010
10
26
42
58
74
90
106
122
138
154
170
186
202
218
234
250
1011
11
27
43
59
75
91
107
123
139
155
171
187
203
219
235
251
1100
12
28
44
60
76
92
108
124
140
156
172
188
204
220
236
252
1101
13
29
45
61
77
93
109
125
141
157
173
189
205
221
237
253
1110
14
30
46
62
78
94
110
126
142
158
174
190
206
222
238
254
1111
15
31
47
63
79
95
111
127
143
159
175
191
207
223
239
255
Page 28
For example decimal 150 corresponds the 1001 from the first column and 0110
from the first row, so the binary representation of 150 is 1001-0110.
Sometimes bit is noted by the letter b in small, and byte is noted by the letter B
in capital.
1.6.2 Kilo (K) and Mega (M)

10
2 = 1024 is commonly referred to as kilo or "K". It is approximately equal to one

thousand. Thus, 1 Kbyte is 1024 bytes. Likewise, 1024K is referred to as Mega
or M. It is approximately equal to a million. 1 Mega byte is 1024*1024 =
1,048,576 bytes.
1.6.3 Signed number

The MSB is used for representing signed binary numbers. The following example
shows that a single byte can represent numbers from 0 to 255 (called unsigned
number) or -127 to +127 (called signed number or magnitude). While
programming we have to mentioned the type of the number to be used by the
software. By default any 8-bit system considered the 8-bit binary number as
signed number, however, we can use the number in the software as unsigned
number.
Binary Number
0111-1111
0000-1111
0000-0000
1000-0000
1111-1111
Unsigned
127
15
0
128
255
Signed
+127
+15
0
-0
-127
There are two more ways to represent signed number; Ones (1s) complement
and Twos (2s) complement.
Ones complement: The ones' complement form of a negative binary number is
the bitwise NOT applied to it; the complement of its positive counterpart. As an
Page 29
example, the ones' complement form of 11010100 (43d) becomes 00101011

(43d).
Twos complement: In two's complement, negative numbers are represented by
the bit pattern which is one greater (in an unsigned sense) than the ones'
complement of the positive value, ie.
2s complement = 1s complement + 1
The main advantage of twos complement is that in this system we have only one
0, where as other two ways have +0 and -0. In the following table shows three
ways of negative number representation.
Signed Binary
Binary
Decimal
00000000
0
00000001
1
01111110
126
01111111
127
10000000
-0
10000001
-1
11111110
-126
11111111
-127
1s complement
Binary Decimal
00000000
+0
00000001
1
01111110
126
01111111
127
01111111 -127
01111110 -126
00000001
-1
00000000
-0
2s complement
Binary Decimal
00000000
0
00000001
1
01111110
126
01111111
127
10000000 -128
01111111 -127
00000010
-2
00000001
-1
Un-signed
Decimal
0
1
126
127
128
129
254
255
1.6.4 Hand notation

Like decimal counting using finger we can also binary calculation using finger
lines. Starting from the root of the pinky if we start counting the first bit or the
LSB, the it will give 2d. Now growing upward we can count the bits (2, 3, 4.16)
1
16
which give us 2 = 1 to 2 = 64k. So, we can derive the following rules for finger
counting4
1 finger = 1 nibble = 4 bits = 2 = 16d = One Hex digit

1 joint = 1 bit = x2
So, one round of counting give 16-bits = 64k. If we consider this 16 bits as
address bits (will be discussed later) then it will give 64kB of memory location.
Page 30
Figure 2: Binary Hand-notation
We can count more than 64k by multiple round of counting as given in the
following tablebits
16
Pinky
2
Ring
6
Middle
Pointer
scale
32 64 128 256 512 1K 2K 4K 8K 16K 32K 64K 1-K
32 128 256 512 1M 2M 4M 8M 16M 32M 64M 128 256 512 1G 2G 4G M-G
48 8G 16G 32G 64G 128 256 512 1T 2T 4T 8T 16T 32T 64T 128 256 G-T
1.7 "Real World" DOs & DON'Ts

1.7.1 What should we do with the unused input pins?
TTL devices normally default to a logic ONE if the input is allowed to FLOAT.
Page 31
However, depending on many factors, these inputs can act as an antenna, and
pick up NOISE which can cause mischief to the circuit. The worst case is, the
device will act as an uncontrolled intermittent OSCILLATOR.
Therefore, all unused inputs of TTL logic devices IDEALLY should be returned to
either a logic ONE or logic ZERO. Certain devices 74XX and earlier 74LS the
logic 1 (Vcc) should be a 1k resistor to Vcc; or alternatively, connected directly to
ground (0). Most/all other logic devices, the resistor is UNNECESSARY.
In the case of CMOS devices, there is NO input DEFAULT; CMOS input
impedance is on the order of thousands of MEGOHMS and will cause EXTREME
FAILURES if allowed to FLOAT.
To make this point: if you put your finger or a scope probe on or NEAR an unterminated CMOS input, it can cause a logic CHANGE!! If allowed to float, some
CMOS devices can oscillate so fast, that it exceeds the device power rating and
will literally destroy itself.
Tri-state: Tri-state means three states. We know that digital devices can have
two states; 0 and 1. However, tri-state digital outputs have one more state which
is called hi-impedance or open. This tri-state output pin can be easily understand
from the following figure, where a single pole 3-throw switch can connect its pole
to +5 volt, ground (or 0v) and no-voltage.
Figure 3: Tri-state output
Page 32
Open collector and open drain: Push-pull (also called totem pole) type output
has two complementary BJTs or MOSFETs connected with the Vcc and ground.
However, open collector and open drain outputs has only one BJT or MOSFET
connected with the ground.
Figure 4: Push-pull, open collector, open drain output
If these types of output have no internal pull-up resistor, we can connect multiple
outputs with a single external pull-up as shown in the figure. These outputs then
act as single ORed output.
Figure 5: Multiple open drain outputs with external pull-up
Page 33
1.7.2 Unused Output pins

Tri-state and open collector devices, etc., DO NOT require any attention. In the
case of the tri-state control pin, it should be treated as an INPUT.
1.7.3 Warning
-
NEVER EVER USE the original generic 7400 DEVICE. INSTEAD: Use
anything else, e.g., 74LS, 74ALS, etc.
The older devices require five to ten times the drive power and force very
LARGE amounts of NOISE on to the Vcc rail! This is NOT GOOD!
Remember, the newer the technology the happier the circuit will be well
almost!
Review Questions:
1.
2.
3.
4.
5.
6.
7.
Relate a number using Binary, Hex and BCD number system.

Mention De-Morgans Law.
Show the algorithm to convert a decimal number to hex number.
What are the notations for decimal, hex and binary number?
Add two binary numbers?
Subtract two binary numbers?
Which numbers are ve from the followings and what is their decimal
value?
Design experiment:
1. Design a circuit using digital ICs (CMOS and/or TTL) that will turn on and
off a light at two particular times, like ON at 7pm and OFF at 11pm. This
time should the changeable.
Page 34

1 - Number System and Digital Logic

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

1 - Number System and Digital Logic

Hochgeladen von

Copyright:

Verfügbare Formate

Chapter 1

Number System and Digital Logic

1.1 Number System

1.1.1 Decimal Number

MMI (Number System & Digital Logic)-GMA Ehsan ur Rahman

10 , where N is the number of 0 added in the right position.

MMI (Number System & Digital Logic)-GMA Ehsan ur Rahman

300000 + 40000 + 5000 + 600 + 70 + 8 = 345678

1.1.2 Binary Number

Quantity Digit-1 Digit-2 Digit-3

Position of 1 in a number gives it different weight, which is increased two times

, where N is the number of digits in a number

MMI (Number System & Digital Logic)-GMA Ehsan ur Rahman

Following table shows the weight of the digits in a binary number

1.1.2 Hexadecimal Number

, where N is the digit number.

MMI (Number System & Digital Logic)-GMA Ehsan ur Rahman

A 4-digit number ABCD represents 43981, which can be found as followsSymbol

40960 + 2816 + 192 + 13 = 43981.

1.1.3 Octal Number

2048 + 320 + 48 + 7 = 2423

MMI (Number System & Digital Logic)-GMA Ehsan ur Rahman

1.1.4 Number system notation

1.1.5 Number system relationship and conversion

MMI (Number System & Digital Logic)-GMA Ehsan ur Rahman

Hex to decimal conversion: Convert the hexadecimal number 4B3 to decimal

1024 + 176 + 3 = 1203

MMI (Number System & Digital Logic)-GMA Ehsan ur Rahman

Decimal to hexadecimal conversion: Convert the decimal number 3315 to

Quotient Remainder Hexadecimal

Decimal to binary conversion: Convert the decimal number 315 to binary

MMI (Number System & Digital Logic)-GMA Ehsan ur Rahman

1.1.6 Binary Coded Decimal number (BCD)

MMI (Number System & Digital Logic)-GMA Ehsan ur Rahman

1.2.1 Binary addition

Step-1: digit-1 of result = digit-1 (1 number) + digit-1 (2 number)

MMI (Number System & Digital Logic)-GMA Ehsan ur Rahman

Step-2: digit-2 (1 number) of upper number + the overflow of step-1

digit-2 (1 number) with overflow = 1 + 1 = 2

Step-3: digit-2 of result = digit-2 (1 number with over flow) + digit-2 (2

Here the 1 number is of 4 digits and the 2

number is of 5 digits. Now, addition

MMI (Number System & Digital Logic)-GMA Ehsan ur Rahman

Step-1: digit-1 (1 number) + digit-1 (2 number) = 1 + 0 = 1, where 1 is the

1.2.2 Hex addition

MMI (Number System & Digital Logic)-GMA Ehsan ur Rahman

Step-1: digit-1 (1 number) + digit-2 (2

number) = C + 3 = F, where the result is

Step-2: overflow of previous step + digit-2 (1 digit) + digit-2 (2 digit) = 0 + B + 5

1.2.3 Binary subtraction

MMI (Number System & Digital Logic)-GMA Ehsan ur Rahman

Adding 2 (10) with 4 digit of 1 number

Digit-6 (1 number), digit-5 (1 number)

1.2.4 Hex subtraction

MMI (Number System & Digital Logic)-GMA Ehsan ur Rahman

52643 in decimal (1 number)

Digit-2 (1 number) + 10 hex

Digit-4 (1 number), digit-3 (1 number)

1.3 Digital Logic

1.3.1 Logic Gate

MMI (Number System & Digital Logic)-GMA Ehsan ur Rahman

NOT Gate/ Inverter

Figure1: Basic Logic gate symbol