Division of binary numbers logic circuit
If we want to divide two numbers I have problem implementing this logic.I am posting 1 images with 2 different steps to the solution.
In example a) the most significant digits of the divident >= divisor we subtract the divisor from those 2 digits.
In b)the most significant digits of the divident<divisor so we move down the next digit of the divident(which happens to be the last) and we put a 0 in the quotient and do the subtraction.
I dont understand how to make a logic circuit which does that job:check if the divisors is greater and equal or less than the most left digits of the divident and depending on the results does a different function