Abstract Views :208 |
PDF Views:114
Authors
Affiliations
1 Department of Applied Electronics and Instrumentation Engineering, Future Institute of Engineering and Management, Kolkata, IN
2 Department of Computer Science and Engineering, Swami Vivekananda Institute of Science and Technology, Kolkata, IN
3 Department of Computer Science and Engineering, Jadavpur University, Kolkata, IN
Source
AIRCC's International Journal of Computer Science and Information Technology, Vol 5, No 4 (2013), Pagination: 67-80
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.
Full Text
