please help! vhdl square root

[tafaha2]

newton raphson method vhdl code

Hi All ,
I want vhdl implemented code for a square root algorithm , any one can help ?

or let us make it a contest for the best code uses std_logic and std_logic_vector

There is a paper that can help in attachments

 

[bis_]

vhdl code for square root

Dscribed algorithms requires several iterations to obtain result. May be Pade aproximation will be a little bit simpler(no iterations) and faster. You need compute if approximation will be good enough for you (in your range of numbers), of course. Simple description (see table):
**broken link removed**
bis

 

[tafaha2]

vhdl square root

thank you man

Any one has another idea or an implemented code

 

[guybrush]

Why not using Cordic?

 

[quy1001]

Cordic is easy to solve that problem

 

[param]

ancient Babylonian method

**broken link removed**

i used this simple method in verilog to find square root in one of my applications...

 

[ashaynarsale]

hey,
i think u should try numerical methods for ur problem esp. newton raphson method. I had written a vhdl code for square root that worked perfectly for integers. If u want it for integers...u can mail me...i can mail you the code.