A VLSI Algorithm for Integer Square-Rooting
Published • Dec 1, 2006
NobleIDNI9P90W49R18S50
Authors:,
Naofumi Takagi
Kazuyoshi Takagi
Abstract
A VLSI algorithm for integer square-rooting is proposed. It is based on the radix-2 non-restoring square-rooting algorithm. Fast computation is achieved by the use of the radix-2 signed-digit representation. Nonetheless, the algorithm does not require normalization of the operand. Combinational (unf...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!