Abstract
This paper presents a high-speed algorithm for computing reciprocal approximations. This algorithm uses two parallel table lookups and an addition to obtain an initial approximation to the reciprocal. This is followed by a modified Newton-Raphson iteration, consisting of one multiply-complement and one multiply-add operation to obtain a more accurate reciprocal approximation. The initial approximation and Newton-Raphson iteration use specialized hardware to reduce the area requirements. Application of this algorithm is illustrated through the design of a reciprocal approximation unit that has a latency of three cycles and a peak throughput of one result per cycle for operands in the IEEE single precision format.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
