Hello everyone
I am supposed to design a circuit for a mod function.The dividend X is of 16 bits and the divisor Y is of 7 bits.
Example
X = 1100110010100101 and Y = 0110110
I did some research on divider designs. I came across the shift and subtract algorithm where you shift the divisor and compare it with the dividend at each step and subtract only when its possible. However this algorithm only works only when the dividend has double the number of bits of the divisor.
Can anyone tell me how to go about this?.
Thanks
I am supposed to design a circuit for a mod function.The dividend X is of 16 bits and the divisor Y is of 7 bits.
Example
X = 1100110010100101 and Y = 0110110
I did some research on divider designs. I came across the shift and subtract algorithm where you shift the divisor and compare it with the dividend at each step and subtract only when its possible. However this algorithm only works only when the dividend has double the number of bits of the divisor.
Can anyone tell me how to go about this?.
Thanks
