Open Access Open Access  Restricted Access Subscription Access

Vedivision - A Fast BCD Division Algorithm Facilitated by Vedic Mathematics


Affiliations
1 Department of Applied Electronics and Instrumentation Engineering, Future Institute of Engineering and Management, Kolkata, India
2 Department of Computer Science and Engineering, Swami Vivekananda Institute of Science and Technology, Kolkata, India
3 Department of Computer Science and Engineering, Jadavpur University, Kolkata, India
 

Of the four elementary operations, division is the most time consuming and expensive operation in modern day processors. This paper uses the tricks based on Ancient Indian Vedic Mathematics System to achieve a generalized algorithm for BCD division in a much time efficient and optimised manner than the conventional algorithms in literature. It has also been observed that the algorithm in concern exhibits remarkable results when executed on traditional mid range processors with numbers having size up to 15 digits (50 bits). The present form of the algorithm can divide numbers having 38 digits (127 bits) which can be further enhanced by simple modifications.

Keywords

Division Algorithm, Fast BCD Division, Vedic Division Algorithm.
User
Notifications
Font Size

Abstract Views: 294

PDF Views: 168




  • Vedivision - A Fast BCD Division Algorithm Facilitated by Vedic Mathematics

Abstract Views: 294  |  PDF Views: 168

Authors

Diganta Sengupta
Department of Applied Electronics and Instrumentation Engineering, Future Institute of Engineering and Management, Kolkata, India
Mahamuda Sultana
Department of Computer Science and Engineering, Swami Vivekananda Institute of Science and Technology, Kolkata, India
Atal Chaudhuri
Department of Computer Science and Engineering, Jadavpur University, Kolkata, India

Abstract


Of the four elementary operations, division is the most time consuming and expensive operation in modern day processors. This paper uses the tricks based on Ancient Indian Vedic Mathematics System to achieve a generalized algorithm for BCD division in a much time efficient and optimised manner than the conventional algorithms in literature. It has also been observed that the algorithm in concern exhibits remarkable results when executed on traditional mid range processors with numbers having size up to 15 digits (50 bits). The present form of the algorithm can divide numbers having 38 digits (127 bits) which can be further enhanced by simple modifications.

Keywords


Division Algorithm, Fast BCD Division, Vedic Division Algorithm.