Binary Number System | Binary to Decimal and Decimal to Binary Conversion
Introduction of Binary Number System
In digital electronics Binary numbers are the most important tool for giving digital inputs. Now before understanding binary number system, we have to understand decimal number system, which we use in our daily life. The number system first introduced in human history for counting purpose. Different numbers for counting are represented by different symbols. Such as a single thing is counted by a symbol 1, if there are two things, the symbol will be 2, for counting three things, the symbol is 3. For four, five, six, seven, eight, nine the symbols used in decimal systems are 4, 5, 6, 7, 8 and 9 respectively. Symbol 0 (zero) means there is nothing to be counted. So, 0 ,1, 2, 3, 4, 5, 6, 7, 8, 9 are ten basic symbol used to count zero to nine. That’s why it is called decimal number system or base 10 system.But if there are more than nine things to be counted, then we do not go for another new symbol, rather we combine two or more symbols from 0 to 9 and represent the numbers which is more than nine. For representing nine + one that is ten, we use 10, for nine + two we use 11 and so on. In this way we established decimal number system.
Now coming to binary number system, the name is so because it has two base (0 and 1), the whole no. system can be represented by it.
History of Binary Number System
Binary number system was introduced by an Indian- scholar Pingala in around 5th -2nd centuries in BC. Long and short syllables were used by him to illustrate the two types of numbers, it is more like Morse code.Gottfried Leibniz in 1679 introduced the modern type of binary number system which we still use.
Any kind of number (decimal) can be represented by binary number system. The use of this system is popular in digital electronics because the on and off mode can be pretty easily understood by this.
00 | 01 | 02 | 03 | 04 | 05 | 06 | 07 | 08 | 09 |
---|---|---|---|---|---|---|---|---|---|
10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 |
20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 |
30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 |
40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | 49 |
50 | 51 | 52 | 53 | 54 | 55 | 56 | 57 | 58 | 59 |
60 | 61 | 62 | 63 | 64 | 65 | 66 | 67 | 68 | 69 |
70 | 71 | 72 | 73 | 74 | 75 | 76 | 77 | 78 | 79 |
80 | 81 | 82 | 83 | 84 | 85 | 86 | 87 | 88 | 89 |
90 | 91 | 92 | 93 | 94 | 95 | 96 | 97 | 98 | 99 |
Here, in the table above, every number is represented by combination of any two of basic symbols (0 to 9). These basic symbols are known as digit and corresponding position of these digit in a represented number is known as bit. So all the decimal number represented above are two digits, double bits number. The left most bit in a number is referred as most significant bit (MSB) where as the right most bit is referred as least significant bit (LSB).
If we observe the numbers given above we will find that first ten successive numbers i.e. from 00 to 09 are represented by changing ten decimal digits at LSB. Then MSB is changed to next successive digit and by changing digits at LSB other ten successive numbers (from 10 to 19) are represented. At third row in the table MSB is changed to next successive digit and by changing digits at LSB other ten successive numbers (from 20 to 29) are represented. There are total 100 i.e. from 00 to 99 numbers represented by two bits in decimal system. 100 means 10^{2} which implies (number of basic digits)^{number of bits}. Hence by 3 bits 10^{3} or 1000 numbers(i.e from 000 to 999) can be represented. Similarly, by n bits 10^{n} numbers can be represented
Now think about the situation, where a number system has only two digit 0 and 1. This system can also be represented in same logic as decimal system. The number system with only two digit 0 and 1 is known as binary number system. Here, zero is represented by a symbol '0' and one is represented as '1' but if number is more than one then MSB is changed to 1, and by changing LSB other two successive numbers, can be represented. Just like decimal system, total numbers counted by binary system depends upon it bits. For two bit binary, 2^{2} numbers i.e. zero to three can be represented. Formula is same here, total numbers represented by binary number system = (number of basic digits)^{number of bits}. Number of basic digits in binary system is two (0 and 1) but number of bits can be chosen any thing from 1 to infinity, hence all range of numbers can easily be represented by binary system, like all other number system.
Definition of binary number system
Binary number system has the base (or radix) 2 and the numbers in this system are formed with two digits 1 and 0.Now, think about the a decimal number such as 625. From very basic concept we can understand Here, 625 is three bits decimal number, whose right most digit or digit at LSB is 5 and if we count the bits from right the right most bit will be 0. Next bit from right is numbered as 1 and here digit 2 is placed and similarly the left most bit is 2 and digit is 6. So from this example it is clear that any decimal number can be represented as
∑digit × 10^{corresponding position or bit}
Here in the above expression 10 is the total number of digits used in decimal system i.e. 0 to 9
Like decimal system any number system can be represented by same expression, only 10 in the expression should be replaced by total number of digits used in that system. Hence, any number in any system, can be represented as
∑digit × (number of digits used in that system)^{corresponding position or bit}
The number of digits used in binary number system is 2. Hence, any number can be represented in this system by,
∑digit × (2)^{corresponding position or bit}
5 | 4 | 3 | 2 | 1 | 0 | → Position or bit |
1 | 0 | 1 | 0 | 1 | 0 | → Binary digits |
Here, the binary number number 101010. Therefore, as per above expression, the number may be expressed as, For better understanding please observe the table below,
Binary Number | Decimal Equivalent | ||||||||
Position or bit | 7 | 6 | 5 | 4 | 3 | 2 | 1 | 0 | |
Binary digits | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0×2^{7} + 0×2^{6} + 0×2^{5} + 0×2^{4} + 0×2^{3} + 0×2^{2} + 0×2^{1} + 0×2^{0} = 0 |
---|---|---|---|---|---|---|---|---|---|
0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0×2^{7} + 0×2^{6} + 0×2^{5} + 0×2^{4} + 0×2^{3} + 0×2^{2} + 0×2^{1} + 1×2^{0} = 1 | |
0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0×2^{7} + 0×2^{6} + 0×2^{5} + 0×2^{4} + 0×2^{3} + 0×2^{2} + 1×2^{1} + 0×2^{0} = 2 | |
0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0×2^{7} + 0×2^{6} + 0×2^{5} + 0×2^{4} + 0×2^{3} + 0×2^{2} + 1×2^{1} + 1×2^{0} = 3 | |
0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0×2^{7} + 0×2^{6} + 0×2^{5} + 0×2^{4} + 0×2^{3} + 1×2^{2} + 0×2^{1} + 0×2^{0} = 4 | |
0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0×2^{7} + 0×2^{6} + 0×2^{5} + 0×2^{4} + 0×2^{3} + 1×2^{2} + 0×2^{1} + 1×2^{0} = 5 | |
0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0×2^{7} + 0×2^{6} + 0×2^{5} + 0×2^{4} + 0×2^{3} + 1×2^{2} + 1×2^{1} + 0×2^{0} = 6 | |
0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0×2^{7} + 0×2^{6} + 0×2^{5} + 0×2^{4} + 0×2^{3} + 1×2^{2} + 1×2^{1} + 1×2^{0} = 7 | |
0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0×2^{7} + 0×2^{6} + 0×2^{5} + 0×2^{4} + 1×2^{3} + 0×2^{2} + 0×2^{1} + 0×2^{0} = 8 |
Decimal to Binary Conversion
This is quite simple it can be understand clearly if we follow the example. Let, a decimal number be (87)_{10}. We divide 87 by 2 and get 43 as the quotient and 1 as the remainder. These remainders are written beside as shown below.2 | 87 | → 1 |
2 | 43 | → 1 |
2 | 21 | → 1 |
2 | 10 | → 0 |
2 | 5 | → 1 |
2 | 2 | → 0 |
1 |
Binary to Decimal Conversion
This conversion is also very simple method. Let, a binary number be (11010)_{2} ,Where the weight of the binary digits from M.S.B. are 2^{4}, 2^{3}, 2^{2}, 2^{1}, 2^{0} respectively. Now the bits are multiplied with their weights and the sum of those products is the respective decimel number. Now let us follow the following steps mathematically. Hence, (26)_{10} is the required decimal number. This is how binary to decimal conversion is doneComments/Feedbacks
Closely Related Articles Binary to Decimal and Decimal to Binary ConversionBCD or Binary Coded Decimal | BCD Conversion Addition SubtractionBinary to Octal and Octal to Binary ConversionOctal to Decimal and Decimal to Octal ConversionBinary to Hexadecimal and Hex to Binary ConversionHexadecimal to Decimal and Decimal to Hexadecimal ConversionGray Code | Binary to Gray Code and that to Binary ConversionOctal Number SystemDigital Logic Gates2′s Complement1′s ComplementASCII CodeHamming Code2s Complement ArithmeticError Detection and Correction Codes9s complement and 10s complement | SubtractionSome Common Applications of Logic GatesKeyboard EncoderAlphanumeric codes | ASCII code | EBCDIC code | UNICODEMore Related Articles Digital ElectronicsBoolean Algebra Theorems and Laws of Boolean AlgebraDe Morgan Theorem and Demorgans LawsTruth Tables for Digital LogicBinary Arithmetic Binary AdditionBinary SubtractionSimplifying Boolean Expression using K MapBinary DivisionExcess 3 Code Addition and SubtractionK Map or Karnaugh MapSwitching Algebra or Boolean AlgebraBinary MultiplicationParallel SubtractorBinary Adder Half and Full AdderBinary SubstractorSeven Segment DisplayBinary to Gray Code Converter and Grey to Binary Code ConverterBinary to BCD Code ConverterAnalog to Digital ConverterDigital Encoder or Binary EncoderBinary DecoderBasic Digital CounterDigital ComparatorBCD to Seven Segment DecoderParallel AdderParallel Adder or SubtractorMultiplexerDemultiplexer555 Timer and 555 Timer WorkingLook Ahead Carry AdderOR Operation | Logical OR OperationAND Operation | Logical AND OperationLogical OR GateLogical AND GateNOT GateUniversal Gate | NAND and NOR Gate as Universal GateNAND GateDiode and Transistor NAND Gate or DTL NAND Gate and NAND Gate ICsX OR Gate and X NOR GateTransistor Transistor Logic or TTLNOR GateFan out of Logic GatesINHIBIT GateNMOS Logic and PMOS LogicSchmitt GatesLogic Families Significance and Types of Logic FamiliesLatches and Flip FlopsS R Flip Flop S R LatchActive Low S R Latch and Flip FlopGated S R Latches or Clocked S R Flip FlopsD Flip Flop or D LatchJ K Flip FlopMaster Slave Flip FlopRead Only Memory | ROMProgrammable Logic DevicesProgrammable Array LogicApplication of Flip FlopsShift RegistersBuffer Register and Controlled Buffer RegisterData Transfer in Shift RegistersSerial In Serial Out (SISO) Shift RegisterSerial in Parallel Out (SIPO) Shift RegisterParallel in Serial Out (PISO) Shift RegisterParallel in Parallel Out (PIPO) Shift RegisterUniversal Shift RegistersBidirectional Shift RegisterDynamic Shift RegisterApplications of Shift RegistersUninterruptible Power Supply | UPSConversion of Flip FlopsJohnson CounterSequence GeneratorRing CounterNew Articles Acidity Test of Transformer Insulating OilMagnetic FluxRing CounterDischarging a CapacitorCharging a Capacitor