An Improvement in the Restoring Division Algorithm (Needy Restoring Division Algorithm)

摘要：

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.

关键词： Restoring Division Needy Restoration Logical Shift Remainder

作者: Nitish Aggarwal Kartik Asooja Saurabh Shekhar Verma Sapna Negi

作者单位: IIIrd Year Students, Department of Computer Engineering G.B.P.U.A&T, Pantnagar-263145, India

会议类型: 国际会议

会议名称: 2009 2nd IEEE International Conference on Computer Science and Information Technology(第二届计算机科学与信息技术国际会议 ICCSIT2009)

会议地点: 北京

会议语种:英文

页码: 246-249

在线出版日期: 2009-08-08（万方平台首次上网日期，不代表论文的发表时间）