Implement division with bit-wise operator

by

The standard way to do division is by implementing binary long-division. This involves subtraction, so as long as you don’t discount this as not a bit-wise operation, then this is what you should do. (Note that you can of course implement subtraction, very tediously, using bitwise logical operations.)

In essence, if you’re doing Q = N/D:

  1. Align the most-significant ones of N and D.
  2. Compute t = (N - D);.
  3. If (t >= 0), then set the least significant bit of Q to 1, and set N = t.
  4. Left-shift N by 1.
  5. Left-shift Q by 1.
  6. Go to step 2.

Loop for as many output bits (including fractional) as you require, then apply a final shift to undo what you did in Step 1.

More Related Contents:

  1. The difference between logical shift right, arithmetic shift right, and rotate right
  2. C/C++: Force Bit Field Order and Alignment
  3. How Does The Bitwise & (AND) Work In Java?
  4. Find out number of bits needed to represent a positive integer in binary?
  5. Efficient bitwise operations for counting bits or find the right|left most ones
  6. How to de-interleave bits (UnMortonizing?)
  7. Fastest way to set __m256 value to all ONE bits
  8. Order of fields when using a bit field in C
  9. Have you ever had to use bit shifting in real projects? [closed]
  10. What is the fastest/most efficient way to find the highest set bit (msb) in an integer in C?
  11. How can I multiply and divide using only bit shifting and adding?
  12. max value of integer
  13. What is CHAR_BIT?
  14. Examples of when a bitwise swap() is a bad idea?
  15. What is the efficient way to count set bits at a position or lower?
  16. How do I set, clear, and toggle a single bit?
  17. In C/C++ what’s the simplest way to reverse the order of bits in a byte?
  18. Efficiently find binary strings with low Hamming distance in large set
  19. What’s bad about shifting a 32-bit variable 32 bits?
  20. How to add two numbers without using ++ or + or another arithmetic operator
  21. warning: left shift count >= width of type
  22. set the m-bit to n-bit [closed]
  23. Count the number of set bits in a 32-bit integer
  24. What is “two’s complement”?
  25. How to replace bits in a bitfield without affecting other bits using C
  26. C Programming – XOR Bitwise Operation
  27. Two’s Complement Binary in Python?
  28. Portable efficient alternative to PDEP without using BMI2?
  29. C/C++ Bit Array or Bit Vector
  30. Converting Int to Float or Float to Int using Bitwise operations (software floating point)

Leave a Comment