Hi,
I can understand that you are interested in implementing the non-restoring division for unsigned integers.
I have reviewed your code and noticed a few areas that require attention:
- The Most Significant Bit (MSB) of "Q" is should be assigned as the Least Significant Bit (LSB) of "R" while left shifting "RQ".
- After left shifting of "RQ", there should be a statement to update "R" based on its signed bit, either by adding or subtracting "D".
- After updating "R", the LSB of Q should be updated depending on the signed bit of R.
- Since this algorithm involves many bitwise operations like left shift, right shift, and bitwise assignment, it is recommended to use arrays to represent binary numbers instead of decimal numbers.
Kindly refer to the below example code snippet that demonstrates how to initialize the arrays using binary representations:
dividendBin = dec2bin(dividend);
divisorBin = dec2bin(divisor);
% Initialize the registers
A = zeros(1, numBits+1);
Q = zeros(1, numBits);
% Set the dividend and divisor in the registers
Q(end-length(dividendBin)+1:end) = dividendBin - '0';
M = [zeros(1, numBits - length(divisorBin)+1) divisorBin-'0'];
Refer the below code to implement the algorithm:
for i = 1:numBits
% Check signed bit of A
A0 = A(1);
%left Shift AQ
A = [A(2:end) Q(1)];
Q = [Q(2:end) 0];
if A0==0
A = addBin(A,negM);
else
A = addBin(A,M);
end
% Decide LSB of Q
if(A(1)==1)
Q(end)=0;
else
Q(end)=1;
end
end
quotient = bin2dec(num2str(Q));
remainder = bin2dec(num2str(A));
In the above example, "addBin" is a custom MATLAB function which adds two arrays containing binary representations, "negM" is the 2's complement of M.
I hope this helps you address the issue.
