2021 International Conference on Advances in Electrical, Computing, Communication and Sustainable Technologies (ICAECT) 2021
DOI: 10.1109/icaect49130.2021.9392582
|View full text |Cite
|
Sign up to set email alerts
|

Posit Number Division using Newton-Raphson method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…Divider design in embedded processors uses two main types of algorithms: the first type is the digital recursive method, such as the restoring algorithm [ 4 , 5 ] and non-restoring [ 6 ] algorithm; the second type is the iterative approximation method, such as Newton–Raphson algorithm [ 7 , 8 , 9 ], the CORDIC algorithm [ 10 , 11 , 12 ], and the Goldschmidt algorithm [ 13 , 14 , 15 , 16 ]. Iterative approximation methods can be designed as a pipeline structure, and the convergence speed is faster than that of digital recursive methods.…”
Section: Introductionmentioning
confidence: 99%
“…Divider design in embedded processors uses two main types of algorithms: the first type is the digital recursive method, such as the restoring algorithm [ 4 , 5 ] and non-restoring [ 6 ] algorithm; the second type is the iterative approximation method, such as Newton–Raphson algorithm [ 7 , 8 , 9 ], the CORDIC algorithm [ 10 , 11 , 12 ], and the Goldschmidt algorithm [ 13 , 14 , 15 , 16 ]. Iterative approximation methods can be designed as a pipeline structure, and the convergence speed is faster than that of digital recursive methods.…”
Section: Introductionmentioning
confidence: 99%