Re: Fast division (was Re: Suggested method for returning a string from a C program?)

On Wed, 26 Mar 2025 02:04:40 +0100, Janis Papanagnou wrote:

On 22.03.2025 15:07, Waldek Hebisch wrote:

 
Actually, to do fast division of N-bit number by fixed N-bit number
one need 2N-bit multiplication.

pheraps that means a/b where a is in a big set, is more heavy to
calculate that a* 1/b where a is in a big set of numbers

I just stumbled across your post and above sentence. Do you mean *one*
multiplication of 2N bit numbers? - Could you please explain that (by
an example, or could you provide a reference)?
>
(The reason for my question is that for integer divisions of length N
an old DSP I used required besides shifts effectively N subtractions
to create the result and modulus; it didn't use any multiplications.)
>
Janis