1996
DOI: 10.1049/ip-cds:19960707
|View full text |Cite
|
Sign up to set email alerts
|

High-radix digit serial division

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

1996
1996
1999
1999

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…Despite these advantages, the digit serial algorithms are still slow. Recently, the authors proposed an area-time e cient digit serial division algorithm based on radix-2 n arithmetic (Bashagha and Ibrahim 1996), where K quotient bits are generated every m K 1 cycles instead of mK cycles as in the conventional one (Parhi 1991). It was shown that such approach will speed up the digit serial architecture as well as cutting down the silicon area requirements.…”
Section: Introductionmentioning
confidence: 98%
See 1 more Smart Citation
“…Despite these advantages, the digit serial algorithms are still slow. Recently, the authors proposed an area-time e cient digit serial division algorithm based on radix-2 n arithmetic (Bashagha and Ibrahim 1996), where K quotient bits are generated every m K 1 cycles instead of mK cycles as in the conventional one (Parhi 1991). It was shown that such approach will speed up the digit serial architecture as well as cutting down the silicon area requirements.…”
Section: Introductionmentioning
confidence: 98%
“…This paper generalizes the division approach of Bashagha and Ibrahim (1996) to the square rooting operation. The proposed algorithm can be considered as a tree implementation of the original digit serial one Bashagha and Ibrahim (1994).…”
Section: Introductionmentioning
confidence: 99%