I looked for some algorithms, there are two class: "subtractive alg"(slower) and "multiplicative alg"(faster).
I have a question for the multiplicative class : the newton-raphson and series expansion methods aims to calculate the reciprocal of the divisor, then multiply it for the dividend. but these methods works only if divisor < 1 ; in my problem the divisor is never < 1.
My opinion is: this should not matter as std_logic_vector bits remain the same, but change the representation/interpretetion [ "110000000" can be either 384 fixed point(9,0) or 0.75 fixed point(0,9) ] , so i suppose that the algorithm works. Is this correct?