Abstract
If the bit variables involved in the equation A = g2 are constrained in a set of equations, then the bit variables of Q can be solved recursively, and an approximation for Q obtained. The accuracy depends on the number of bits of A used. Implementation can be achieved by a tree of carry-save adders. An associated method for successive iterations is described, and can be used when longer word lengths are needed. Implementation is described and comparisons are presented.
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 callMore From: Journal of VLSI signal processing systems for signal, image and video technology
Disclaimer: 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.
