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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings International Conference on Computer Design VLSI in Computers and Processors s. 690 - 695
Hlavní autoři: Yamin Li, Wanming Chu
Médium: Konferenční příspěvek
Jazyk:angličtina
japonština
Vydáno: IEEE 01.01.1997
Témata:
Circuits
Clocks
Concurrent computing
Equations
Hardware
Iterative algorithms
Throughput
ISBN:9780818682063, 081868206X
ISSN:1063-6404
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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