Is there anyone have the related VHDL ,matlab,excel code?Can someone let me know how to do it?Thanks

Maybe this document can help you
http://www.google.com.by/url?sa=t&source=web&cd=2&ved=0CBsQFjAB&url=http%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fdownload%3Fdoi%3D10.1.1.81.6993%26rep%3Drep1%26type%3Dpdf&rct=j&q=floating%20point%20divider%20based%20on%20newton%20raphson%20&ei=K5W2TNjvFoKBOuKV_L0D&usg=AFQjCNF3w5t_3kOKB4psIGwGDm2x0qv0Yg&cad=rja

a friend of mine was doing some research during his master course about this. when i remember right he got interesting results about the initial value estimation.

Master Student : Habegger Andreas
Subject Title : Newton-Raphson Reciprocal Algorithm

Abstract
Several algorithms exist to perform division in digital designs. These algorithms fall into two main categories: slow division and fast division. Slow division algorithms produce one digit of the final quotient per iteration. Examples of slow division include restoring, non-performing restoring, non-restoring, and SRT division. Fast division methods start with a close approximation to the final quotient and produce twice as many digits of the final quotient on each iteration. Newton-Raphson and Goldschmidt fall into this category. The Newton-Raphson method is the best known method to find the zeros (or roots) of a function. Newton's method can often converge remarkably quickly, especially if the iteration begins sufficiently near the desired root. In this seminar, the root finding problem shall be investigated as well as the approximation speed compared to alternative methods.

Documentation : http://www.microlab.ch/images/files/master/seminary/HS08/nr_doc.pdf
Presentation : http://www.microlab.ch/images/files/master/seminary/HS08/nr_pres.pdf

Does he has the code either matlab or vhdl?