I'm looking for a fast integer mod routine to be executed on a Virtex2-6000. Let's say 256bit unsigned integer divided by a 64bit unsigned integer where I only care about the remainder. Any ideas or directions? I don't care how many resources it uses. Thanks.
fast mod (remainder) algorithm for V2?
Jan 05, 2004
2 Replies
In fact, I don't really care about the remainder other than it being nonzero.
Virtex2-6000.
where
Virtex2 has built-in multipliers, so you could loop on multiplying a loop count by the small number and comparing that to the big number.
-- Mike Treseler
Join the Discussion
Have something to add? Share your thoughts — no account required.
Didn't find your answer?
Ask the community — no account required