I know that Keil has spent lots of time optimizing the floating point routine, but we are hitting a performance wall in our application and we are looking for anything that will keep us in the current platform. My question has to do with trying to shave time off of a square root operation. We would be content with 4 decimal places of precision for our calculations, so is there any way to get that operation to cut short and just return the lower precision that we need.?
The Triscend E5 has a "hardware" square-root module! Up to 32 bits, but not floating point.
Thanks for the suggestions, I will try the fixed point and see how fast I can get it. What I am really trying to do is get the hypotenuse ( = sqrt( a*a + b*b)) of two vectors. I guess a tangent lookup table might be a faster way to go. Anyone ever tried that?