squaring numbers

[gzidude]

Does anybody know if there are any tricks to simply the process of multiplication if all I'm doing is squaring numbers (multiplying them by themselves)?

 

[jeppe]

Take a look at these pages (below as well)
http://www.jjmk.dk/MMMI/Lessons/06_Arithmetics/No3_Multipliers/Index.htm
Your welcome
Jeppe

 

[gzidude]

I know all the ways to build standard multipliers. I was asking if there were any tricks to square numbers to reduce hardware at synthesis.

 

[jeppe]

Well - I believe the build in multipliers of a FPGA will be the most efficient way to square numbers.

Alternative could be lookuptable (ROM based)

How many bits are you planning to work with?

 

[jeppe]

How many bits are you planning to work with?

 

[gzidude]

fifty-five

 

[jeppe]

Ok - this conversation takes its time ;-)
Will you design for speed or for area.

"my" sequentiel adder designed for area and will provide you with the squarre after 55 clockcycles.

A combinatorial 55x55 multiplier will be HUGE and properly not an option.

This leads us back to your question - will there be a "smart" way to do the process x*x ......

x*x = y
(x+1)*(x+1) = y + 2*x +1 .... This fact could be usefull but you will still have to use 55 clockcycles ...

I will sleep on this

 

[gzidude]

Speed is most important in this design. I'm probably off my rocker thinking this can be done in few clocks.