DECOMPOSITION OF ARITHMETIC OPERATIONS “DIVISION” IN THE RANGE OF BITWISE SHIFTS

Abstract

To simplify the implementation of an arithmetic operation “division” when designing an arithmetic logi-cal device (ALD) there was developed a method of decomposition of this operation into a range of bitwise shifts. High speed of calculation, the given accuracy of the result, reliability and stability – these are the advantages of the proposed by the author method, achieved by the use of two key operations “shift” and “summation”. Bitwise shift the right (left) does not require the use of logical elements (AND, OR, NOT), and thus is one of the most simple and fast procedures. Ease of implementation of the method in the design process is achieved by using a “shift” in conjunction with the basic operation of the majority ALD – “summation”.