Abstract
Square root is a basic operation in computer graphics and scientific calculation applications. Because of the complexity of square root algorithms, the square root operation is hard to implement on hardware. This paper shows how a non-restoring integer square root algorithm can be transformed to very efficient hardware (area and speed) .The cellular arithmetical arrays for non-restoring and restoring square root extraction are redesigned .The comparison shows the non-restoring algorithm can be implemented with fewest and result is the fastest circuit among other methods.
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.
