ONLINE ELECTRICAL ENGINEERING STUDY SITE

Binary Division

Finally we will discuss the last part of binary arithmetic which is last but not the least in detail i.e. binary division. Division is also a very important part of arithmetic which cannot be ignored at all. Now coming to division process it is perhaps the most difficult part to understand of all the binary arithmetic operations. Though it is not too much difficult, it may look a bit tougher than the other binary operations because all the other had some similarity among themselves like they all had four basic steps which made all the processes quiet easy to understand but the binary division process does not have any specific rule to follow.Though this process is quite similar to the decimal division. The process will not be clear until we look at an example.Let us take A = 11010 and B = 101 We want to divide A by B The structure of operation of binary division is similar to that of decimal division, now we will look into the operation step by step to make it understanding as much as possible.

 In the first step the left most digits of dividend i.e. A are considered and depending upon the value the divisor is multiplied with 1 and the result which is the result of multiplication of 101 and 1 are written. As we already know that 1 × 1 = 1, 1 × 0 = 0 and 1 × 1 = 1 that is exactly what is written.  In this step 101 is subtracted from 110. This step is also very easy to understand as we already know binary subtraction method. Now going into the next step.  As of the rules of division the next least significant bit comes down and we try to multiply 1 with divider i.e. B but the result is bigger than the minuend so this step cannot be completed and we have to go to the next step.  0 is inserted into the quotient and the least significant bit comes down now we can proceed to the next step.

Now again the divisor is multiplied with 1 and the result is written, the result is similar to the first one because all the numbers are same. Now we are going into the final step.  In the final step binary subtraction is done and we get the remainder and the operation of binary division is completed and we get the following result. Quotient = 101 and remainder = 1.

Closely 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 MapExcess 3 Code Addition and SubtractionK Map or Karnaugh MapSwitching Algebra or Boolean AlgebraBinary MultiplicationParallel SubtractorMore Related Articles Binary 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 WorkingOR 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 FamiliesBinary Number System | Binary to Decimal and Decimal to Binary ConversionBinary 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 | UNICODELatches 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 FlopsNew Articles Water MeterAir MeterDigital PotentiometersBasic Construction of Wind TurbineCharacteristics of Sensors