Please use this identifier to cite or link to this item:
|Title:||Binary division and square-rooting using gray code|
|Source:||Yuen, C.K. (2014-10-27). Binary division and square-rooting using gray code : 441-. ScholarBank@NUS Repository.|
|Abstract:||A new method to perform binary division and take square roots is presented. It produces the Gray Code representation of the quotient/root, by performing a sequence of shift, subtract and absolute value operations on the dividend and the divisor or the square and the root, and converts the result to the binary representation at the same time. The method has a simpler synchronous hardware implementation than the non-restoring algorithm. The division method may be regarded as the digital equivalent of an A/D conversions method proposed earlier. As the division and square rooting operations require rather similar shift-and-subtract logic circuits, they can be incorporated into a multi-function arithmetic unit.|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 23, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.