Академический Документы
Профессиональный Документы
Культура Документы
UNIT- 4
1) Number systems used in digital electronics 2) Decimal, binary, octal, hexadecimal 3) Their complements, operation and conversion, 4) Floating point and signed numbers, 5) Demorgans theorem 6) AND, OR, NOT, NOR, NAND, EXNOR, EX-OR gates 7) Half and full adder circuits 8) R-S flip flop, J-K flip flop.
ASCII
Number Systems
The system used to count discrete units is called number system. There are four systems of arithmetic which are often used in digital electronics.
Decimal Number System Binary Number System Octal Number System Hexa Decimal System
To indicate digits greater than 9 (nine) we shall use the sum of these digits times power of 10.
number system.
Example:
5 6 2 1
103 102 101 100
= 1 = 20 = 600 = 5000
base 2. The values of the positions are calculated by taking 2 to some power.
Why is the base 2 for binary numbers?
o
In digital systems the information that is being processed is usually presented in binary form. Binary quantities can be represented by any device that has only two operating states or possible conditions. Eg. a switch has only open or closed. We arbitrarily (as we define them) let an open switch represent binary 0 and a closed switch represent binary 1. Thus we can represent any binary number by using series of switches.
164 163 162 161 160 161 162 163 164 165
Use to represent long binary numbers in computers and microprocessors. These digits can use to program machine language.
000
001 010 011
0
1 2 3
20
21 22 23
1
2 4 8
4 5 6 7
24 25 26 27
16 32 64 128
Significant Digits
Binary: 11101101
Most significant digit Least significant digit
Hexadecimal: 1D63A7A
Most significant digit Least significant digit
OCTAL
Repeat division method
HEXADECIMAL
Repeat division method
DECIMAL
BINARY
OCTAL
HEXADECIMAL
converted. Perform successive divisions by 2, placing the remainder of 0 or 1 in each of the positions from right to left. Continue until the quotient is zero. Example: 4210
25 24 23 22 21 20 32 16 8 4 2 1 1 0 1 0 1 0
12
ii. Repeat division method The numbers is divide by 2. Balance for the question is written until the last answer.
12 balance 1
LSB
MSB
DIVISION ALGORITHM
Divide 67 by 2. Record quotient in next row Again divide by 2; record quotient in next row Repeat again Repeat again Repeat again Repeat again STOP when quotient equals 0
1 0 0 0 0 1 12
(12.0625)10 = (1100.0001)2
Example : convert 35910 to Decimal Value Solve = 35910 = ?8 = 359 44 balance 7 8 = 44 5 balance 4 8 = 5 0 balance 5 8 ... Answer = 5478
LSB
MSB
6538
(315)10 = (13B)16
16 315 16 19 16 1 0
B 3 1
LSD MSD
33E16
(225.225)10 = (E1.39)16
01
Binary to Decimal
The easiest method for converting a binary number to its decimal equivalent is to use the Multiplication Algorithm Multiply the binary digits by increasing powers of two, starting from the right Then, to find the decimal number equivalent, sum those products
Multiplication Algorithm
Convert (10101101)2 to its decimal equivalent: Binary
x x x x x x x x
128 32 8 4 1
0 1 0 1 1 0 1
Positional Values
Products
27 26 25 24 23 22 21 20
128 + 32 + 8 + 4 + 1 =17310
(Ans)
Practice conversions:
Binary Decimal
BINARY TO OCTAL
Can be converted by grouping the binary bit in group of three starting from LSB Octal is a base-8 system and equal to two the power of three, so a digit in Octal is equal to three digit in binary system.
1
7
0
1
Ans - 71
03 Binary tO hexadecimal
1 Group the digits of the binary number by four starting from the right. 2 Replace each group of four digits by an equivalent hexadecimal digit.
Convert 101101012 into a hexadecimal number. 1011 01012 = B516 B 5
Exercise
1) 2) 3) 4) 5) 6) 7) Convert 11110002 into a hexadecimal number. Convert 10101002 into a hexadecimal number. Convert 10100102 into a hexadecimal number. Convert 111011112 into a hexadecimal number. Convert 10100012 into a hexadecimal number. Convert 11100102 into a hexadecimal number. Convert 10111002 into a hexadecimal number.
01 BINARY
OCTAL
02
03- HEXA
DECIMAL
DECIMAL
01 Octal To Decimal
Octal Digits
Positional Values Products
5
x
3
x
82 384
81 40
80 + 3
42710
02 OCTAL TO BINARY
Convert from binary to octal by grouping bits in threes starting with the LSB. Each group is then converted to the octal equivalent Leading zeros can be added to the left of the MSB to fill out the last group.
110 101
011
03 Hexadecimal to Decimal
Positional Values
Products
B
x
4
x
F
x
15,18310
HEXADECIMAL TO
BIANRY DECIMAL
OCTAL
01 HEXADECIMAL TO BINARY
HEXADECIMAL TO binary
To convert a hexadecimal to binary number, convert each hexadecimal digit to its 4 bit equivalent using the hexa number.
Example: (23.AB)16 = ()2 Solution: (23.AB)16 = 2 3 . A 1010 B 1011
02 HEXADECIMAL TO OCTAL
i.
0 1 2 3 4 5 6 7 8 9
0 1 2 3 4 5 6 7 8 9
10 11 12 13 14 15
A B C D E F
Complements of number
Two types of compliments N and N-1 compliments. N- base of number system.
N-1 1 9 7 15
N 2 10 8 16
Introduction
Subtraction of a number from another can be accomplished by adding the complement of the subtrahend to the minuend.
1s Complement Subtraction
Subtraction of binary numbers using the 1s complement method allows subtraction only by addition.
Cont.,
1s complement method
To subtract a smaller number from a larger number, the 1s complement method is as follows
1. Determine 2. Add this the tothe the 1s larger complement the smaller number. 3. Remove carry andnumber add it to of the result. This carry is called end-around-carry
Example of 1s complement
Subtract (1010)2 from (1111) 2
1s complement method
Direct Subtraction
1 1 1 1
1 0 1 0 0 1 0 1
1 1 1 1
0 1 0 1 1 0 1 0 0 1 0 10 1
Subtraction Steps
Subtraction of a large number a smaller one by the 1s complement method involves the following steps
1. The 2. 3. Determine Add answer this to the the is the 1s smaller 1s complement complement number of of a large the result number and is opposite in sign. There is no carry.
2s Complement Subtraction
The 2s complement of a binary number can be obtained by adding 1 to its 1s complement.
Steps
Subtraction of a smaller number from a larger one by
the 2s complement method involves the following
steps
1. 2. 3. Determine the ( 2s complement the smaller number Add this Omit theto carry larger there number is always of a carry in this case )
Example of 2s complement
Subtract (1010)2 from (1111) 2
Direct Subtraction
1 1 1 1 1 0 1 0 0 1 0 1
2s complement method
1 1 1 1
2s complement Carry
0 1 1 0 1 0 1 0 1
Subtraction Steps
The carry is discarded. Thus answer is (0101)2 The 2s complement method for subtraction of a
1. To 2. 3. Determine Add There the is no 2s the carry complement 2s . in The complement result to the is in smaller of 2s the complement larger number form 4. get an answer true form, take the 2s number is negative and change the sign. complement
ADDITION
DIVISION
BINARY ARTHMATICS
SUBTRCTION
MULTIPLIC ATION
BINARY ARITHMETIC
Binary arithmetics is essential in all digital computers and in many other types of digital systems. To understand digital systems, you know the basic of binary addition, subtractionn , multiplication, and division.
AFTER COMPLETING THIS SECTION, YOU SHOULD BE ABLE TO 1 ) Add binary number. A+B
2 ) Subtract binary number. A-B 3 ) Multiply binary number. A*B
4 ) Divide binary number. A/B
Addition Rules
0 + 0 = 00 ( sum = 0 with 0 carry )
Addition Rules
0 +0 0 0 1 +0 0 1 0 +1 0 1 1 +1 1 0
87
28 + 43 71
00011100 + 00101011
0 1 1 1 0 0 0
01000111
89
1S Complement
01010011
10101100
90
2S Complement
01010011
10101100 +1 10101101
91
Add/Sub : 4 Combinations
9 + 5 14
9 + (-5) 4
(-9) + 5 -4
(-9) + (-5) - 14
92
93
00000101
11111010 +1 11111011
2s Complement Process
94
11111100
00001001
00000011 +1 00000100
11110110 +1 11110111
2s Complement Process
95
11110111 + 11111011
1]11110010
8th Bit = 1 : Answer is Negative Disregard 9th Bit Take 2s Complement to Check Answer
11110010
00001101 +1 00001110
96
11101100
1) Start at the LSB and write down all zeros moving to the left. 2) Write down the first 1 you come to. 3) Invert the rest of the bits moving to the left.
0 0 01 0 1 0 0
97
Carry
Carry
1 + 0
1 0
SUM - 10101
1 1
1
1 0 1 1 0 1
Class work
Q1- Add the following binary no. 1) 101+111 2)11+01 3)1101101+1101 Ans1) 1100 2) 100 3)1111010
The End
.. Thank You
Nary substazB
DEMORGANS THEOREM
AND, OR, NOT, NOR, NAND, EXNOR, EX-OR gates and their representation
TRUTH TABLE