Implementation of Efficient Digit Recurrence Class of Division Algorithms

Abstract

The basic elements of an electronic system are arithmetic operations. Arithmetic operations are the building block of any electronic application and algorithm is a sequence of instructions used to carry out calculations or solve problems. In spite of the fact that addition, subtraction, multiplication, and division are fundamental components of arithmetic implementation in the electronic system, the implementation of division has received far less attention than the implementation of the other arithmetic operations. The process of dividing two numbers using the method results in the production of a quotient in addition to a remainder. The implementation of division operations is highly challenging; thus, in this scenario, a complex method is employed to ensure successful implementation. To be successful, a system has to have a solid performance in the division circuit. In this body of work, the Restoring division and Non-restoring division algorithms, which fall under the category of Digit Recurrence Class, have been developed for unsigned integers with data sizes of 8 bit, 16 bit, and 32 bit using the Verilog HDL programming language. These algorithms are applicable to unsigned integers with data values of 8, 16, and 32 bits respectively. In each of these algorithms, the calculation takes place in one of three registers designated by the letters A, Q, or M.