Yesterday I finished a proof of concept for my multiplier algorithms. The program takes n, m, and the multiplier type as inputs and prints out the appropriate multiplier layout. I was able to use the program to produce a 5000x5000 bit multiplier in about 1min30s.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment