keyboard_arrow_up
A New Paradigm in Fast BCD Division Using Ancient Indian Vedic Mathematics Sutras

Authors

Diganta Sengupta1, Mahamuda Sultana2, Atal Chaudhuri3, 1Future Institute of Engineering and Management, India, 2Swami Vivekananda Institute of Science and Technology, India and 3JadavpurUniversity, India

Abstract

For decades, division is the most time consuming and expensive procedure in the Arithmetic and Logic Unit of the processors. This paper proposes a novel division algorithm based on Ancient Indian Vedic Mathematics Sutras which is much faster compared to conventional division algorithms. Also large value for the dividend and the divisor do not adversely affect the speed as time estimation of the algorithm depends on the number of normalizations of the remainder rather than on the number of bits in the dividend and the divisor. The algorithm has exhibited remarkable results for conventional midrange processors with numbers of size around 50 bits(15 digit numbers), the upper ceiling of computable numbers for conventional algorithms and the algorithm can divide numbers having size up to 38 digits (127 bits) with conventional processor in the present form, if modified it can divide even bigger numbers.

Keywords

Division Algorithm, Fast BCD Division, Vedic Division Algorithm

Full Text  Volume 3, Number 5