An Improved Non-Restoring Algorithm

摘要

Non-restoring division involves shifting and add/subtract operations. This paper proposes method to reduce the number of bits in shift operation during non restoring operations. The upper half of the dividend is shifted instead of whole dividend. The least significant bit of the shifted number is set to the value in lower half of the dividend depending on the iteration. The design is synthesized with Xilinx Tool. A performance improvement of 21% with no change in power consumption and area degradation of 4% is observed.