Scribd
Upload
14 views18 pages

Unit3 - Number Conversion and Codes (1) Class

Uploaded by

ankushchoudhary4631
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views18 pages

Unit3 - Number Conversion and Codes (1) Class

Uploaded by

ankushchoudhary4631
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 18

Unit-3:Introduction to number system and logic gates

Number System(Conversion and codes)


Number System and Code
Digital system process binary digits 0 and 1
Base 10 is important for everyday business
Base 2 is important for processing of digital circuit
Base 8 and Base 16 provide convenient shortened representation for multibit number in a digital system
Number conversion
Methods or techniques used to convert numbers from one base to another
Decimal to Other
Step 1 − Divide the decimal number to be converted by the value of the other base.
Step 2 − Get the remainder from Step 1 as (least significant digit) of new base number
Step 3 − Divide the quotient of the previous divide by the new base.
Step 4 − Record the remainder from Step 3 as the next digit
Repeat Steps 3 and 4, getting remainders until the quotient becomes zero
The last remainder thus obtained will be the Most Significant bit(MSB) of the new base number.
Decimal to Hexadecimal Decimal to Octal
(3509)10  ( DB5)16 (569)10  (1071)8
Other Base System to Decimal System
Step 1 − Determine positional value of each digit
Step 2 − Multiply the obtained position values by the digits in the corresponding columns.
Step 3 − Sum the products calculated in Step 2.
32 16 8 4 2 1
1 0 0 1 1 1 =32 + 4 +2 +1 = (39)10

Octal to Decimal
(2754)8  (2  83 )  (7  82 )  (5  81 )  (4  8 4 )
 1024  448  40  4
 151610
Hexadecimal to Decimal
(54.D 2)16  (5  161 )  (4  16 0 )  (13  16 1 )  (2  16 2 )
 80  4  0.8125  0.0078125
 84.8203125
Binary to Octal
Step 1 − Divide the binary digits into groups of three (starting from the right).
Step 2 − Convert each group of three binary digits to one octal digit.

Octal to Binary

Step 1 − Convert each octal digit to a 3 digit binary number.


Step 2 − Combine all the resulting binary groups (of 3 digits each) into a single
binary number
Binary to Hexadecimal
Step 1 − Divide the binary digits into groups of four (starting from the right).
Step 2 − Convert each group of four binary digits to one hexadecimal symbol.

Hexadecimal to Binary
Step 1 − Convert each hexadecimal digit to a 4 digit binary number.
Step 2 − Combine all the resulting binary groups (4 digits each) into a single binary number.

8 4 21
(1101) 2  8  4  1  (13)10
(0111) 2  710
(1010) 2  (10)10  A16
(10101) 2
Practice Question

(4021.5)5  (__________)10
( B65 F )16  (__________)10
(630.4)8  (___________)10
(0.6875)10  (_____________) 2
(0.513)10  (____________)8
(306.D)16  (___________)8
(10110001101011.11110010) 2  (__________)16
(108)10  (_____)16
(___________) 2  (_______)10  (576)8  (______)16
BCD (Binary Coded Decimal)
• Do not get confused, BCD is not the same as hexadecimal.
• Main advantage of BCD - Easy conversion between decimal and binary form.
• BCD code is often called 8421 because the BCD is a weighted code.
• However, disadvantage - BCD code is wasteful as the states
between 1010 (decimal 10), and 1111 (decimal 15) are not used.

• Nevertheless, BCD has many important applications especially using digital


displays.
Excess-3 Code
• It is particularly significant for arithmetic operations as it overcomes shortcoming
encountered while using 8421 BCD code to add two decimal digits whose sum exceeds
9.
• Excess-3 codes are unweighted and can be obtained by adding 3 to each decimal digit
then it can be represented by using 4 bit binary number for each digit.

Steps:
• Find the decimal equivalent of the given binary number.
• Add +3 to each digit of decimal number.
• Convert the newly obtained decimal number back to binary number to get required
excess-3 equivalent.
Gray Code (Cyclic Code, or Reflected Binary Code )
• Ordering of the binary number system such that each incremental value can only differ
by one bit.
• Gray code is non weighted that means it does not depends on positional value of digit.
• it is not suitable for arithmetic operations.

Some other applications of gray code:


• Boolean circuit minimization.
• Error correction in communication system.
MCQ
Which of the following code are non weighted code?
(a) BCD
(b) Excess-3
(c) Grey code
(d) Both b and c
Binary Addition

0 + 0 = 0
0 + 1 = 1
1 + 0 = 1
1 + 1 = 10 (which is 0 carry 1)

(10010) 2  (1001) 2  ?
Binary Subtraction

(1100) 2  (1010) 2  ?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy