DocumentCode
3319022
Title
An improvement in the restoring division algorithm (Needy Restoring Division Algorithm)
Author
Aggarwal, Nitish ; Asooja, Kartik ; Verma, Saurabh Shekhar ; Negi, Sapna
Author_Institution
Dept. of Comput. Eng., G.B.P.U. A&T, Pantnagar, India
fYear
2009
fDate
8-11 Aug. 2009
Firstpage
246
Lastpage
249
Abstract
An improvement in the current restoring computer division algorithm which minimizes the number of restorations performed by the computer. Currently, restoration is checked after each shifting of the register but needy restoring division algorithm checks restoration only when it is needed. The needless restorations are removed by the use of an extra register. This removal decreases the time for the division than taken in the current restoring division algorithm considerably.
Keywords
shift registers; current restoring computer division algorithm; logical shift; needy restoring division algorithm; Flowcharts; Hardware; Registers; Logical Shift; Needy Restoration; Remainder; Restoring Division;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Technology, 2009. ICCSIT 2009. 2nd IEEE International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-4519-6
Electronic_ISBN
978-1-4244-4520-2
Type
conf
DOI
10.1109/ICCSIT.2009.5234956
Filename
5234956
Link To Document