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...
Saved in:
| Published in: | Proceedings International Conference on Computer Design VLSI in Computers and Processors pp. 690 - 695 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English Japanese |
| Published: |
IEEE
01.01.1997
|
| Subjects: | |
| ISBN: | 9780818682063, 081868206X |
| ISSN: | 1063-6404 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!

