Parallel-array implementations of a non-restoring square root algorithm

In this paper we present a parallel-array implementation of a new non-restoring square root algorithm (PASQRT). The carry-save adder (CSA) is used in the parallel array. The PASQRT has several features unlike other implementations. First, it does not use redundant representation for square root resu...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings International Conference on Computer Design VLSI in Computers and Processors pp. 690 - 695
Main Authors: Yamin Li, Wanming Chu
Format: Conference Proceeding
Language:English
Japanese
Published: IEEE 01.01.1997
Subjects:
Circuits
Clocks
Concurrent computing
Equations
Hardware
Iterative algorithms
Throughput
ISBN:9780818682063, 081868206X
ISSN:1063-6404
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we present a parallel-array implementation of a new non-restoring square root algorithm (PASQRT). The carry-save adder (CSA) is used in the parallel array. The PASQRT has several features unlike other implementations. First, it does not use redundant representation for square root result. Second, each iteration generates an exact resulting value. Next it does not require any conversion on the inputs of the CSA. And last, a precise remainder can be obtained immediately. Furthermore, we present an improved version-a root-select parallel-array implementation (RS-PASQRT) for fast result value generation. The RSPASQRT is capable of achieving up to about 150% speedup ratio over the PASQRT. The simplicity of the implementations indicates that the proposed approach is an alternative to consider when designing a fully pipelined square root unit.
ISBN:9780818682063
081868206X
ISSN:1063-6404
DOI:10.1109/ICCD.1997.628940